Faculty
Dániel Marx is tenured Faculty at CISPA. He obtained his PhD in 2005 at the Budapest University of Technology and Economics in Hungary. After that, he had postdoc researcher and visiting researcher positions in Berlin, Budapest, and Tel Aviv. From 2012 to 2019, he was at the Institute for Computer Science and Control of the Hungarian Academy of Sciences, where he has founded the Parameterized Algorithms and Complexity group, funded from his European Research Council Starting and Consolidator Grants. In 2019, he became a senior researcher at the Max Planck Institute for Informatics in Saarbrücken, and joined CISPA as a tenured faculty member in 2020. Dániel is known for his theoretical work on algorithms and lower bounds for a wide range of problems.
International Colloquium on Automata Languages and Programming (ICALP)
Robust Contraction Decomposition for Minor-Free Graphs and its Applications
European Symposium on Algorithms (ESA)
European Symposium on Algorithms (ESA)
42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)
Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances
ACM-SIAM Symposium on Discrete Algorithms (SODA)
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
European Symposium on Algorithms (ESA)
Generalized Graph Packing Problems Parameterized by Treewidth
Algorithmica Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
International Symposium on Algorithms and Computation (ISAAC)
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges
European Symposium on Algorithms (ESA)
Hitting Meets Packing: How Hard Can It Be?
European Symposium on Algorithms (ESA)
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs.