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)
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
International Colloquium on Automata Languages and Programming (ICALP)
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness.
ACM Symposium on Theory of Computing (STOC)
International Symposium on Computational Geometry (SoCG)
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
ACM Transactions on Algorithms (TALG)
SIAM Symposium on Simplicity in Algorithms (SOSA)
Algorithmica: an international journal in computer science
ACM-SIAM Symposium on Discrete Algorithms (SODA)
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.