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 Symposium on Theory of Computing (STOC) Finding topological subgraphs is fixed-parameter tractable
ACM-SIAM Symposium on Discrete Algorithms (SODA) Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal
ACM-SIAM Symposium on Discrete Algorithms (SODA) Slightly Superexponential Parameterized Problems
International Colloquium on Automata Languages and Programming (ICALP) Clustering with Local Restrictions
ACM Symposium on Theory of Computing (STOC) Tractable hypergraph properties for constraint satisfaction and conjunctive queries
IEEE Annual Conference on Computational Complexity (CCC) Completely inapproximable monotone and antimonotone parameterized problems
Annual Symposium on Logic in Computer Science The complexity of global cardinality constraints
Seminar on Parameterized Complexity and Approximation Algorithms 09511 Open Problems - Parameterized complexity and approximation algorithms.
Seminar on Parameterized Complexity and Approximation Algorithms 09511 Executive Summary - Parameterized complexity and approximation algorithms.
Seminar on Parameterized Complexity and Approximation Algorithms 09511 Abstracts Collection - Parameterized complexity and approximation algorithms.