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.
ACM SIGMOD-SIGACT-SIGART Conference on Principles of Database Systems (PODS)
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction
Symposium on Foundations of Responsible Computing (FORC)
Journal of the ACM
SIAM Journal on Computing
European Symposium on Algorithms (ESA)
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy
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.