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 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.
ACM-SIAM Symposium on Discrete Algorithms (SODA) Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
European Symposium on Algorithms (ESA) Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
ACM-SIAM Symposium on Discrete Algorithms (SODA) Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
ACM-SIAM Symposium on Discrete Algorithms (SODA) Kernelization of Packing Problems
International Colloquium on Automata Languages and Programming (ICALP) Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable.