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.
European Symposium on Algorithms (ESA) Chordless Cycle Packing Is Fixed-Parameter Tractable
Computational Complexity Conference(CCC2020) Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction.
International Colloquium on Automata Languages and Programming (ICALP) Hitting Long Directed Cycles Is Fixed-Parameter Tractable.
ISAAC How Does Object Fatness Impact the Complexity of Packing in d Dimensions?
International Symposium on Computational Geometry (SoCG) Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.
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) Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms.