Faculty
Dr. Dániel Marx ist tenured Faculty am CISPA. Er promovierte 2005 an der Budapest University of Technology and Economics in Ungarn. Danach hatte er Postdoc- und Gastforscherpositionen in Berlin, Budapest und Tel Aviv. Von 2012 bis 2019 war er am Institute for Computer Science and Control der Hungarian Academy of Sciences, wo er die Gruppe Parameterized Algorithms and Complexity gründete. Förderung erhielt er durch einen ERC Starting und Consolidator Grant. 2019 wurde er leitender Wissenschaftler am Max-Planck-Institut für Informatik in Saarbrücken und wechselte 2020 als tenured Faculty ans CISPA. Dániel ist bekannt für seine theoretischen Arbeiten zu Algorithmen und unteren Grenzwerten für eine Vielzahl an Problemen.
IEEE Symposium on Foundations of Computer Science (FOCS) Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
MFCS International Symposium on Mathematical Foundations of Computer Science (MFCS) Routing with Congestion in Acyclic Digraphs.
SWAT The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk).
ICALP The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems.
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.
ACM Symposium on Theory of Computing (STOC) Finding topological subgraphs is fixed-parameter tractable