Dániel Marx

Dániel Marx is a tenured Professor at the CISPA Helmholtz Center for Information Security in Saarbrücken, Germany. He leads research in the area of Algorithmic Foundations and Cryptography, with a focus on parameterized algorithms and computational complexity. He has held previous positions at the Max Planck Institute for Informatics and the Institute for Computer Science and Control of the Hungarian Academy of Sciences (MTA SZTAKI). His work is highly theoretical, aiming to understand the precise complexity of algorithmic problems, especially on bounded-treewidth graphs and in parameterized settings.

• PhD: Budapest University of Technology and Economics, 2005
• Postdoc: Tel Aviv University, Humboldt University Berlin
• Senior Research Fellow: MTA SZTAKI, 2012–2019
• Senior Researcher: Max Planck Institute for Informatics, 2019–2020
• Faculty: CISPA Helmholtz Center, 2020–present

His research interests lie at the intersection of theoretical computer science and discrete mathematics. He is particularly known for his work on parameterized algorithms, fine-grained complexity, and lower bounds. His group investigates algorithmic graph theory problems, including domination, independence, homomorphism, and clustering, especially under structural constraints like bounded treewidth. He has pioneered techniques in dynamic programming, kernelization, and hardness proofs based on the Exponential Time Hypothesis.

The recent publications of Dániel Marx reveal a consistent focus on establishing tight complexity bounds for fundamental algorithmic problems. His work spans from exact and parameterized algorithms to approximation and counting problems. A recurring theme is the analysis of problems on bounded-treewidth graphs, where he explores the boundary between tractable and intractable cases. He also contributes to network design (e.g., Steiner problems), clustering, and subgraph counting, often providing complete classifications of complexity based on parameters.

• European Research Council Starting Grant
• European Research Council Consolidator Grant
• Humboldt Research Fellowship for Experienced Researchers

Dániel Marx has advised numerous researchers and collaborated widely across institutions. His research is supported by prestigious grants, including ERC grants that funded his group at MTA SZTAKI. He actively leads a research group at CISPA focused on parameterized algorithms and complexity. While specific PhD students are not listed in the provided text, his extensive co-authorship network indicates a strong mentoring and collaborative presence. His work has significant implications for the foundations of computer science and algorithm design.

He leads the research group on Parameterized Algorithms and Complexity at CISPA, continuing his long-standing focus on theoretical algorithm design and analysis. His team works on foundational problems in graph algorithms and complexity theory, aiming to develop new algorithmic techniques and understand the limits of efficient computation.