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.
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.
Seminar on Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs.