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 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.
European Symposium on Algorithms (ESA)
Hitting Meets Packing: How Hard Can It Be?
International Colloquium on Automata Languages and Programming (ICALP)
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness.
International Colloquium on Automata Languages and Programming (ICALP)
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces
International Colloquium on Automata Languages and Programming (ICALP)
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification
ACM Symposium on Theory of Computing (STOC)
Counting Small Induced Subgraphs with Edge-Monotone Properties
International Symposium on Computational Geometry (SoCG)
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
ACM Transactions on Algorithms (TALG)