Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDániel Marx
Person information
- affiliation: CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
- affiliation: Hungarian Academy of Sciences, Institute for Computer Science and Control
- affiliation: Humboldt University Berlin, Department of Computer Science
- affiliation: Tel Aviv University, Blavatnik School of Computer Science
- affiliation: Budapest University of Technology and Economics, Department of Computer Science and Information Theory
- not to be confused with: Daniel Marx 0001
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c123]Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek:
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. SODA 2023: 2087-2110- [c122]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: 3664-3683 - [i101]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 abs/2304.03146 (2023) - [i100]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 abs/2305.07316 (2023) - [i99]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 abs/2306.03640 (2023) - [i98]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR abs/2306.15331 (2023) - [i97]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Approximate Monotone Local Search for Weighted Problems. CoRR abs/2308.15306 (2023) - 2022
- [j87]Alexander Göke, Dániel Marx, Matthias Mnich
:
Parameterized algorithms for generalizations of Directed Feedback Vertex Set. Discret. Optim. 46: 100740 (2022) - [j86]Dániel Marx, R. B. Sandeep:
Incompressibility of H-free edge modification problems: Towards a dichotomy. J. Comput. Syst. Sci. 125: 25-58 (2022) - [j85]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): 254-289 (2022) - [j84]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): 1866-1930 (2022) - [j83]Dániel Marx, Michal Pilipczuk:
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ACM Trans. Algorithms 18(2): 13:1-13:64 (2022) - [c121]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: 20:1-20:17 - [c120]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA 2022: 50:1-50:19 - [c119]Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. IPEC 2022: 12:1-12:22 - [c118]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC 2022: 14:1-14:24 - [c117]Dániel Marx, Govind S. Sankar, Philipp Schepper:
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). IPEC 2022: 22:1-22:23 - [c116]Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. SODA 2022: 431-458 - [c115]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: 2085-2127 - [c114]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Weighted Multicut in Trees. WG 2022: 257-270 - [i96]Dániel Marx:
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction. CoRR abs/2203.07717 (2022) - [i95]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 abs/2203.07898 (2022) - [i94]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Weighted Multicut in Trees. CoRR abs/2205.10105 (2022) - [i93]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR abs/2206.13481 (2022) - [i92]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR abs/2208.02850 (2022) - [i91]Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma:
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR abs/2208.06015 (2022) - [i90]Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. CoRR abs/2209.01623 (2022) - [i89]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 abs/2210.10677 (2022) - [i88]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 abs/2211.04278 (2022) - [i87]Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek:
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. CoRR abs/2211.04458 (2022) - [i86]Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný:
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). Dagstuhl Reports 12(5): 112-130 (2022) - 2021
- [j82]Benjamin Aram Berendsohn, László Kozma, Dániel Marx:
Finding and Counting Permutations via CSPs. Algorithmica 83(8): 2552-2577 (2021) - [j81]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): 16:1-16:40 (2021) - [j80]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): 30:1-30:26 (2021) - [c113]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: 3:1-3:18 - [c112]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: 95:1-95:20 - [c111]Dániel Marx:
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction. PODS 2021: 19-29 - [e6]Dániel Marx:
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. SIAM 2021, ISBN 978-1-61197-646-5 [contents] - [i85]Dániel Marx, Govind S. Sankar, Philipp Schepper:
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. CoRR abs/2105.08980 (2021) - [i84]Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. CoRR abs/2107.06889 (2021) - [i83]Dániel Marx, Govind S. Sankar, Philipp Schepper:
Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). CoRR abs/2110.09369 (2021) - [i82]Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale:
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR abs/2110.15098 (2021) - 2020
- [j79]Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. Algorithmica 82(7): 1989-2005 (2020) - [j78]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-budgeted Directed Cuts. Algorithmica 82(8): 2135-2155 (2020) - [j77]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): 318-364 (2020) - [j76]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): 1291-1331 (2020) - [c110]Dániel Marx:
Four Shorts Stories on Surprising Algorithmic Uses of Treewidth. Treewidth, Kernels, and Algorithms 2020: 129-144 - [c109]Marvin Künnemann, Dániel Marx:
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction. CCC 2020: 27:1-27:28 - [c108]Dániel Marx:
Chordless Cycle Packing Is Fixed-Parameter Tractable. ESA 2020: 71:1-71:19 - [c107]Dániel Marx, R. B. Sandeep:
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. ESA 2020: 72:1-72:25 - [c106]Alexander Göke, Dániel Marx, Matthias Mnich:
Hitting Long Directed Cycles Is Fixed-Parameter Tractable. ICALP 2020: 59:1-59:18 - [i81]Alexander Göke, Dániel Marx, Matthias Mnich:
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CoRR abs/2003.02483 (2020) - [i80]Alexander Göke, Dániel Marx, Matthias Mnich:
Hitting Long Directed Cycles is Fixed-Parameter Tractable. CoRR abs/2003.05267 (2020) - [i79]Dániel Marx, R. B. Sandeep:
Incompressibility of H-free edge modification problems: Towards a dichotomy. CoRR abs/2004.11761 (2020) - [i78]Marvin Künnemann, Dániel Marx:
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-grained Perspective into Boolean Constraint Satisfaction. CoRR abs/2005.11541 (2020) - [i77]Dániel Marx:
Four short stories on surprising algorithmic uses of treewidth. CoRR abs/2008.07968 (2020) - [i76]Vincent Cohen-Addad, Philip N. Klein, Dániel Marx:
On the computational tractability of a geographic clustering problem arising in redistricting. CoRR abs/2009.00188 (2020)
2010 – 2019
- 2019
- [j75]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): 421-438 (2019) - [j74]É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): 3890-3935 (2019) - [j73]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with congestion in acyclic digraphs. Inf. Process. Lett. 151 (2019) - [j72]Dániel Marx, Virginia Vassilevska Williams, Neal E. Young:
Introduction to the Special Issue on SODA 2017. ACM Trans. Algorithms 15(2): 17:1-17:2 (2019) - [c105]Alexander Göke, Dániel Marx, Matthias Mnich:
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CIAC 2019: 249-261 - [c104]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: 27:1-27:16 - [c103]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: 8:1-8:20 - [c102]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: 36:1-36:18 - [c101]Benjamin Aram Berendsohn, László Kozma, Dániel Marx:
Finding and Counting Permutations via CSPs. IPEC 2019: 1:1-1:16 - [i75]Lin Chen, Dániel Marx:
Covering a tree with rooted subtrees. CoRR abs/1902.08218 (2019) - [i74]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Slightly Superexponential Parameterized Problems. CoRR abs/1902.08723 (2019) - [i73]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 abs/1903.08603 (2019) - [i72]Benjamin Aram Berendsohn, László Kozma, Dániel Marx:
Finding and counting permutations via CSPs. CoRR abs/1908.04673 (2019) - [i71]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 abs/1909.01986 (2019) - [i70]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 abs/1909.12044 (2019) - [i69]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 abs/1911.13161 (2019) - [i68]Fedor V. Fomin, Dániel Marx, Saket Saurabh, Meirav Zehavi:
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Dagstuhl Reports 9(1): 67-87 (2019) - [i67]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. TR19 (2019) - 2018
- [j71]Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-grained complexity of coloring unit disks and balls. J. Comput. Geom. 9(2): 47-80 (2018) - [j70]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Slightly Superexponential Parameterized Problems. SIAM J. Comput. 47(3): 675-702 (2018) - [j69]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. ACM Trans. Algorithms 14(2): 13:1-13:30 (2018) - [c100]Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. FOCS 2018: 474-484 - [c99]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-Budgeted Directed Cuts. IPEC 2018: 18:1-18:14 - [c98]Lin Chen, Dániel Marx:
Covering a tree with rooted subtrees - parameterized and approximation algorithms. SODA 2018: 2801-2820 - [c97]László Egri, Dániel Marx, Pawel Rzazewski:
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. STACS 2018: 27:1-27:15 - [c96]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: 574-586 - [c95]Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. SWAT 2018: 19:1-19:13 - [e5]Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald Sannella:
45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. LIPIcs 107, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-076-7 [contents] - [i66]Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. CoRR abs/1802.08563 (2018) - [i65]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR abs/1803.10633 (2018) - [i64]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. CoRR abs/1804.04077 (2018) - [i63]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-budgeted directed cuts. CoRR abs/1810.06848 (2018) - [i62]Holger Dell, Dániel Marx:
Kernelization of Packing Problems. CoRR abs/1812.03155 (2018) - 2017
- [j68]Rajesh Chitnis, László Egri, Dániel Marx:
List H-Coloring a Graph by Removing Few Vertices. Algorithmica 78(1): 110-146 (2017) - [j67]Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
Hitting forbidden subgraphs in graphs of bounded treewidth. Inf. Comput. 256: 62-82 (2017) - [j66]Dániel Marx, Paul D. Seymour, Paul Wollan:
Rooted grid minors. J. Comb. Theory, Ser. B 122: 428-437 (2017) - [j65]Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
Coloring Graphs with Constraints on Connectivity. J. Graph Theory 85(4): 814-838 (2017) - [c94]Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-Grained Complexity of Coloring Unit Disks and Balls. SoCG 2017: 18:1-18:16 - [c93]Dániel Marx, Marcin Pilipczuk:
Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. ESA 2017: 59:1-59:15 - [c92]Dániel Marx:
Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk). ICDT 2017: 2:1-2:1 - [c91]É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. IPEC 2017: 7:1-7:13 - [c90]Lin Chen, Dániel Marx, Deshi Ye, Guochuan Zhang:
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix. STACS 2017: 22:1-22:14 - [c89]Radu Curticapean, Holger Dell, Dániel Marx:
Homomorphisms are a good basis for counting small subgraphs. STOC 2017: 210-223 - [i61]É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. CoRR abs/1704.06757 (2017) - [i60]Radu Curticapean, Holger Dell, Dániel Marx:
Homomorphisms Are a Good Basis for Counting Small Subgraphs. CoRR abs/1705.01595 (2017) - [i59]Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs. CoRR abs/1707.02190 (2017) - [i58]Andreas Emil Feldmann, Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. CoRR abs/1707.06808 (2017) - [i57]Albert Atserias, Martin Grohe, Dániel Marx:
Size bounds and query plans for relational joins. CoRR abs/1711.03860 (2017) - [i56]Daniel Lokshtanov, Dániel Marx:
Clustering with Local Restrictions. CoRR abs/1711.03885 (2017) - [i55]Dániel Marx:
Completely inapproximable monotone and antimonotone parameterized problems. CoRR abs/1711.03886 (2017) - [i54]Andrei A. Krokhin, Dániel Marx:
On the hardness of losing weight. CoRR abs/1711.03894 (2017) - [i53]Martin Grohe, Dániel Marx:
Constraint Solving via Fractional Edge Covers. CoRR abs/1711.04506 (2017) - 2016
- [j64]Yixin Cao, Dániel Marx:
Chordal Editing is Fixed-Parameter Tractable. Algorithmica 75(1): 118-137 (2016) - [j63]Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström:
On Problems as Hard as CNF-SAT. ACM Trans. Algorithms 12(3): 41:1-41:24 (2016) - [j62]Stefan Kratsch, Dániel Marx, Magnus Wahlström:
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. ACM Trans. Comput. Theory 8(1): 1:1-1:28 (2016) - [c88]Dániel Marx, Ario Salmasi, Anastasios Sidiropoulos:
Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs. APPROX-RANDOM 2016: 16:1-16:54 - [c87]Dániel Marx, Tillmann Miltzow:
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems. SoCG 2016: 52:1-52:16 - [c86]Édouard Bonnet, László Egri, Dániel Marx:
Fixed-Parameter Approximability of Boolean MinCSPs. ESA 2016: 18:1-18:18 - [c85]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. FOCS 2016: 515-524 - [c84]Andreas Emil Feldmann, Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ICALP 2016: 27:1-27:14 - [c83]Dániel Marx, Valia Mitsou:
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. ICALP 2016: 28:1-28:15 - [c82]Gábor Bacsó, Dániel Marx, Zsolt Tuza:
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms. IPEC 2016: 3:1-3:12 - [c81]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with Congestion in Acyclic Digraphs. MFCS 2016: 7:1-7:11 - [c80]Radu Curticapean, Dániel Marx:
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. SODA 2016: 1650-1669 - [c79]MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. STOC 2016: 570-583 - [c78]Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk). SWAT 2016: 32:1-32:1 - [c77]