Dániel Marx - RankMe

363 papers A* 58A 30B 27C 1Journal 211Unranked 32

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs. CoRR Sándor Kisfaludi-Bak, Dániel Marx
2026	J	`jnl`	Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. Discret. Comput. Geom. Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
2026	J	`jnl`	Pattern-Sparse Tree Decompositions in H-Minor-Free Graphs. CoRR Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2026	J	`jnl`	Steiner Forest for CoRR Tala Eagling-Vose, David C. Kutner, Felicia Lucke, Dániel Marx, Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2025	J	`jnl`	Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). Algorithmica Dániel Marx, Govind S. Sankar, Philipp Schepper
2025	J	`jnl`	From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity. CoRR Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx
2025	A*	`conf`	From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. SODA Simon Döring, Dániel Marx, Philip Wellnitz
2025	A	`conf`	Generalized Graph Packing Problems Parameterized by Treewidth. ESA Baris Can Esmer, Dániel Marx
2025	J	`jnl`	Generalized Graph Packing Problems Parameterized by Treewidth. CoRR Baris Can Esmer, Dániel Marx
2025	A	`conf`	Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances. STACS Tim A. Hartmann, Dániel Marx
2025	J	`jnl`	Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern. CoRR Florian Hörsch, Dániel Marx
2025	A	`conf`	Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern. ESA Florian Hörsch, Dániel Marx
2025	J	`jnl`	On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects. CoRR Sujoy Bhore, Baris Can Esmer, Dániel Marx, Karol Wegrzycki
2025	A*	`conf`	Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. ICALP Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2025	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 25211). Dagstuhl Reports Manuel Bodirsky, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný, Zaneta Semanisinová
2025	J	`jnl`	The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs. CoRR Jakob Greilhuber, Dániel Marx
2025	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. ACM Trans. Algorithms Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2025	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. ACM Trans. Comput. Theory Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2024	J	`jnl`	Computing Generalized Convolutions Faster Than Brute Force. Algorithmica Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2024	—	`conf`	Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. SOSA Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
2024	J	`jnl`	Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. ACM Trans. Algorithms Jacob Focke, Dániel Marx, Pawel Rzazewski
2024	A*	`conf`	Counting Small Induced Subgraphs with Edge-Monotone Properties. STOC Simon Döring, Dániel Marx, Philip Wellnitz
2024	J	`jnl`	Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2024	B	`conf`	From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. ISAAC Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx
2024	J	`jnl`	From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. CoRR Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx
2024	J	`jnl`	From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. CoRR Simon Döring, Dániel Marx, Philip Wellnitz
2024	A*	`conf`	Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. ICALP Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2024	J	`jnl`	Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. CoRR Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2024	A	`conf`	Hitting Meets Packing: How Hard Can It Be? ESA Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
2024	J	`jnl`	Hitting Meets Packing: How Hard Can it Be? CoRR Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
2024	A	`conf`	List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. ESA Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2024	A*	`conf`	Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. SoCG Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
2024	J	`jnl`	New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition (Dagstuhl Seminar 24411). Dagstuhl Reports Fedor V. Fomin, Dániel Marx, Saket Saurabh, Roohani Sharma, Madhumita Kundu
2024	A*	`conf`	Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. SODA Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2024	A*	`conf`	Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. ICALP Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
2024	J	`jnl`	Robust Contraction Decomposition for Minor-Free Graphs and its Applications. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2024	A*	`conf`	Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. ICALP Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
2023	B	`conf`	Approximate Monotone Local Search for Weighted Problems. IPEC Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023	J	`jnl`	Approximate Monotone Local Search for Weighted Problems. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023	A*	`conf`	Computing Square Colorings on Bounded-Treewidth and Planar Graphs. SODA Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
2023	J	`jnl`	Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. CoRR Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
2023	J	`jnl`	Counting Small Induced Subgraphs with Edge-monotone Properties. CoRR Simon Döring, Dániel Marx, Philip Wellnitz
2023	J	`jnl`	Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. CoRR Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
2023	J	`jnl`	Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023	A*	`conf`	Parameterized Approximation Schemes for Clustering with General Norm Objectives. FOCS Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
2023	J	`jnl`	Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
2023	J	`jnl`	Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
2023	J	`jnl`	Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2023	J	`jnl`	The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ACM Trans. Comput. Theory Andreas Emil Feldmann, Dániel Marx
2023	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2023	A*	`conf`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2022	A*	`conf`	A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. SODA Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
2022	J	`jnl`	A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs. SIAM J. Comput. Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2022	B	`conf`	Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). IPEC Dániel Marx, Govind S. Sankar, Philipp Schepper
2022	B	`conf`	Computing Generalized Convolutions Faster Than Brute Force. IPEC Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022	J	`jnl`	Computing Generalized Convolutions Faster Than Brute Force. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022	J	`jnl`	Computing Square Colorings on Bounded-Treewidth and Planar Graphs. CoRR Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
2022	A*	`conf`	Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. SODA Jacob Focke, Dániel Marx, Pawel Rzazewski
2022	B	`conf`	Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	A*	`conf`	Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. SoCG Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
2022	J	`jnl`	Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. CoRR Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
2022	J	`jnl`	Dynamic time warping under translation: Approximation guided by space-filling curves. J. Comput. Geom. Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
2022	A	`conf`	Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2022	J	`jnl`	Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2022	J	`jnl`	Incompressibility of J. Comput. Syst. Sci. Dániel Marx, R. B. Sandeep
2022	J	`jnl`	List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs. CoRR Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2022	J	`jnl`	Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction. CoRR Dániel Marx
2022	J	`jnl`	Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ACM Trans. Algorithms Dániel Marx, Michal Pilipczuk
2022	B	`conf`	Parameterized Complexity of Weighted Multicut in Trees. WG Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Parameterized Complexity of Weighted Multicut in Trees. CoRR Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Parameterized algorithms for generalizations of Directed Feedback Vertex Set. Discret. Optim. Alexander Göke, Dániel Marx, Matthias Mnich
2022	J	`jnl`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	J	`jnl`	Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
2022	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). Dagstuhl Reports Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný
2022	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results. CoRR Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2021	J	`jnl`	A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
2021	J	`jnl`	Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. J. ACM Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
2021	J	`jnl`	Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). CoRR Dániel Marx, Govind S. Sankar, Philipp Schepper
2021	J	`jnl`	Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. CoRR Jacob Focke, Dániel Marx, Pawel Rzazewski
2021	A*	`conf`	Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. ICALP Dániel Marx, Govind S. Sankar, Philipp Schepper
2021	J	`jnl`	Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. CoRR Dániel Marx, Govind S. Sankar, Philipp Schepper
2021	J	`jnl`	Finding and Counting Permutations via CSPs. Algorithmica Benjamin Aram Berendsohn, László Kozma, Dániel Marx
2021	A*	`conf`	Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction. PODS Dániel Marx
2021	—	`conf`	On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting. FORC Vincent Cohen-Addad, Philip N. Klein, Dániel Marx, Archer Wheeler, Christopher Wolfram
2021	J	`jnl`	Parameterized Intractability of Even Set and Shortest Vector Problem. J. ACM Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
2021	A*	`ed.`	Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 SODA Dániel Marx
2020	J	`jnl`	A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2020	A	`conf`	Chordless Cycle Packing Is Fixed-Parameter Tractable. ESA Dániel Marx
2020	A	`conf`	Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction. CCC Marvin Künnemann, Dániel Marx
2020	J	`jnl`	Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-grained Perspective into Boolean Constraint Satisfaction. CoRR Marvin Künnemann, Dániel Marx
2020	—	`conf`	Four Shorts Stories on Surprising Algorithmic Uses of Treewidth. Treewidth, Kernels, and Algorithms Dániel Marx
2020	J	`jnl`	Four short stories on surprising algorithmic uses of treewidth. CoRR Dániel Marx
2020	A*	`conf`	Hitting Long Directed Cycles Is Fixed-Parameter Tractable. ICALP Alexander Göke, Dániel Marx, Matthias Mnich
2020	J	`jnl`	Hitting Long Directed Cycles is Fixed-Parameter Tractable. CoRR Alexander Göke, Dániel Marx, Matthias Mnich
2020	A	`conf`	Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. ESA Dániel Marx, R. B. Sandeep
2020	J	`jnl`	Incompressibility of H-free edge modification problems: Towards a dichotomy. CoRR Dániel Marx, R. B. Sandeep
2020	J	`jnl`	Multi-budgeted Directed Cuts. Algorithmica Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
2020	J	`jnl`	On the computational tractability of a geographic clustering problem arising in redistricting. CoRR Vincent Cohen-Addad, Philip N. Klein, Dániel Marx
2020	J	`jnl`	Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CoRR Alexander Göke, Dániel Marx, Matthias Mnich
2020	J	`jnl`	The Parameterized Hardness of the k-Center Problem in Transportation Networks. Algorithmica Andreas Emil Feldmann, Dániel Marx
2020	J	`jnl`	Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM J. Comput. Rajesh Hemant Chitnis, Andreas Emil Feldmann, Mohammad Taghi Hajiaghayi, Dániel Marx
2019	A*	`conf`	Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. SoCG Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
2019	J	`jnl`	Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. CoRR Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
2019	J	`jnl`	Covering a tree with rooted subtrees. CoRR Lin Chen, Dániel Marx
2019	B	`conf`	Finding and Counting Permutations via CSPs. IPEC Benjamin Aram Berendsohn, László Kozma, Dániel Marx
2019	J	`jnl`	Finding and counting permutations via CSPs. CoRR Benjamin Aram Berendsohn, László Kozma, Dániel Marx
2019	J	`jnl`	Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. Algorithmica Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2019	B	`conf`	How Does Object Fatness Impact the Complexity of Packing in d Dimensions? ISAAC Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2019	J	`jnl`	How does object fatness impact the complexity of packing in d dimensions? CoRR Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2019	J	`jnl`	Introduction to the Special Issue on SODA 2017. ACM Trans. Algorithms Dániel Marx, Virginia Vassilevska Williams, Neal E. Young
2019	J	`jnl`	New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Dagstuhl Reports Fedor V. Fomin, Dániel Marx, Saket Saurabh, Meirav Zehavi
2019	C	`conf`	Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CIAC Alexander Göke, Dániel Marx, Matthias Mnich
2019	J	`jnl`	Parameterized Intractability of Even Set and Shortest Vector Problem. CoRR Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
2019	J	`jnl`	Parameterized Intractability of Even Set and Shortest Vector Problem. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
2019	—	`conf`	Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
2019	J	`jnl`	Routing with congestion in acyclic digraphs. Inf. Process. Lett. Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
2019	J	`jnl`	Slightly Superexponential Parameterized Problems. CoRR Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2019	J	`jnl`	Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2019	J	`jnl`	Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). CoRR Rajesh Chitnis, Andreas Emil Feldmann, MohammadTaghi Hajiaghayi, Dániel Marx
2018	A*	`ed.`	45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, July 9-13, 2018 ICALP Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald Sannella
2018	A*	`conf`	A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018	A*	`conf`	Covering a tree with rooted subtrees - parameterized and approximation algorithms. SODA Lin Chen, Dániel Marx
2018	A	`conf`	Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. STACS László Egri, Dániel Marx, Pawel Rzazewski
2018	J	`jnl`	Fine-grained complexity of coloring unit disks and balls. J. Comput. Geom. Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
2018	J	`jnl`	Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018	J	`jnl`	Kernelization of Packing Problems. CoRR Holger Dell, Dániel Marx
2018	J	`jnl`	Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. ACM Trans. Algorithms Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2018	B	`conf`	Multi-Budgeted Directed Cuts. IPEC Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
2018	J	`jnl`	Multi-budgeted directed cuts. CoRR Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
2018	A*	`conf`	On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. FOCS Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2018	J	`jnl`	Slightly Superexponential Parameterized Problems. SIAM J. Comput. Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2018	J	`jnl`	Subexponential-time Algorithms for Maximum Independent Set in P CoRR Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2018	—	`conf`	The Parameterized Hardness of the k-Center Problem in Transportation Networks. SWAT Andreas Emil Feldmann, Dániel Marx
2018	J	`jnl`	The Parameterized Hardness of the k-Center Problem in Transportation Networks. CoRR Andreas Emil Feldmann, Dániel Marx
2017	J	`jnl`	Clustering with Local Restrictions. CoRR Daniel Lokshtanov, Dániel Marx
2017	J	`jnl`	Coloring Graphs with Constraints on Connectivity. J. Graph Theory Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
2017	J	`jnl`	Completely inapproximable monotone and antimonotone parameterized problems. CoRR Dániel Marx
2017	J	`jnl`	Constraint Solving via Fractional Edge Covers. CoRR Martin Grohe, Dániel Marx
2017	A*	`conf`	Fine-Grained Complexity of Coloring Unit Disks and Balls. SoCG Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
2017	B	`conf`	Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. IPEC Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2017	J	`jnl`	Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. CoRR Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2017	A	`conf`	Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk). ICDT Dániel Marx
2017	J	`jnl`	Hitting forbidden subgraphs in graphs of bounded treewidth. Inf. Comput. Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2017	J	`jnl`	Homomorphisms Are a Good Basis for Counting Small Subgraphs. CoRR Radu Curticapean, Holger Dell, Dániel Marx
2017	A*	`conf`	Homomorphisms are a good basis for counting small subgraphs. STOC Radu Curticapean, Holger Dell, Dániel Marx
2017	J	`jnl`	List H-Coloring a Graph by Removing Few Vertices. Algorithmica Rajesh Chitnis, László Egri, Dániel Marx
2017	J	`jnl`	On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs. CoRR Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2017	J	`jnl`	On the hardness of losing weight. CoRR Andrei A. Krokhin, Dániel Marx
2017	A	`conf`	Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix. STACS Lin Chen, Dániel Marx, Deshi Ye, Guochuan Zhang
2017	J	`jnl`	Rooted grid minors. J. Comb. Theory B Dániel Marx, Paul D. Seymour, Paul Wollan
2017	J	`jnl`	Size bounds and query plans for relational joins. CoRR Albert Atserias, Martin Grohe, Dániel Marx
2017	A	`conf`	Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. ESA Dániel Marx, Marcin Pilipczuk
2017	J	`jnl`	The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. CoRR Andreas Emil Feldmann, Dániel Marx
2016	A*	`conf`	A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. STOC MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2016	J	`jnl`	Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221). Dagstuhl Reports Jeff Erickson, Philip N. Klein, Dániel Marx, Claire Mathieu
2016	J	`jnl`	Chordal Editing is Fixed-Parameter Tractable. Algorithmica Yixin Cao, Dániel Marx
2016	—	`conf`	Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs. APPROX-RANDOM Dániel Marx, Ario Salmasi, Anastasios Sidiropoulos
2016	J	`jnl`	Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs. CoRR Dániel Marx, Ario Salmasi, Anastasios Sidiropoulos
2016	A*	`conf`	Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. ICALP Dániel Marx, Valia Mitsou
2016	A	`conf`	Fixed-Parameter Approximability of Boolean MinCSPs. ESA Édouard Bonnet, László Egri, Dániel Marx
2016	J	`jnl`	Fixed-parameter Approximability of Boolean MinCSPs. CoRR Édouard Bonnet, László Egri, Dániel Marx
2016	B	`conf`	H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms. IPEC Gábor Bacsó, Dániel Marx, Zsolt Tuza
2016	J	`jnl`	On Problems as Hard as CNF-SAT. ACM Trans. Algorithms Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2016	J	`jnl`	Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. ACM Trans. Comput. Theory Stefan Kratsch, Dániel Marx, Magnus Wahlström
2016	B	`conf`	Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. WG Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2016	J	`jnl`	Parameterized vertex deletion problems for hereditary graph classes with a block property. CoRR Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2016	A*	`conf`	Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems. SoCG Dániel Marx, Tillmann Miltzow
2016	J	`jnl`	Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems. CoRR Dániel Marx, Tillmann Miltzow
2016	B	`conf`	Routing with Congestion in Acyclic Digraphs. MFCS Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
2016	J	`jnl`	Routing with Congestion in Acyclic Digraphs. CoRR Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
2016	A*	`conf`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. FOCS Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	Subexponential parameterized algorithms for graphs of polynomial growth. CoRR Dániel Marx, Marcin Pilipczuk
2016	J	`jnl`	Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. CoRR Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	—	`conf`	The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk). SWAT Dániel Marx
2016	A*	`conf`	The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ICALP Andreas Emil Feldmann, Dániel Marx
2016	J	`jnl`	The limited blessing of low dimensionality: when $1-1/d$ is the best possible exponent for $d$-dimensional geometric problems. CoRR Dániel Marx, Anastasios Sidiropoulos
2016	A*	`conf`	Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. SODA Radu Curticapean, Dániel Marx
2015	A*	`conf`	An exact characterization of tractable demand patterns for maximum disjoint path problems. SODA Dániel Marx, Paul Wollan
2015	A*	`conf`	Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. SODA Bart M. P. Jansen, Dániel Marx
2015	J	`jnl`	Colouring graphs with constraints on connectivity. CoRR Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
2015	J	`jnl`	Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ACM Trans. Algorithms Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dániel Marx
2015	J	`jnl`	Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation. ACM Trans. Algorithms Dániel Marx, László A. Végh
2015	J	`jnl`	Interval Deletion Is Fixed-Parameter Tractable. ACM Trans. Algorithms Yixin Cao, Dániel Marx
2015	J	`jnl`	On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
2015	A	`conf`	Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ESA Dániel Marx, Michal Pilipczuk
2015	J	`jnl`	Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. CoRR Dániel Marx, Michal Pilipczuk
2015	—	`book`	Parameterized Algorithms Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2015	J	`jnl`	Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs. SIAM J. Comput. Martin Grohe, Dániel Marx
2015	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301). Dagstuhl Reports Andrei A. Bulatov, Venkatesan Guruswami, Andrei A. Krokhin, Dániel Marx
2014	A*	`conf`	A subexponential parameterized algorithm for Subset TSP on planar graphs. SODA Philip N. Klein, Dániel Marx
2014	J	`jnl`	An exact characterization of tractable demand patterns for maximum disjoint path problems. CoRR Dániel Marx, Paul Wollan
2014	J	`jnl`	Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. CoRR Bart M. P. Jansen, Dániel Marx
2014	A	`conf`	Chordal Editing is Fixed-Parameter Tractable. STACS Yixin Cao, Dániel Marx
2014	J	`jnl`	Chordal Editing is Fixed-Parameter Tractable. CoRR Yixin Cao, Dániel Marx
2014	A*	`conf`	Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. FOCS Radu Curticapean, Dániel Marx
2014	J	`jnl`	Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts. CoRR Radu Curticapean, Dániel Marx
2014	J	`jnl`	Constraint Satisfaction Parameterized by Solution Size. SIAM J. Comput. Andrei A. Bulatov, Dániel Marx
2014	J	`jnl`	Constraint Solving via Fractional Edge Covers. ACM Trans. Algorithms Martin Grohe, Dániel Marx
2014	A	`conf`	Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). STACS Dániel Marx, Michal Pilipczuk
2014	J	`jnl`	Exponential Time Complexity of the Permanent and the Tutte Polynomial. ACM Trans. Algorithms Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
2014	A*	`conf`	Finding small patterns in permutations in linear time. SODA Sylvain Guillemot, Dániel Marx
2014	J	`jnl`	Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset. SIAM J. Comput. Dániel Marx, Igor Razgon
2014	—	`conf`	Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth. MFCS (2) Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	Hitting forbidden subgraphs in graphs of bounded treewidth. CoRR Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	Immersions in Highly Edge Connected Graphs. SIAM J. Discret. Math. Dániel Marx, Paul Wollan
2014	A*	`conf`	Interval Deletion is Fixed-Parameter Tractable. SODA Yixin Cao, Dániel Marx
2014	J	`jnl`	Minimizing Movement: Fixed-Parameter Tractability. ACM Trans. Algorithms Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dániel Marx
2014	J	`jnl`	Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). Dagstuhl Reports Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, Peter Rossmanith
2014	J	`jnl`	Parameterized Complexity of Eulerian Deletion Problems. Algorithmica Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter
2014	J	`jnl`	Soft Constraints of Difference and Equality. CoRR Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon
2014	A*	`conf`	The limited blessing of low dimensionality: when 1-1/d is the best possible exponent for d-dimensional geometric problems. SoCG Dániel Marx, Anastasios Sidiropoulos
2014	A*	`conf`	Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SODA Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx
2013	B	`conf`	A Faster FPT Algorithm for Bipartite Contraction. IPEC Sylvain Guillemot, Dániel Marx
2013	J	`jnl`	A faster FPT algorithm for Bipartite Contraction CoRR Sylvain Guillemot, Dániel Marx
2013	J	`jnl`	A faster FPT algorithm for Bipartite Contraction. Inf. Process. Lett. Sylvain Guillemot, Dániel Marx
2013	A	`conf`	Algorithmic Graph Structure Theory (Tutorial). STACS Dániel Marx
2013	J	`jnl`	Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421). Dagstuhl Reports Glencora Borradaile, Philip N. Klein, Dániel Marx, Claire Mathieu
2013	J	`jnl`	Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
2013	—	`conf`	Block-Sorted Quantified Conjunctive Queries. ICALP (2) Hubie Chen, Dániel Marx
2013	J	`jnl`	Cleaning Interval Graphs. Algorithmica Dániel Marx, Ildikó Schlotter
2013	J	`jnl`	Clustering with local restrictions. Inf. Comput. Daniel Lokshtanov, Dániel Marx
2013	J	`jnl`	Completely inapproximable monotone and antimonotone parameterized problems. J. Comput. Syst. Sci. Dániel Marx
2013	J	`jnl`	Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). CoRR Dániel Marx, Michal Pilipczuk
2013	J	`jnl`	Finding small patterns in permutations in linear time. CoRR Sylvain Guillemot, Dániel Marx
2013	J	`jnl`	Finding small separators in linear time via treewidth reduction. ACM Trans. Algorithms Dániel Marx, Barry O'Sullivan, Igor Razgon
2013	—	`conf`	Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation. ICALP (1) Dániel Marx, László A. Végh
2013	J	`jnl`	Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset. SIAM J. Comput. Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx
2013	J	`jnl`	Fixed-parameter algorithms for minimum cost edge-connectivity augmentation CoRR Dániel Marx, László A. Végh
2013	A	`conf`	List H-Coloring a Graph by Removing Few Vertices. ESA Rajesh Hemant Chitnis, László Egri, Dániel Marx
2013	J	`jnl`	List H-Coloring a Graph by Removing Few Vertices. CoRR Rajesh Hemant Chitnis, László Egri, Dániel Marx
2013	J	`jnl`	Size Bounds and Query Plans for Relational Joins. SIAM J. Comput. Albert Atserias, Martin Grohe, Dániel Marx
2013	A*	`conf`	The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable. FOCS Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2013	—	`conf`	The Square Root Phenomenon in Planar Graphs. FAW-AAIM Dániel Marx
2013	—	`conf`	The Square Root Phenomenon in Planar Graphs. ICALP (2) Dániel Marx
2013	J	`jnl`	The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable CoRR Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2013	J	`jnl`	Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries. J. ACM Dániel Marx
2012	—	`conf`	A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals. ICALP (1) Dániel Marx
2012	J	`jnl`	Constraint satisfaction parameterized by solution size CoRR Andrei A. Bulatov, Dániel Marx
2012	J	`jnl`	Data Reduction and Problem Kernels (Dagstuhl Seminar 12241). Dagstuhl Reports Michael R. Fellows, Jiong Guo, Dániel Marx, Saket Saurabh
2012	—	`conf`	Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dániel Marx
2012	J	`jnl`	Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable CoRR Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Dániel Marx
2012	J	`jnl`	Enumerating homomorphisms. J. Comput. Syst. Sci. Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2012	J	`jnl`	Exponential Time Complexity of the Permanent and the Tutte Polynomial CoRR Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
2012	—	`conf`	FPT Suspects and Tough Customers: Open Problems of Downey and Fellows. The Multivariate Algorithmic Revolution and Beyond Fedor V. Fomin, Dániel Marx
2012	A*	`conf`	Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SODA Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx
2012	J	`jnl`	Interval Deletion is Fixed-Parameter Tractable CoRR Yixin Cao, Dániel Marx
2012	A*	`conf`	Kernelization of packing problems. SODA Holger Dell, Dániel Marx
2012	J	`jnl`	Minimizing Movement: Fixed-Parameter Tractability CoRR Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2012	J	`jnl`	Obtaining a Planar Graph by Vertex Deletion. Algorithmica Dániel Marx, Ildikó Schlotter
2012	A	`conf`	On Problems as Hard as CNF-SAT. CCC Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2012	B	`conf`	On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. WG Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
2012	J	`jnl`	On the hardness of losing weight. ACM Trans. Algorithms Andrei A. Krokhin, Dániel Marx
2012	B	`ed.`	Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers IPEC Dániel Marx, Peter Rossmanith
2012	B	`conf`	Randomized Techniques for Parameterized Algorithms. IPEC Dániel Marx
2012	—	`conf`	Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time. ICALP (1) Philip N. Klein, Dániel Marx
2012	A*	`conf`	Structure theorem and isomorphism test for graphs with excluded topological subgraphs. STOC Martin Grohe, Dániel Marx
2012	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451). Dagstuhl Reports Johan Håstad, Andrei A. Krokhin, Dániel Marx
2012	—	`ed.`	The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday The Multivariate Algorithmic Revolution and Beyond Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx
2012	J	`jnl`	The Tractability of CSP Classes Defined by Forbidden Patterns. J. Artif. Intell. Res. David A. Cohen, Martin C. Cooper, Páidí Creed, Dániel Marx, András Z. Salamon
2012	—	`conf`	What's Next? Future Directions in Parameterized Complexity. The Multivariate Algorithmic Revolution and Beyond Dániel Marx
2011	J	`jnl`	Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. J. ACM MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Dániel Marx
2011	—	`conf`	Clustering with Local Restrictions. ICALP (1) Daniel Lokshtanov, Dániel Marx
2011	J	`jnl`	Complexity of clique coloring and related problems. Theor. Comput. Sci. Dániel Marx
2011	—	`conf`	Constraint Satisfaction Parameterized by Solution Size. ICALP (1) Andrei A. Bulatov, Dániel Marx
2011	J	`jnl`	Finding small separators in linear time via treewidth reduction CoRR Dániel Marx, Barry O'Sullivan, Igor Razgon
2011	A*	`conf`	Finding topological subgraphs is fixed-parameter tractable. STOC Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan
2011	J	`jnl`	Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset CoRR Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx
2011	A*	`conf`	Fixed-parameter tractability of multicut parameterized by the size of the cutset. STOC Dániel Marx, Igor Razgon
2011	J	`jnl`	Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote
2011	B	`conf`	Important Separators and Parameterized Algorithms. WG Dániel Marx
2011	A*	`conf`	Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. SODA Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2011	J	`jnl`	Lower bounds based on the Exponential Time Hypothesis. Bull. EATCS Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2011	A	`conf`	On Guaranteeing Polynomially Bounded Search Tree Size. CP David A. Cohen, Martin C. Cooper, Martin James Green, Dániel Marx
2011	J	`jnl`	On Problems as Hard as CNFSAT CoRR Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2011	J	`jnl`	Packing cycles through prescribed vertices. J. Comb. Theory B Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx
2011	B	`conf`	Parameterized Complexity of Eulerian Deletion Problems. WG Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter
2011	A*	`conf`	Prize-collecting Steiner Problems on Planar Graphs. SODA MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx
2011	A*	`conf`	Slightly Superexponential Parameterized Problems. SODA Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2011	J	`jnl`	Soft Constraints of Difference and Equality. J. Artif. Intell. Res. Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon
2011	J	`jnl`	Sparse Balanced Partitions and the Complexity of Subgraph Problems. SIAM J. Discret. Math. Noga Alon, Dániel Marx
2011	J	`jnl`	Stable assignment with couples: Parameterized complexity and local search. Discret. Optim. Dániel Marx, Ildikó Schlotter
2011	J	`jnl`	Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs CoRR Martin Grohe, Dániel Marx
2011	J	`jnl`	Tractable Structures for Constraint Satisfaction with Truth Tables. Theory Comput. Syst. Dániel Marx
2010	J	`jnl`	Approximating fractional hypertree width. ACM Trans. Algorithms Dániel Marx
2010	A*	`conf`	Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. STOC MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx
2010	—	`conf`	Bin Packing with Fixed Number of Bins Revisited. SWAT Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
2010	J	`jnl`	Can You Beat Treewidth? Theory Comput. Dániel Marx
2010	J	`jnl`	Chordal Deletion is Fixed-Parameter Tractable. Algorithmica Dániel Marx
2010	J	`jnl`	Cleaning Interval Graphs CoRR Dániel Marx, Ildikó Schlotter
2010	A	`conf`	Completely Inapproximable Monotone and Antimonotone Parameterized Problems. CCC Dániel Marx
2010	J	`jnl`	Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geom. Appl. Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx
2010	J	`jnl`	Constraint satisfaction problems and global cardinality constraints. Commun. ACM Andrei A. Bulatov, Dániel Marx
2010	J	`jnl`	Finding topological subgraphs is fixed-parameter tractable CoRR Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan
2010	J	`jnl`	Fixed-parameter tractability of multicut parameterized by the size of the cutset CoRR Dániel Marx, Igor Razgon
2010	J	`jnl`	Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal CoRR Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2010	B	`conf`	Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. MFCS Stefan Kratsch, Dániel Marx, Magnus Wahlström
2010	J	`jnl`	Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties. Algorithmica Dániel Marx, Ildikó Schlotter
2010	B	`conf`	Parameterized Complexity of the Arc-Preserving Subsequence Problem. WG Dániel Marx, Ildikó Schlotter
2010	J	`jnl`	Prize-collecting Network Design on Planar Graphs CoRR MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx
2010	J	`jnl`	The complexity of global cardinality constraints Log. Methods Comput. Sci. Andrei A. Bulatov, Dániel Marx
2010	A*	`conf`	Tractable hypergraph properties for constraint satisfaction and conjunctive queries. STOC Dániel Marx
2010	A	`conf`	Treewidth Reduction for Constrained Separation and Bipartization Problems. STACS Dániel Marx, Barry O'Sullivan, Igor Razgon
2009	—	`conf`	09511 Abstracts Collection - Parameterized complexity and approximation algorithms. Parameterized complexity and approximation algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	—	`conf`	09511 Executive Summary - Parameterized complexity and approximation algorithms. Parameterized complexity and approximation algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	—	`conf`	09511 Open Problems - Parameterized complexity and approximation algorithms. Parameterized complexity and approximation algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	J	`jnl`	A parameterized view on matroid optimization problems. Theor. Comput. Sci. Dániel Marx
2009	A*	`conf`	Approximating fractional hypertree width. SODA Dániel Marx
2009	J	`jnl`	Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth CoRR MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx
2009	J	`jnl`	Complexity results for minimum sum edge coloring. Discret. Appl. Math. Dániel Marx
2009	A	`conf`	Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. ESA Dániel Marx, Igor Razgon
2009	J	`jnl`	Constant ratio fixed-parameter approximation of the edge multicut problem. Inf. Process. Lett. Dániel Marx, Igor Razgon
2009	A	`conf`	Constraints of Difference and Equality: A Complete Taxonomic Characterisation. CP Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon
2009	J	`jnl`	Enumerating Homomorphisms CoRR Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2009	A	`conf`	Enumerating Homomorphisms. STACS Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2009	A	`conf`	Minimizing Movement: Fixed-Parameter Tractability. ESA Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	J	`jnl`	On tree width, bramble size, and expansion. J. Comb. Theory B Martin Grohe, Dániel Marx
2009	—	`ed.`	Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009 Parameterized complexity and approximation algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	J	`jnl`	Parameterized graph cleaning problems. Discret. Appl. Math. Dániel Marx, Ildikó Schlotter
2009	—	`conf`	Stable Assignment with Couples: Parameterized Complexity and Local Search. IWPEC Dániel Marx, Ildikó Schlotter
2009	A*	`conf`	The Complexity of Global Cardinality Constraints. LICS Andrei A. Bulatov, Dániel Marx
2009	J	`jnl`	The complexity of nonrepetitive coloring. Discret. Appl. Math. Dániel Marx, Marcus Schaefer
2009	A	`conf`	Tractable Structures for Constraint Satisfaction with Truth Tables. STACS Dániel Marx
2009	J	`jnl`	Tractable hypergraph properties for constraint satisfaction and conjunctive queries CoRR Dániel Marx
2009	J	`jnl`	Treewidth reduction for constrained separation and bipartization problems CoRR Dániel Marx, Barry O'Sullivan, Igor Razgon
2008	J	`jnl`	Closest Substring Problems with Small Distances. SIAM J. Comput. Dániel Marx
2008	J	`jnl`	Complexity of unique list colorability. Theor. Comput. Sci. Dániel Marx
2008	J	`jnl`	Obtaining a Planar Graph by Vertex Deletion CoRR Dániel Marx, Ildikó Schlotter
2008	—	`conf`	On the Hardness of Losing Weight. ICALP (1) Andrei A. Krokhin, Dániel Marx
2008	J	`jnl`	Parameterized Complexity and Approximation Algorithms. Comput. J. Dániel Marx
2008	B	`conf`	Parameterized Graph Cleaning Problems. WG Dániel Marx, Ildikó Schlotter
2008	J	`jnl`	Searching the k-change neighborhood for TSP is W[1]-hard. Oper. Res. Lett. Dániel Marx
2008	A*	`conf`	Size Bounds and Query Plans for Relational Joins. FOCS Albert Atserias, Martin Grohe, Dániel Marx
2007	—	`conf`	07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege
2007	—	`conf`	07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege
2007	A*	`conf`	Can you beat treewidth? FOCS Dániel Marx
2007	B	`conf`	Obtaining a Planar Graph by Vertex Deletion. WG Dániel Marx, Ildikó Schlotter
2007	A*	`conf`	On the Optimality of Planar and Geometric Approximation Schemes. FOCS Dániel Marx
2007	—	`ed.`	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege
2006	—	`conf`	A Parameterized View on Matroid Optimization Problems. ACiD Dániel Marx
2006	—	`conf`	A Parameterized View on Matroid Optimization Problems. ICALP (1) Dániel Marx
2006	B	`conf`	Chordal Deletion Is Fixed-Parameter Tractable. WG Dániel Marx
2006	A*	`conf`	Constraint solving via fractional edge covers. SODA Martin Grohe, Dániel Marx
2006	J	`jnl`	Minimum sum multicoloring on the edges of trees. Theor. Comput. Sci. Dániel Marx
2006	—	`conf`	Parameterized Complexity of Independence and Domination on Geometric Graphs. IWPEC Dániel Marx
2006	J	`jnl`	Parameterized coloring problems on chordal graphs. Theor. Comput. Sci. Dániel Marx
2006	J	`jnl`	Parameterized graph separation problems. Theor. Comput. Sci. Dániel Marx
2006	J	`jnl`	Precoloring extension on unit interval graphs. Discret. Appl. Math. Dániel Marx
2006	J	`jnl`	The complexity of chromatic strength and chromatic edge strength. Comput. Complex. Dániel Marx
2005	J	`jnl`	A short proof of the NP-completeness of minimum sum interval coloring. Oper. Res. Lett. Dániel Marx
2005	A	`conf`	Efficient Approximation Schemes for Geometric Problems?. ESA Dániel Marx
2005	J	`jnl`	NP-completeness of list coloring and precoloring extension on the edges of planar graphs. J. Graph Theory Dániel Marx
2005	J	`jnl`	Parameterized complexity of constraint satisfaction problems. Comput. Complex. Dániel Marx
2005	A*	`conf`	The Closest Substring problem with small distances. FOCS Dániel Marx
2004	J	`jnl`	Eulerian disjoint paths problem in grid graphs is NP-complete. Discret. Appl. Math. Dániel Marx
2004	J	`jnl`	List edge multicoloring in graphs with few cycles. Inf. Process. Lett. Dániel Marx
2004	B	`conf`	Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees. WAOA Dániel Marx
2004	—	`conf`	Parameterized Coloring Problems on Chordal Graphs. IWPEC Dániel Marx
2004	A	`conf`	Parameterized Complexity of Constraint Satisfaction Problems. CCC Dániel Marx
2004	—	`conf`	Parameterized Graph Separation Problems. IWPEC Dániel Marx
2003	B	`conf`	Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract). WAOA Dániel Marx
2002	B	`conf`	The Complexity of Tree Multicolorings. MFCS Dániel Marx
2000	A*	`conf`	Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks. INFOCOM Tibor Cinkler, Dániel Marx, Claus Popp Larsen, Dániel Fogaras