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.
Algorithmica Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
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) 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.
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) 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