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.
CIAC
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set
IEEE Symposium on Foundations of Computer Science (FOCS)
On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs
ACM Symposium on Theory of Computing (STOC)
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
SWAT
The Parameterized Hardness of the k-Center Problem in Transportation Networks.
International Symposium on Parameterized and Exact Computation (IPEC)
Multi-Budgeted Directed Cuts.
International Symposium on Parameterized and Exact Computation (IPEC)
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms.
IEEE Symposium on Foundations of Computer Science (FOCS)
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
SWAT
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk).
ICALP
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems.
MFCS International Symposium on Mathematical Foundations of Computer Science (MFCS)
Routing with Congestion in Acyclic Digraphs.