| Date | Author/Title | | Document Type |
|---|
| 2020 | Kratsch, S and Li, S and Marx, Dániel and Pilipczuk, Marcin and Wahlstrom, Magnus
Multi-budgeted Directed Cuts | | Article |
| 2020 | Feldmann, A E and Marx, Dániel
The Parameterized Hardness of the k-Center Problem in Transportation Networks |  | Article |
| 2019 | Cohen-Addad, V and de, Verdière É C and Marx, Dániel and de, Mesmay A
Almost tight lower bounds for hard cutting problems in embedded graphs | | Book Section |
| 2019 | Bonnet, É and Brettell, N and Kwon, O-J and Marx, Dániel
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms | | Article |
| 2019 | Marx, Dániel and Williams, V V and Young, N E
Introduction to the Special Issue on SODA 2017 | | Article |
| 2019 | Göke, A and Marx, Dániel and Mnich, M
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set | | Article |
| 2019 | Amiri, S A and Kreutzer, S and Marx, Dániel and Rabinovich, R
Routing with congestion in acyclic digraphs | | Article |
| 2019 | Bacsó, Gábor and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Tuza, Zsolt
Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs | | Article |
| 2018 | Chatzigiannakis, I and Kaklamanis, C and Marx, Dániel and Sannella, D
45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 | | Book |
| 2018 | Chen, L and Marx, Dániel
Covering a tree with rooted subtrees -parameterized and approximation algorithms | | Book Section |
| 2018 | Egri, L and Marx, Dániel and Rzazewski, P
Finding list homomorphisms from bounded-treewidth graphs to reflexive graphs: A complete complexity characterization | | Book Section |
| 2018 | Biró, Cs and Bonnet, É and Marx, Dániel and Miltzow, T and Rzazewski, P
Fine-grained complexity of coloring unit disks and balls | | Article |
| 2018 | Bonnet, E and Brettell, N and Kwon, OJ and Marx, Dániel
Generalized Feedback Vertex set problems on bounded-treewidth graphs: Chordality is the key to single-exponential parameterized algorithms | | Book Section |
| 2018 | Lokshtanov, D and Marx, Dániel and Saurabh, S
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal | | Article |
| 2018 | Marx, Dániel and Pilipczuk, M and Pilipczuk, M
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs | | Book Section |
| 2018 | Lokshtanov, D and Marx, Dániel and Saurabh, S
Slightly Superexponential Parameterized Problems | | Article |
| 2018 | De, Berg M and Bodlaender, HL and Kisfaludi-Bak, S and Marx, Dániel and Van, Der Zanden TC
A framework for ETH-Tight algorithms and lower bounds in geometric intersection graphs | | Book Section |
| 2018 | Feldmann, AE and Marx, Dániel
The parameterized hardness of the k-center problem in transportation networks | | Book Section |
| 2017 | Aboulker, P and Brettell, N and Havet, F and Marx, Dániel and Trotignon, N
Coloring Graphs with Constraints on Connectivity | | Article |
| 2017 | Biró, C and Bonnet, É and Marx, Dániel and Miltzow, Tillmann and Rzazewski, Pavel Michael
Fine-grained complexity of coloring unit disks and balls | | Book Section |
| 2017 | Bacsó, Gábor and Marx, Dániel and Tuza, Zsolt
H-free graphs, Independent Sets, and subexponential-time algorithms | | Book Section |
| 2017 | Cygan, M and Marx, Dániel and Pilipczuk, M and Pilipczuk, M
Hitting forbidden subgraphs in graphs of bounded treewidth | | Article |
| 2017 | Curticapean, Radu and Dell, H and Marx, Dániel
Homomorphisms are a good basis for counting small subgraphs | | Book Section |
| 2017 | Chitnis, R and Egri, L and Marx, Dániel
List H-Coloring a Graph by Removing Few Vertices | | Article |
| 2017 | Chen, L and Marx, Dániel and Ye, D and Zhang, G
Parameterized and approximation results for scheduling with a low rank processing time matrix | | Book Section |
| 2017 | Marx, Dániel and Seymour, P and Wollan, P
Rooted grid minors | | Article |
| 2017 | Marx, Dániel and Pilipczuk, M
Subexponential parameterized algorithms for graphs of polynomial growth | | Book Section |
| 2016 | Cao, Yixin and Marx, Dániel
Chordal Editing is Fixed-Parameter Tractable | | Article |
| 2016 | Feldmann, Andreas Emil and Marx, Dániel
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems | | Book Section |
| 2016 | Marx, Dániel and Salmasi, A and Sidiropoulos, A
Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs | | Book Section |
| 2016 | Marx, Dániel and Mitsou, Valia
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. | | Book Section |
| 2016 | Bonnet, Édouard and Egri, László and Marx, Dániel
Fixed-Parameter Approximability of Boolean MinCSPs | | Book Section |
| 2016 | Cygan, M and Dell, H and Lokshtanov, D and Marx, Dániel and Nederlof, J
On Problems as Hard as CNF-SAT | | Article |
| 2016 | Bateni, M and Hajiaghayi, M and Demaine, ED and Marx, Dániel
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting | | Book Section |
| 2016 | Kratsch, S and Marx, Dániel and Wahlstrom, M
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems | | Article |
| 2016 | Bonnet, Édouard and Brettel, Nick and Kwon, O-joung and Marx, Dániel
Parameterized vertex deletion problems for hereditary graph classes with a block property | | Article |
| 2016 | Marx, Dániel and Miltzow, Tillmann
Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems | | Book Section |
| 2016 | Amiri, S A and Kreutzer, S and Marx, Dániel and Rabinovich, R
Routing with Congestion in Acyclic Digraphs | | Book Section |
| 2016 | Fomin, FV and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Pilipczuk, M
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering | | Book Section |
| 2016 | Curticapean, Radu and Marx, Dániel
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus | | Book Section |
| 2015 | Jansen, BMP and Marx, Dániel
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels | | Book Section |
| 2015 | Chitnis, R and Cygan, M and Hajiaghayi, M and Marx, Dániel
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable | | Article |
| 2015 | Marx, Dániel and Végh, LA
Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation | | Article |
| 2015 | Cao, Y and Marx, Dániel
Interval Deletion Is Fixed-Parameter Tractable | | Article |
| 2015 | Marx, Dániel and Pilipczuk, M
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams | | Book Section |
| 2015 | Grohe, M and Marx, Dániel
Structure theorem and isomorphism test for graphs with excluded topological subgraphs | | Article |
| 2015 | Marx, Dániel and Wollan, P
An exact characterization of tractable demand patterns for maximum disjoint path problems | | Book Section |
| 2014 | Marx, Dániel
Chordal editing is fixed-parameter tractable | | Article |
| 2014 | Curticapean, Radu and Marx, Dániel
Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts | | Book Section |
| 2014 | Bulatov, AA and Marx, Dániel
Constraint satisfaction parameterized by solution size | | Article |
| 2014 | Grohe, M and Marx, Dániel
Constraint solving via fractional edge covers | | Article |
| 2014 | Marx, Dániel and Pilipczuk, Michal
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) | | Article |
| 2014 | Dell, Holger and Husfeldt, Thore and Marx, Dániel and Taslaman, Nina and Wahlén, Martin
Exponential time complexity of the permanent and the Tutte polynomial | | Article |
| 2014 | Guillemot, Sylvain and Marx, Dániel
Finding small patterns in permutations in linear time | | Book Section |
| 2014 | Marx, Dániel and Razgon, Igor
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset | | Article |
| 2014 | Cygan, Marek and Marx, Dániel and Pilipczuk, Marcin and Pilipczuk, Michal
Hitting forbidden subgraphs in graphs of bounded treewidth | | Article |
| 2014 | Marx, Dániel and Wollan, P
Immersions in highly edge connected graphs | | Article |
| 2014 | Cao, Yixin and Marx, Dániel
Interval deletion is fixed-parameter tractable | | Book Section |
| 2014 | Demaine, Erik D. and Hajiaghayi, Mohammad T. and Marx, Dániel
Minimizing movement: Fixed-parameter tractability | | Article |
| 2014 | Heggernes, Pinar and van 't Hof, Pim and Marx, Dániel and Misra, Neeldhara and Villanger, Yngve
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties | | Article |
| 2014 | Cygan, Marek and Marx, Dániel and Pilipczuk, Marcin and Pilipczuk, Michal and Schlotter, Ildikó Anna
Parameterized complexity of Eulerian deletion problems | | Article |
| 2014 | Chitnis, R and Hajiaghayi, M and Marx, Dániel
Tight bounds for planar strongly connected steiner subgraph with fixed number of terminals (and extensions) | | Book Section |
| 2014 | Marx, Dániel and Sidiropoulos, A
The limited blessing of low dimensionality: When 1-1/d is the best possible exponent for d-dimensional geometric problems | | Book Section |
| 2014 | Klein, PN and Marx, Dániel
A subexponential parameterized algorithm for Subset TSP on planar graphs | | Book Section |
| 2013 | Jansen, K and Kratsch, S and Marx, Dániel and Schlotter, I
Bin packing with fixed number of bins revisited | | ISI Article |
| 2013 | Chen, H and Marx, Dániel
Block-sorted quantified conjunctive queries | | Conference or Workshop Item |
| 2013 | Chen, Hubie and Marx, Dániel
Block-sorted quantified conjunctive queries | | Book Section |
| 2013 | Lokshtanov, D and Marx, Dániel
Clustering with local restrictions | | ISI Article |
| 2013 | Marx, Dániel
Completely inapproximable monotone and antimonotone parameterized problems | | ISI Article |
| 2013 | Guillemot, Sylvain and Marx, Dániel
A Faster FPT Algorithm for Bipartite Contraction | | Conference or Workshop Item |
| 2013 | Marx, Dániel and O'Sullivan, B and Razgon, I
Finding small separators in linear time via treewidth reduction | | ISI Article |
| 2013 | Marx, Dániel and Végh, LA
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation | | Conference or Workshop Item |
| 2013 | Marx, Dániel and Végh, LA
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation | | Book Section |
| 2013 | Chitnis, R and Hajiaghayi, M and Marx, Dániel
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset | | ISI Article |
| 2013 | Chitnis, R and Egri, László and Marx, Dániel
List H-coloring a graph by removing few vertices | | Conference or Workshop Item |
| 2013 | Chitnis, Rajesh and Egri, László and Marx, Dániel
List H-coloring a graph by removing few vertices | | Book Section |
| 2013 | Atserias, A and Grohe, M and Marx, Dániel
Size bounds and query plans for relational joins | | ISI Article |
| 2013 | Marx, Dániel
Tractable hypergraph properties for constraint satisfaction and conjunctive queries | | ISI Article |
| 2013 | Guillemot, Sylvain and Marx, Dániel
A faster FPT algorithm for Bipartite Contraction | | ISI Article |
| 2013 | Cygan, M and Marx, Dániel and Pilipczuk, M and Pilipczuk, M
The planar directed k -Vertex-Disjoint Paths problem is fixed-parameter tractable | | Conference or Workshop Item |
| 2013 | Marx, Dániel
The square root phenomenon in planar graphs | | Conference or Workshop Item |
| 2012 | Bulatov, AA and Dalmau, V and Grohe, M and Marx, Dániel
Enumerating homomorphisms | | ISI Article |
| 2012 | Cygan, M and Dell, H and Lokshtanov, D and Marx, Dániel and Nederlof, J and Okamoto, Y and Paturi, R and Saurabh, S and Wahlström, M
On problems as hard as CNF-SAT | | Conference or Workshop Item |
| 2012 | Heggernes, P and T, Hof and Marx, Dániel and Misra, N and Villanger, Y
On the parameterized complexity of finding separators with non-hereditary properties | | Conference or Workshop Item |
| 2012 | Grohe, M and Marx, Dániel
Structure theorem and isomorphism test for graphs with excluded topological subgraphs | | Conference or Workshop Item |
