Dániel Marx

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 150

Top Venues

CoRR

SODA

Algorithmica

ACM Trans. Algorithms

Publications

Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. ICALP (2024)
Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. SOSA (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86 (1) (2024)
Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. SoCG (2024)
Jacob Focke, Dániel Marx, Pawel Rzazewski
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. ACM Trans. Algorithms 20 (2) (2024)
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. CoRR (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. SODA (2024)
Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. ICALP (2024)
Simon Döring, Dániel Marx, Philip Wellnitz
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. CoRR (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica 86 (5) (2024)
Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
Hitting Meets Packing: How Hard Can it Be? CoRR (2024)
Simon Döring, Dániel Marx, Philip Wellnitz
Counting Small Induced Subgraphs with Edge-Monotone Properties. STOC (2024)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. ICALP (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978 (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR (2023)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR (2023)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR (2023)
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA (2023)
Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. SODA (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. IPEC (2023)
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR (2023)
Simon Döring, Dániel Marx, Philip Wellnitz
Counting Small Induced Subgraphs with Edge-monotone Properties. CoRR (2023)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation Schemes for Clustering with General Norm Objectives. FOCS (2023)
Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. CoRR (2023)
Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. CoRR (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. CoRR (2023)
Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). Dagstuhl Reports 12 (5) (2022)
Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. 51 (6) (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR (2022)
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. CoRR (2022)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. SoCG (2022)
Jacob Focke, Dániel Marx, Pawel Rzazewski
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. SODA (2022)
Alexander Göke, Dániel Marx, Matthias Mnich
Parameterized algorithms for generalizations of Directed Feedback Vertex Set. Discret. Optim. 46 (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. WG (2022)
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. SODA (2022)
Dániel Marx, R. B. Sandeep
-free edge modification problems: Towards a dichotomy. J. Comput. Syst. Sci. 125 (2022)
Dániel Marx
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction. CoRR (2022)
Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. CoRR (2022)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). IPEC (2022)
Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs. SIAM J. Comput. 51 (2) (2022)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. CoRR (2022)
Dániel Marx, Michal Pilipczuk
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ACM Trans. Algorithms 18 (2) (2022)
Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. IPEC (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA (2022)
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs. CoRR (2022)
Vincent Cohen-Addad, Philip N. Klein, Dániel Marx, Archer Wheeler, Christopher Wolfram
On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting. FORC (2021)
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR (2021)
Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
Parameterized Intractability of Even Set and Shortest Vector Problem. J. ACM 68 (3) (2021)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. ICALP (2021)
Jacob Focke, Dániel Marx, Pawel Rzazewski
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. CoRR (2021)
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. J. ACM 68 (4) (2021)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. CoRR (2021)
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Finding and Counting Permutations via CSPs. Algorithmica 83 (8) (2021)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). CoRR (2021)
Dániel Marx
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction. PODS (2021)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. 49 (6) (2020)
Marvin Künnemann, Dániel Marx
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction. Computational Complexity Conference (2020)
Alexander Göke, Dániel Marx, Matthias Mnich
Hitting Long Directed Cycles is Fixed-Parameter Tractable. CoRR (2020)
Dániel Marx
Four Shorts Stories on Surprising Algorithmic Uses of Treewidth. Treewidth, Kernels, and Algorithms (2020)
Rajesh Hemant Chitnis, Andreas Emil Feldmann, Mohammad Taghi Hajiaghayi, Dániel Marx
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM J. Comput. 49 (2) (2020)
Dániel Marx
Chordless Cycle Packing Is Fixed-Parameter Tractable. ESA (2020)
Vincent Cohen-Addad, Philip N. Klein, Dániel Marx
On the computational tractability of a geographic clustering problem arising in redistricting. CoRR (2020)
Dániel Marx, R. B. Sandeep
Incompressibility of H-free edge modification problems: Towards a dichotomy. CoRR (2020)
Alexander Göke, Dániel Marx, Matthias Mnich
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CoRR (2020)
Andreas Emil Feldmann, Dániel Marx
The Parameterized Hardness of the k-Center Problem in Transportation Networks. Algorithmica 82 (7) (2020)
Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
Multi-budgeted Directed Cuts. Algorithmica 82 (8) (2020)
Dániel Marx
Four short stories on surprising algorithmic uses of treewidth. CoRR (2020)
Alexander Göke, Dániel Marx, Matthias Mnich
Hitting Long Directed Cycles Is Fixed-Parameter Tractable. ICALP (2020)
Marvin Künnemann, Dániel Marx
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-grained Perspective into Boolean Constraint Satisfaction. CoRR (2020)
Dániel Marx, R. B. Sandeep
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. ESA (2020)
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica 81 (2) (2019)
Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
Parameterized Intractability of Even Set and Shortest Vector Problem. Electron. Colloquium Comput. Complex. 26 (2019)
Fedor V. Fomin, Dániel Marx, Saket Saurabh, Meirav Zehavi
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Dagstuhl Reports 9 (1) (2019)
Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
How does object fatness impact the complexity of packing in d dimensions? CoRR (2019)
Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS (2019)
Alexander Göke, Dániel Marx, Matthias Mnich
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CIAC (2019)
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Routing with congestion in acyclic digraphs. Inf. Process. Lett. 151 (2019)
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Finding and Counting Permutations via CSPs. IPEC (2019)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. Algorithmica 81 (10) (2019)
Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
Parameterized Intractability of Even Set and Shortest Vector Problem. CoRR (2019)
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. SoCG (2019)
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Finding and counting permutations via CSPs. CoRR (2019)
Lin Chen, Dániel Marx
Covering a tree with rooted subtrees. CoRR (2019)
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. CoRR (2019)
Dániel Marx, Virginia Vassilevska Williams, Neal E. Young
Introduction to the Special Issue on SODA 2017. ACM Trans. Algorithms 15 (2) (2019)
Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
How Does Object Fatness Impact the Complexity of Packing in d Dimensions? ISAAC (2019)
Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Slightly Superexponential Parameterized Problems. CoRR (2019)
Rajesh Chitnis, Andreas Emil Feldmann, MohammadTaghi Hajiaghayi, Dániel Marx
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). CoRR (2019)
Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
Multi-Budgeted Directed Cuts. IPEC (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC (2018)
Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Slightly Superexponential Parameterized Problems. SIAM J. Comput. 47 (3) (2018)
Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
Multi-budgeted directed cuts. CoRR (2018)
Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. FOCS (2018)
Lin Chen, Dániel Marx
Covering a tree with rooted subtrees - parameterized and approximation algorithms. SODA (2018)
László Egri, Dániel Marx, Pawel Rzazewski
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. STACS (2018)

Dániel Marx.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dániel Marx