جستجوی استاد راهنمای دانشگاهی

Diego F. Aranhaمشاهده پروفایل

دانشیار

• Cryptography
• Cybersecurity
• Homomorphic Encryption
• +۷ مورد دیگر

Diego F. Aranha is an Associate Professor in the Department of Computer Science at Aarhus University . His research focuses on cryptographic systems, cybersecurity, and privacy-preserving technologies with applications in voting systems, post-quantum cryptography, and secure computation. He has contributed extensively to homomorphic encryption, secure multiparty computation (MPC), and cryptanalysis of cryptographic implementations. Key projects include: MPCC (2025-2028) : Multi-Party Computation in the Confidential Cloud SCI (2024-2027) : Secure Computation Infrastructures for the Retail Industry RENAIS (2021-2026) : Residue Number Systems for Cryptography His work emphasizes practical efficiency and formal verification of cryptographic protocols. Recent publications highlight advancements in lattice-based cryptography, secure voting schemes, and mitigating side-channel vulnerabilities in post-quantum algorithms. He actively collaborates on open-source cryptographic libraries and standards, with a focus on bridging theoretical security and real-world implementation challenges.

• Algorithms
• Computational Complexity
• Differential Privacy
• +۳ مورد دیگر

Lukas Retschmeier is a Research Fellow at the Department of Computer Science , University of Copenhagen , affiliated with the Algorithms and Complexity section under the Faculty of Science . His research focuses on: Algorithms Computational Complexity Differential Privacy The trends in his recent publications highlight expertise in privacy-preserving graph algorithms, computational complexity in graph theory, and optimization under privacy constraints.

Pourya Forooghiمشاهده پروفایل

دانشیار

• Fluid Mechanics
• Heat Transfer
• Power-to-X
• +۳ مورد دیگر

Pourya Forooghi serves as Associate Professor in the Department of Mechanical and Production Engineering at Aarhus University's School of Engineering, Denmark. His active research profile is anchored in the university's heat and fluid flow group, with direct contact available via telephone (+45 93 52 23 03) and email (forooghi@mpe.au.dk). Current activities include conference contributions such as the 2024 ERCOFTAC Symposium lecture on electrolyzer modeling. Research Interests His work spans fundamental and applied fluid dynamics with emphasis on: Turbulent flow over complex rough surfaces (anisotropic, patchy, irregular) Thermohydraulic roughness characterization Data-driven modeling for drag and heat transfer prediction Power-to-X (PtX) energy systems Secondary flows in boundary layers Cryogenic heat transfer (frost formation, evaporators) Publication Trends Analysis of his 2023-2025 publications reveals a dominant focus on roughness effects in turbulent flows using DNS and data-driven methods. Key patterns include hydrodynamic/thermal property characterization of realistic rough surfaces, drag reduction via spanwise forcing, and laminarization techniques in pipe flows. Applications concentrate on energy systems like CO2 heat pumps, PtX electrolyzers, and refrigeration evaporators. Scientific Awards No scientific awards, fellowships, or medals were documented in the provided materials. Advising and Grants The source text contains no explicit information regarding graduate students, postdoctoral advisees, or grant funding activities. His research group involvement suggests likely supervision responsibilities absent specific listings. Laboratories and Teams Forooghi leads computational research within Aarhus University's heat and fluid flow group, utilizing DNS/LES techniques and data-driven frameworks. His work integrates high-fidelity simulations with engineering applications, particularly in energy conversion systems requiring advanced roughness modeling.

• Computational Complexity
• Counting Problems
• Parameterized Complexity
• +۵ مورد دیگر

Radu-Cristian Curticapean is a Lecturer in Theoretical Computer Science Algorithms at the IT University of Copenhagen. His research focuses on computational complexity theory, particularly in counting problems, homomorphisms, and parameterized complexity. He is actively involved in multiple research projects including CountHom (Counting with homomorphisms), CountBeyond, and DIREC initiatives. His research interests center around computational complexity with emphasis on counting problems, graph homomorphisms, and polynomial time algorithms. His work explores fundamental questions in counting complexity, complexity dichotomies, and the boundaries of efficient computation. His research combines theoretical computer science with mathematical approaches to understand the inherent difficulty of computational problems. Analysis of his publications reveals a strong focus on computational complexity theory, particularly in counting problems and homomorphisms. His research consistently addresses fundamental questions in complexity theory, exploring the boundaries between tractable and intractable problems. His work spans algebraic complexity, parameterized complexity, and structural graph theory, with applications to understanding the permanent, immanants, and other fundamental computational problems. Dr. Curticapean serves as Principal Investigator for the CountBeyond and CountHom projects, and as Co-Investigator for the BARC (Basic Algorithms Research Copenhagen) project. His research is supported by prestigious funding bodies including the European Commission, Villum Fonden, and Innovation Fund Denmark. He has presented his work at major theoretical computer science conferences including SODA, ESA, and FSTTCS.

Lars Jaffkeمشاهده پروفایل

استادیار

• Graph Algorithms
• Parameterized Complexity
• Structural Graph Theory
• +۲ مورد دیگر

Lars Jaffke is an Assistant Professor in Informatics at NHH Norwegian School of Economics, Bergen, Norway. Previously, he held postdoctoral positions at IT University of Copenhagen (2024), University of Warsaw (2021-2022), and University of Bergen (2020-2021). He earned his PhD in Computer Science from the University of Bergen in 2020. Research Interests: His work focuses on algorithmic and structural aspects of graphs, particularly width measures (treewidth, pathwidth, mim-width) and their applications to graph classes. He investigates parameterized complexity, optimization problems, and algorithm design for graphs with bounded width parameters. Key Publications Trends: Recent works include algorithmic meta-theorems for mim-width, structural analysis of planar graphs, and complexity studies in graph coloring and domination problems. He develops dynamic programming techniques on specialized decompositions and explores logical characterizations of graph algorithms. Scientific Awards: IPEC Best Paper Award (2022) Travel Grant from L. Meltzer Fund (2021) Scholarship in Applied Computer Science, State of NRW (2012) Teaching & Service: He has served as course co-instructor for Algorithms and Programming with Python (2024) and taught Complexity Theory and graph algorithms at University of Bergen. He has been on program committees for IPEC 2024 and ESA 2023, and regularly reviews for top-tier conferences and journals like FOCS, STOC, SIAM Journal on Computing, and Theoretical Computer Science.

Thore Husfeldtمشاهده پروفایل

استاد

• Theoretical Computer Science
• Algorithms
• Graph Algorithms
• +۳ مورد دیگر

Thore Husfeldt is a Professor of Theoretical Computer Science at the IT University of Copenhagen, leading the Algorithms Research Group. He holds a PhD from the University of Aarhus (1997), a Docent title from Lund University (2007), and has been a Professor at the University of Lund since 2012. His research focuses on algorithms, with a concentration on exponential time algorithms, combinatorial optimization, and graph theory. Education Bachelor (B.Sc.) in Computer Science and Mathematics, University of Aarhus (1993) Cand. scient. (M.Sc.) in Computer Science, University of Aarhus (1994) Ph.D. in Science (Computer Science), University of Aarhus (1997) Docent, Lund University (2007) Professor of Computer Science, Lund University (2012) Research Interests Husfeldt’s work explores foundational aspects of algorithms, including exponential time algorithms for hard problems, graph algorithms, and combinatorial optimization. His recent contributions address topics like cycle detection, path enumeration, and efficient algorithm design for NP-hard problems. His research bridges theoretical computer science with practical algorithmic challenges. Awards Best Paper Award at ICALP 2014 (Track A: Algorithms, Complexity, and Games) Excellence in Teaching Award (2018) Grants & Projects Husfeldt leads major initiatives such as the BARC2: Basic Algorithms Research Copenhagen (Villum Foundation), focusing on theoretical algorithm research, and DIREC , developing algorithms education through animated videos. He also collaborates on projects like Unifying Theories for Graph Modification Problems (Independent Research Fund Denmark). Labs & Teams He oversees the Algorithms Research Group at ITU and contributes to the BARC (Basic Algorithms Research Copenhagen) initiative, fostering collaborations in algorithmic theory and applications.

Oskar Henrikssonمشاهده پروفایل

پژوهشگر ارشد

• Algebraic Geometry
• Tropical Geometry
• Reaction Network Theory
• +۲ مورد دیگر

Oskar Henriksson is a Research Fellow at the Department of Mathematical Sciences within the Faculty of Science at the University of Copenhagen. His office is located at Universitetsparken 5, 2100 Copenhagen. He completed his PhD in 2025 at the same institution under the supervision of Elisenda Feliu, focusing on algebraic methods in reaction network theory. Henriksson's research centers on computational algebraic geometry, tropical geometry, and combinatorial methods applied to reaction networks and algebraic statistics. He specializes in Gröbner bases, toric varieties, homotopy continuation, and tropical geometry, with applications in biological systems and statistical modeling. His recent publications focus on parametrized polynomial systems, genome reconstruction, and geometric methods in statistics. Thematic analysis shows strong emphasis on algorithmic approaches to biological and statistical problems through algebraic frameworks. His work is supported by two major grants: the ERC Consolidator Grant 'Signs, polynomials, and reaction networks' (POSALG-101044561) and the Novo Nordisk Foundation project (NNF20OC0065582).

Jakob Mannمشاهده پروفایل

استاد

• Wind Energy
• Remote Sensing
• Atmospheric Turbulence
• +۳ مورد دیگر

Jakob Mann is a Professor at the Department of Wind and Energy Systems , Technical University of Denmark. His research focuses on Wind Energy , Remote Sensing , and Atmospheric Turbulence , with applications in Offshore Wind Engineering and Micrometeorology . UN SDG Contributions : Renewable Energy (SDG 7), Climate Action (SDG 13) Recent Research Trends (based on 15 most recent publications): Wind turbine wake dynamics in complex terrain Improving turbulence measurements via advanced LiDAR configurations Offshore wind resource characterization and load modeling Micrometeorological studies of forest-edge and tree-scale wind interactions Supervision Activities Main supervisor for 4 active PhD projects (2023-2028) Co-supervisor in 3 additional PhD programs 26+ conference presentations including invited lectures Labs & Collaborations DTU Wind Energy (Roskilde, Denmark) Wind Energy Systems Division International collaborations in 12+ countries Leadership in 5 active research consortia

• Artificial Intelligence
• Social Intelligence
• Automated Planning
• +۳ مورد دیگر

Thomas Bolander is a Professor at the Technical University of Denmark (DTU) within the Department of Applied Mathematics and Computer Science, part of DTU Compute. His research focuses on logic, artificial intelligence, and social aspects of AI, particularly in creating socially intelligent systems. He has received the H. C. Ørsted Silver Medal (2019) for science communication and is active in public outreach. Bolander serves on editorial boards, expert panels, and commissions, including the Scandinavian Logic Society and TechDK. His research interests include epistemic logic, multi-agent systems, automated planning, and the ethical implications of AI. He has supervised multiple PhD students and teaches courses in mathematics, computer science, and AI at DTU. Notable projects involve epistemic planning for human-robot collaboration and formalizing algorithms in proof assistants. Recent publications emphasize parameterized complexity of belief updates, attention modeling in agents, and policy recommendations for tech giants. His work bridges theoretical foundations with practical applications in AI and robotics.

Troels Bjerre Lundمشاهده پروفایل

دانشیار

• Algorithmic Game Theory
• Equilibrium Computation
• Equilibrium Refinements
• +۴ مورد دیگر

Troels Bjerre Lund is an Associate Professor in the Computer Science Department at the IT University of Copenhagen. His research focuses on Algorithmic Game Theory , Equilibrium Computation , and Mechanism Design , with applications in artificial intelligence and poker game theory. He has served on program committees for major conferences including AAMAS, SAGT, IJCAI, AAAI, and EC. His work includes developing GT-Framework (gtf) for analyzing two-player zero-sum games and creating poker-playing AI systems like Tartanian and GS3. Education: PhD from Aarhus University (2008) Key Contributions: Polynomial-time algorithms for proper equilibrium computation, complexity analysis of game-theoretic concepts, and automated game abstraction techniques.

• Algorithms
• Graph Theory
• Theoretical Computer Science
• +۳ مورد دیگر

Paloma Thomé de Lima is a Lecturer in Theoretical Computer Science at IT University of Copenhagen. Her research focuses on graph theory, algorithms, and computational complexity, particularly in chordal graphs, induced subgraphs, and graph modification problems. Her work includes studies on bounded degree constraints, matching numbers, and polynomial time algorithms. Recent publications address problems in claw-free graphs, min-cut optimization, and structural graph theory. She has received the Best Paper Award at IPEC 2022 for collaborative research. Current projects include Unifying Theories for Graph Modification Problems funded by Danmarks Frie Forskningsfond (2023–2027).