| 2026 | ESA | The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs. | Jakob Greilhuber, Dniel Marx |
| 2026 | STOC | Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs. | Sndor Kisfaludi-Bak, Dniel Marx |
| 2026 | STOC | Pattern-Sparse Tree Decompositions in H-Minor-Free Graphs. | Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2025 | ESA | Generalized Graph Packing Problems Parameterized by Treewidth. | Baris Can Esmer, Dniel Marx |
| 2025 | ESA | Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern. | Florian Hrsch, Dniel Marx |
| 2025 | ICALP | Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dniel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue |
| 2025 | SODA | From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. | Simon Dring, Dniel Marx, Philip Wellnitz |
| 2025 | STACS | Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances. | Tim A. Hartmann, Dniel Marx |
| 2024 | ESA | List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. | Baris Can Esmer, Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2024 | ESA | Hitting Meets Packing: How Hard Can It Be? | Jacob Focke, Fabian Frei, Shaohua Li, Dniel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki |
| 2024 | ICALP | Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. | Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dniel Marx, Roohani Sharma, Joachim Spoerhase |
| 2024 | ICALP | Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. | Baris Can Esmer, Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2024 | ICALP | Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. | Esther Galby, Sndor Kisfaludi-Bak, Dniel Marx, Roohani Sharma |
| 2024 | ISAAC | From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. | Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hrsch, Dniel Marx |
| 2024 | SODA | Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. | Baris Can Esmer, Ariel Kulik, Dniel Marx, Daniel Neuen, Roohani Sharma |
| 2024 | STOC | Counting Small Induced Subgraphs with Edge-Monotone Properties. | Simon Dring, Dniel Marx, Philip Wellnitz |
| 2023 | FOCS | Parameterized Approximation Schemes for Clustering with General Norm Objectives. | Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dniel Marx, Roohani Sharma, Joachim Spoerhase |
| 2023 | SODA | Computing Square Colorings on Bounded-Treewidth and Planar Graphs. | Akanksha Agrawal, Dniel Marx, Daniel Neuen, Jasper Slusallek |
| 2023 | SODA | Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. | Jacob Focke, Dniel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz |
| 2022 | ESA | Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. | Baris Can Esmer, Ariel Kulik, Dniel Marx, Daniel Neuen, Roohani Sharma |
| 2022 | SODA | Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. | Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2022 | SODA | A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. | Dniel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale |
| 2022 | WG | Parameterized Complexity of Weighted Multicut in Trees. | Esther Galby, Dniel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale |
| 2021 | ICALP | Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. | Dniel Marx, Govind S. Sankar, Philipp Schepper |
| 2021 | PODS | Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction. | Dniel Marx |
| 2020 | ESA | Chordless Cycle Packing Is Fixed-Parameter Tractable. | Dniel Marx |
| 2020 | ESA | Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. | Dniel Marx, R. B. Sandeep |
| 2020 | ICALP | Hitting Long Directed Cycles Is Fixed-Parameter Tractable. | Alexander Gke, Dniel Marx, Matthias Mnich |
| 2019 | CIAC | Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. | Alexander Gke, Dniel Marx, Matthias Mnich |
| 2019 | ISAAC | How Does Object Fatness Impact the Complexity of Packing in d Dimensions? | Sndor Kisfaludi-Bak, Dniel Marx, Tom C. van der Zanden |
| 2018 | FOCS | On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. | Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2018 | SODA | Covering a tree with rooted subtrees - parameterized and approximation algorithms. | Lin Chen, Dniel Marx |
| 2018 | STOC | A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak, Dniel Marx, Tom C. van der Zanden |
| 2018 | STACS | Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. | Lszl Egri, Dniel Marx, Pawel Rzazewski |
| 2017 | ESA | Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. | Dniel Marx, Marcin Pilipczuk |
| 2017 | ICDT | Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk). | Dniel Marx |
| 2017 | STOC | Homomorphisms are a good basis for counting small subgraphs. | Radu Curticapean, Holger Dell, Dniel Marx |
| 2017 | STACS | Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix. | Lin Chen, Dniel Marx, Deshi Ye, Guochuan Zhang |
| 2016 | ESA | Fixed-Parameter Approximability of Boolean MinCSPs. | douard Bonnet, Lszl Egri, Dniel Marx |
| 2016 | FOCS | Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. | Fedor V. Fomin, Daniel Lokshtanov, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2016 | ICALP | The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. | Andreas Emil Feldmann, Dniel Marx |
| 2016 | ICALP | Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. | Dniel Marx, Valia Mitsou |
| 2016 | MFCS | Routing with Congestion in Acyclic Digraphs. | Saeed Akhoondian Amiri, Stephan Kreutzer, Dniel Marx, Roman Rabinovich |
| 2016 | SODA | Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. | Radu Curticapean, Dniel Marx |
| 2016 | STOC | A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. | MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2016 | WG | Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. | douard Bonnet, Nick Brettell, O-joung Kwon, Dniel Marx |
| 2015 | ESA | Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. | Dniel Marx, Michal Pilipczuk |
| 2015 | SODA | Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. | Bart M. P. Jansen, Dniel Marx |
| 2015 | SODA | An exact characterization of tractable demand patterns for maximum disjoint path problems. | Dniel Marx, Paul Wollan |
| 2014 | FOCS | Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. | Radu Curticapean, Dniel Marx |
| 2014 | MFCS | Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth. | Marek Cygan, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2014 | SODA | Interval Deletion is Fixed-Parameter Tractable. | Yixin Cao, Dniel Marx |
| 2014 | SODA | Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2014 | SODA | Finding small patterns in permutations in linear time. | Sylvain Guillemot, Dniel Marx |
| 2014 | SODA | A subexponential parameterized algorithm for Subset TSP on planar graphs. | Philip N. Klein, Dniel Marx |
| 2014 | STACS | Chordal Editing is Fixed-Parameter Tractable. | Yixin Cao, Dniel Marx |
| 2014 | STACS | Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). | Dniel Marx, Michal Pilipczuk |
| 2013 | AAIM | The Square Root Phenomenon in Planar Graphs. | Dniel Marx |
| 2013 | ESA | List H-Coloring a Graph by Removing Few Vertices. | Rajesh Hemant Chitnis, Lszl Egri, Dniel Marx |
| 2013 | FOCS | The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable. | Marek Cygan, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2013 | ICALP | Block-Sorted Quantified Conjunctive Queries. | Hubie Chen, Dniel Marx |
| 2013 | ICALP | The Square Root Phenomenon in Planar Graphs. | Dniel Marx |
| 2013 | ICALP | Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation. | Dniel Marx, Lszl A. Vgh |
| 2013 | STACS | Algorithmic Graph Structure Theory (Tutorial). | Dniel Marx |
| 2012 | ICALP | Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. | Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dniel Marx |
| 2012 | ICALP | Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time. | Philip N. Klein, Dniel Marx |
| 2012 | ICALP | A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals. | Dniel Marx |
| 2012 | SODA | Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2012 | SODA | Kernelization of packing problems. | Holger Dell, Dniel Marx |
| 2012 | STOC | Structure theorem and isomorphism test for graphs with excluded topological subgraphs. | Martin Grohe, Dniel Marx |
| 2012 | WG | On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. | Pinar Heggernes, Pim van 't Hof, Dniel Marx, Neeldhara Misra, Yngve Villanger |
| 2011 | CP | On Guaranteeing Polynomially Bounded Search Tree Size. | David A. Cohen, Martin C. Cooper, Martin James Green, Dniel Marx |
| 2011 | ICALP | Constraint Satisfaction Parameterized by Solution Size. | Andrei A. Bulatov, Dniel Marx |
| 2011 | ICALP | Clustering with Local Restrictions. | Daniel Lokshtanov, Dniel Marx |
| 2011 | SODA | Prize-collecting Steiner Problems on Planar Graphs. | MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dniel Marx |
| 2011 | SODA | Slightly Superexponential Parameterized Problems. | Daniel Lokshtanov, Dniel Marx, Saket Saurabh |
| 2011 | SODA | Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. | Daniel Lokshtanov, Dniel Marx, Saket Saurabh |
| 2011 | STOC | Finding topological subgraphs is fixed-parameter tractable. | Martin Grohe, Ken-ichi Kawarabayashi, Dniel Marx, Paul Wollan |
| 2011 | STOC | Fixed-parameter tractability of multicut parameterized by the size of the cutset. | Dniel Marx, Igor Razgon |
| 2011 | WG | Parameterized Complexity of Eulerian Deletion Problems. | Marek Cygan, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildik Schlotter |
| 2011 | WG | Important Separators and Parameterized Algorithms. | Dniel Marx |
| 2010 | MFCS | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. | Stefan Kratsch, Dniel Marx, Magnus Wahlstrm |
| 2010 | STOC | Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2010 | STOC | Tractable hypergraph properties for constraint satisfaction and conjunctive queries. | Dniel Marx |
| 2010 | STACS | Treewidth Reduction for Constrained Separation and Bipartization Problems. | Dniel Marx, Barry O'Sullivan, Igor Razgon |
| 2010 | WG | Parameterized Complexity of the Arc-Preserving Subsequence Problem. | Dniel Marx, Ildik Schlotter |
| 2009 | CP | Constraints of Difference and Equality: A Complete Taxonomic Characterisation. | Emmanuel Hebrard, Dniel Marx, Barry O'Sullivan, Igor Razgon |
| 2009 | ESA | Minimizing Movement: Fixed-Parameter Tractability. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2009 | ESA | Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. | Dniel Marx, Igor Razgon |
| 2009 | LICS | The Complexity of Global Cardinality Constraints. | Andrei A. Bulatov, Dniel Marx |
| 2009 | SODA | Approximating fractional hypertree width. | Dniel Marx |
| 2009 | STACS | Enumerating Homomorphisms. | Andrei A. Bulatov, Vctor Dalmau, Martin Grohe, Dniel Marx |
| 2009 | STACS | Tractable Structures for Constraint Satisfaction with Truth Tables. | Dniel Marx |
| 2008 | FOCS | Size Bounds and Query Plans for Relational Joins. | Albert Atserias, Martin Grohe, Dniel Marx |
| 2008 | ICALP | On the Hardness of Losing Weight. | Andrei A. Krokhin, Dniel Marx |
| 2008 | WG | Parameterized Graph Cleaning Problems. | Dniel Marx, Ildik Schlotter |
| 2007 | FOCS | Can you beat treewidth? | Dniel Marx |
| 2007 | FOCS | On the Optimality of Planar and Geometric Approximation Schemes. | Dniel Marx |
| 2007 | WG | Obtaining a Planar Graph by Vertex Deletion. | Dniel Marx, Ildik Schlotter |
| 2006 | ICALP | A Parameterized View on Matroid Optimization Problems. | Dniel Marx |
| 2006 | SODA | Constraint solving via fractional edge covers. | Martin Grohe, Dniel Marx |
| 2006 | WG | Chordal Deletion Is Fixed-Parameter Tractable. | Dniel Marx |
| 2005 | ESA | Efficient Approximation Schemes for Geometric Problems?. | Dniel Marx |
| 2005 | FOCS | The Closest Substring problem with small distances. | Dniel Marx |
| 2004 | WAOA | Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees. | Dniel Marx |
| 2003 | WAOA | Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract). | Dniel Marx |
| 2002 | MFCS | The Complexity of Tree Multicolorings. | Dniel Marx |
| 2000 | INFOCOM | Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks. | Tibor Cinkler, Dniel Marx, Claus Popp Larsen, Dniel Fogaras |