Systematic mapping of the complexity landscape of hard algorithmic graph problems

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds

Author(s): Jacob Focke, Dániel Marx, Pawel Rzazewski
Published in: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Page(s) 431--458, ISBN 978-1-61197-707-3
Publisher: SIAM
DOI: 10.1137/1.9781611977073.22

On the Parameterized Complexity of Grid Contraction

Author(s): Saket Saurabh; Uéverton dos Santos Souza; Prafullkumar Tale
Published in: 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), 2020, Page(s) 34:1-34:17, ISBN 978-3-95977-150-4
Publisher: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.swat.2020.34

enDynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves

Author(s): Bringmann, Karl; Kisfaludi‑Bak, Sándor; Künnemann, Marvin; Marx, Dániel; Nusser, André
Published in: 38th International Symposium on Computational Geometry (SoCG 2022), 2022, Page(s) 20:1-20:17
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2022.20

Fine-Grained Complexity of Regular Expression Pattern Matching and Membership

Author(s): Schepper, Philipp
Published in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Page(s) 80:1--80:20, ISBN 978-3-95977-162-7
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2020.80

Counting small induced subgraphs with hereditary properties

Author(s): Focke, Jacob; Roth, Marc
Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2022), 2022, Page(s) 1543-1551, ISBN 978-1-4503-9264-8
Publisher: Association for Computing Machinery
DOI: 10.1145/3519935.3520008

Sample Compression Schemes for Balls in Graphs

Author(s): Chalopin, Jérémie; Chepoi, Victor; Mc Inerney, Fionn; Ratel, Sébastien; Vaxès, Yann
Published in: MFCS 2022, Issue 2022, 2022, Page(s) 31:1-31:14, ISBN 978-3-95977-256-3
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.mfcs.2022.31

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs

Author(s): Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Published in: ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), 2023, Page(s) 2087-2110, ISBN 978-1-61197-755-4
Publisher: SIAM
DOI: 10.1137/1.9781611977554.ch140

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search

Author(s): Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Published in: 30th Annual European Symposium on Algorithms (ESA 2022), 2022, Page(s) 50:1-50:19, ISBN 978-3-95977-247-1
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2022.50

Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)

Author(s): Dániel Marx, Govind S. Sankar, Philipp Schepper
Published in: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022, Page(s) 22:1--22:23, ISBN 978-3-95977-260-0
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2022.22

Domination and cut problems on chordal graphs with bounded leafage

Author(s): Galby, Esther; Marx, Dániel; Schepper, Philipp; Sharma, Roohani; Tale, Prafullkumar
Published in: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)ics, 2022, Page(s) 14:1-14:24, ISBN 978-3-95977-260-0
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.ipec.2022.14

Hitting Long Directed Cycles Is Fixed-Parameter Tractable

Author(s): Alexander Göke, Dániel Marx, Matthias Mnich
Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020, Page(s) 59:1--59:18, ISBN 978-3-95977-138-2
Publisher: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.59

The Complexity of Contracting Bipartite Graphs into Small Cycles

Author(s): Krithika, R.; Sharma, R.; Tale, P.
Published in: Graph-Theoretic Concepts in Computer Science - 48th International Workshop (WG 2022), 2022, Page(s) 356-369, ISBN 978-3-031-15913-8
Publisher: Springer
DOI: 10.1007/978-3-031-15914-5_26

Computing Square Colorings on Bounded-Treewidth and Planar Graphs

Author(s): Agrawal, Akanksha; Marx, Dániel; Neuen, Daniel; Slusallek, Jasper
Published in: ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), 2023, Page(s) 2087-2110, ISBN 978-1-61197-755-4
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch80

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations

Author(s): Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Published in: Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024), 2024, Page(s) 314-345, ISBN 978-1-61197-791-2
Publisher: SIAM
DOI: 10.1137/1.9781611977912.13

Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth

Author(s): Dániel Marx, Govind S. Sankar, Philipp Schepper
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021, Page(s) 95:1--95:20, ISBN 978-3-95977-195-5
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2021.95

On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting

Author(s): Vincent Cohen-Addad, Philip N. Klein, Dániel Marx, Archer Wheeler, Christopher Wolfram
Published in: 2nd Symposium on Foundations of Responsible Computing (FORC 2021), 2021, Page(s) 3:1-3:18, ISBN 978-3-95977-187-0
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.forc.2021.3

On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs

Author(s): Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk
Published in: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, Page(s) 474-484, ISBN 978-1-5386-4230-6
Publisher: IEEE
DOI: 10.1109/focs.2018.00052

The Parameterized Hardness of the k-Center Problem in Transportation Networks

Author(s): Feldmann, Andreas Emil ; Marx, Dániel
Published in: 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018, Page(s) 19:1-19:13, ISBN 978-3-95977-068-2
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.swat.2018.19

Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms

Author(s): Bonnet, Édouard ; Brettell, Nick ; Kwon, O-joung ; Marx, Dániel
Published in: 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2017, Page(s) 7:1-7:13, ISBN 978-3-95977-051-4
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2017.7

Exploring the Kernelization Borders for Hitting Cycles

Author(s): Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh
Published in: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), 2019, Page(s) 14:1--14:14, ISBN 978-3-95977-084-2
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2018.14

Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization

Author(s): Egri, László ; Marx, Dániel ; Rzazewski, Pawel
Published in: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018, Page(s) 27:1-27:15, ISBN 978-3-95977-062-0
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2018.27

Multi-Budgeted Directed Cuts

Author(s): Kratsch, Stefan ; Li, Shaohua ; Marx, Dániel ; Pilipczuk, Marcin ; Wahlström, Magnus
Published in: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), 2018, Page(s) 18:1-18:14, ISBN 978-3-95977-084-2
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2018.18

Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems

Author(s): Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018), 2018, Page(s) 1:1--1:15, ISBN 978-3-95977-085-9
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.approx-random.2018.1

A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs

Author(s): Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018, 2018, Page(s) 574-586, ISBN 9781450355599
Publisher: ACM Press
DOI: 10.1145/3188745.3188854

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

Author(s): Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh
Published in: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), 2018, Page(s) 53:1--53:15, ISBN 978-3-95977-086-6
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2018.53

Parameterized Streaming Algorithms for Min-Ones d-SAT

Author(s): Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
Published in: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), Issue 2019, 2019, Page(s) 8:1--8:20, ISBN 978-3-95977-131-3
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.fsttcs.2019.8

Connecting the Dots (with Minimum Crossings

Author(s): Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
Published in: 35th International Symposium on Computational Geometry (SoCG 2019), Issue 2019, 2019, Page(s) 7:1--7:17, ISBN 978-3-95977-104-7
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.socg.2019.7

Path Contraction Faster Than 2^n

Author(s): Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
Published in: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Issue 2019, 2019, Page(s) 11:1--11:13, ISBN 978-3-95977-109-2
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2019.11

A Polynomial Kernel for Diamond-Free Editing

Author(s): Cao, Yixin; Rai, Ashutosh; Sandeep, R. B.; Ye, Junjie
Published in: 26th Annual European Symposium on Algorithms (ESA 2018), Issue 2019, 2019, Page(s) 10:1--10:13, ISBN 978-3-95977-081-1
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2018.10

Finding and Counting Permutations via CSPs

Author(s): Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Published in: 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Issue 2019, 2019, Page(s) 1:1--1:16, ISBN 978-3-95977-129-0
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2019.1

How Does Object Fatness Impact the Complexity of Packing in d Dimensions?

Author(s): Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
Published in: 30th International Symposium on Algorithms and Computation (ISAAC 2019), Issue 2019, 2019, Page(s) 36:1--36:18, ISBN 978-3-95977-130-6
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2019.36

Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction.

Author(s): Marvin Künnemann, Dániel Marx
Published in: Proceedings of the Computational Complexity Conference 2020, 2020, Page(s) 27:1-27:28, ISBN 978-3-95977-156-6
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020
DOI: 10.4230/lipics.ccc.2020.27

Chordless Cycle Packing Is Fixed-Parameter Tractable

Author(s): Dániel Marx
Published in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Page(s) 71:1--71:19, ISBN 978-3-95977-162-7
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2020.71

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets

Author(s): Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Published in: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), 2023, Page(s) 49:1-49:16, ISBN 978-3-95977-278-5
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2023.49

Isomorphism Testing Parameterized by Genus and Beyond

Author(s): Neuen, Daniel
Published in: 29th Annual European Symposium on Algorithms (ESA 2021), 2021, Page(s) 72:1--72:18, ISBN 978-3-95977-204-4
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2021.72

Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy

Author(s): Marx, Dániel; Sandeep, R. B.
Published in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Page(s) 72:1--72:25, ISBN 978-3-95977-162-7
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2020.72

Parameterized Complexity of Weighted Multicut in Trees

Author(s): Galby, E.; Marx, D.; Schepper, P.; Sharma, R.; Tale, P.
Published in: Graph-Theoretic Concepts in Computer Science (WG 2022), 2022, Page(s) 257-270, ISBN 978-3-031-15913-8
Publisher: Springer
DOI: 10.1007/978-3-031-15914-5_19

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs

Author(s): Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
Published in: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Page(s) 2085-2127, ISBN 978-1-61197-707-3
Publisher: SIAM
DOI: 10.1137/1.9781611977073.83

Approximately counting answers to conjunctive queries with disequalities and negations

Author(s): Focke, J; Goldberg, L; Roth, M; Zivny, S
Published in: PODC 2022, Issue 2022, 2022, Page(s) 315-324, ISBN 978-1-4503-9260-0
Publisher: Association for Computing Machinery
DOI: 10.1145/3517804.3526231

Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction

Author(s): Dániel Marx
Published in: PODS'21: Proceedings of the 40th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems, 2021, Page(s) 19-29, ISBN 9781450383813
Publisher: ACM
DOI: 10.1145/3452021.3458814

Parameterized Approximation Schemes for Clustering with General Norm Objectives

Author(s): Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Published in: 64th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2023), 2023, Page(s) 1377-1399, ISBN 979-8-3503-1894-4
Publisher: IEEE
DOI: 10.1109/focs57990.2023.00085

enComputing Generalized Convolutions Faster Than Brute Force

Author(s): Esmer, Barış Can; Kulik, Ariel; Marx, Dániel; Schepper, Philipp; Węgrzycki, Karol
Published in: 38th International Symposium on Computational Geometry (SoCG 2022), 2022, Page(s) 20:1-20:17, ISBN 978-3-95977-227-3
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.ipec.2022.12

Using edge contractions to reduce the semitotal domination number

Author(s): Esther Galby; Paloma T. Lima; Felix Mann; Bernard Ries
Published in: Theoretical Computer Science, Issue 939, 2023, Page(s) 140-160, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2022.10.020

Incompressibility of H-free edge modification problems: Towards a dichotomy

Author(s): Marx Dániel; Sandeep, R. B.
Published in: J. Comput. Syst. Sci., Issue 125, 2022, Page(s) 25-58, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2021.11.001

On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem

Author(s): Saurabh, Saket; Tale, Prafullkumar
Published in: Algorithmica, Issue 84(2), 2022, Page(s) 405-435, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-021-00897-6

Sparsification Lower Bound for Linear Spanners in Directed Graphs

Author(s): Prafullkumar Tale
Published in: Theor. Comput. Sci., Issue 898, 2022, Page(s) 69--74, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2021.10.022

A subexponential parameterized algorithm for Directed Subset Traveling Salesman Problem on planar graphs

Author(s): Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk
Published in: SIAM Journal on Computing, Issue 51(2), 2022, Page(s) 254-289, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1304088

The Maker-Breaker Largest Connected Subgraph game

Author(s): Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid
Published in: Theoretical Computer Science, Issue 943, 2022, Page(s) 102-120, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2022.12.014

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

Author(s): Spoorthy Gunda; Pallavi Jain; Daniel Lokshtanov; Saket Saurabh; Prafullkumar Tale
Published in: ACM Trans. Comput. Theory, Issue 13(4), 2022, Page(s) 27:1-27:40, ISSN 1942-3454
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3470869

On a vertex-capturing game

Author(s): Julien Bensmail; Fionn Mc Inerney
Published in: Theoretical Computer Science, Issue 3, 2022, Page(s) 27-46, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2022.04.050

Parameterized and Exact Algorithms for Class Domination Coloring

Author(s): R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Published in: Discret. Appl. Math., Issue 291, 2021, Page(s) 286-299, ISSN 0166-218X
Publisher: Elsevier BV
DOI: 10.1016/j.dam.2020.12.015

Parameterized Intractability of Even Set and Shortest Vector Problem

Author(s): Arnab Bhattacharyya; Édouard Bonnet; László Egri; Suprovat Ghoshal; C S Karthik; Bingkai Lin; Pasin Manurangsi; Dániel Marx
Published in: Journal of the ACM, Issue 68(3), 2021, Page(s) 16:1-16:40, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3444942

Parameterized Complexity of Maximum Edge Colorable Subgraph

Author(s): Akanksha Agrawal; Madhumita Kundu; Abhishek Sahu; Saket Saurabh; Prafullkumar Tale
Published in: Algorithmica, Issue 84, 2022, Page(s) 3075–3100, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-022-01003-0

Subcubic Certificates for CFL Reachability

Author(s): Chistikov, Dmitry; Majumdar, Rupak; Schepper, Philipp
Published in: Proc. {ACM} Program. Lang., Issue 6, 2022, Page(s) 41:1-41:29, ISSN 2475-1421
Publisher: ACM
DOI: 10.1145/3498702

Finding and Counting Permutations via CSPs

Author(s): Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Published in: Algorithmica, Issue 83(8), 2021, Page(s) 2552-2577, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-021-00812-z

Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams

Author(s): Dániel Marx, Michal Pilipczuk
Published in: ACM Transactions on Algorithms, Issue 18(2), 2022, Page(s) 13:1-13:64, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3483425

Slightly Superexponential Parameterized Problems

Author(s): Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Published in: SIAM Journal on Computing, Issue 47/3, 2018, Page(s) 675-702, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1104834

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs

Author(s): Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Published in: Algorithmica, Issue 81/2, 2019, Page(s) 421-438, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-018-0479-5

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

Author(s): Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Published in: ACM Transactions on Algorithms, Issue 14/2, 2018, Page(s) 1-30, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3170442

Fine-grained complexity of coloring unit disks and balls

Author(s): Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Paweł Rzążewski
Published in: Journal of Computational Geometry, Issue 9(2), 2018, Page(s) 47-80, ISSN 1920-180X
Publisher: -
DOI: 10.20382/jocg.v9i2a4

Block interpolation: A framework for tight exponential-time counting complexity

Author(s): Radu Curticapean
Published in: Information and Computation, Issue 261, 2018, Page(s) 265-280, ISSN 0890-5401
Publisher: Academic Press
DOI: 10.1016/j.ic.2018.02.008

Routing with congestion in acyclic digraphs

Author(s): Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Published in: Information Processing Letters, Issue 151, 2019, Page(s) 105836, ISSN 0020-0190
Publisher: Elsevier BV
DOI: 10.1016/j.ipl.2019.105836

Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms

Author(s): Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Published in: Algorithmica, Issue 81/10, 2019, Page(s) 3890-3935, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-019-00579-4

Multi-budgeted Directed Cuts

Author(s): Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
Published in: Algorithmica, Issue 82/8, 2020, Page(s) 2135-2155, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-019-00609-1

The Parameterized Hardness of the k-Center Problem in Transportation Networks

Author(s): Andreas Emil Feldmann, Dániel Marx
Published in: Algorithmica, Issue 82/7, 2020, Page(s) 1989-2005, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-020-00683-w

Disjoint Paired-Dominating sets in Cubic Graphs

Author(s): Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza
Published in: Graphs and Combinatorics, Issue 35/5, 2019, Page(s) 1129-1138, ISSN 0911-0119
Publisher: Springer Verlag
DOI: 10.1007/s00373-019-02063-w

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)

Author(s): Rajesh H. Chitnis, Andreas E. Feldmann, MohammadTaghi HajiAghayi, Daniel Marx
Published in: SIAM Journal on Computing, Issue 49/2, 2020, Page(s) 318-364, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m122371x

A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs

Author(s): Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak; Dániel Marx; Tom C. van der Zanden
Published in: SIAM Journal on Computing, Issue 49(6), 2020, Page(s) 1291-1331, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1320870

Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes

Author(s): Radu Curticapean; Holger Dell; Marc Roth
Published in: Theoretical Computer Science, Issue 63, 2019, Page(s) 987-1026, ISSN 1432-4350
Publisher: Springer Verlag
DOI: 10.1007/s00224-018-9893-y

Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set

Author(s): Alexander Göke, Dániel Marx, Matthias Mnich
Published in: Discrete Optimization, Issue 46, 2022, Page(s) 100740, ISSN 1572-5286
Publisher: Elsevier BV
DOI: 10.1016/j.disopt.2022.100740

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering

Author(s): Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Published in: SIAM Journal on Computing, Issue 51(6), 2022, Page(s) 1866-1930, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1262504

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs

Author(s): Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
Published in: Journal of the ACM, Issue 68(4), 2021, Page(s) 30:1-30:26, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3450704

Four Shorts Stories on Surprising Algorithmic Uses of Treewidth

Author(s): Dániel Marx
Published in: Treewidth, Kernels, and Algorithms, 2020, Page(s) 129-144, ISBN 978-3-030-42070-3
Publisher: Springer
DOI: 10.1007/978-3-030-42071-0_10

Covering a tree with rooted subtrees – parameterized and approximation algorithms

Author(s): Lin Chen, Daniel Marx
Published in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018, Page(s) 2801-2820, ISBN 978-1-61197-503-1
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.178

Interval Vertex Deletion Admits a Polynomial Kernel

Author(s): Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 1711-1730, ISBN 978-1-61197-548-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.103

Quadratic Vertex Kernel for Split Vertex Deletion

Author(s): Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Published in: Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings, Issue 11485, 2019, Page(s) 1-12, ISBN 978-3-030-17401-9
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-17402-6_1

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs

Author(s): Cohen-Addad, V; de, Verdière É C; Marx, Dániel; de, Mesmay A
Published in: 35th International Symposium on Computational Geometry (SoCG 2019), Issue 2019, 2019, Page(s) 27:1--27:16, ISBN 978-3-95977-104-7
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.socg.2019.27

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank

Author(s): Radu Curticapea, Nathan Lindzey, Jesper Nederlof
Published in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Issue 2018, 2018, Page(s) 1080-1099, ISBN 978-1-61197-503-1
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.70

Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set

Author(s): Alexander Göke, Dániel Marx, Matthias Mnich
Published in: Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings, Issue 11485, 2019, Page(s) 249-261, ISBN 978-3-030-17401-9
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-17402-6_21

The Largest Connected Subgraph Game

Author(s): Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse
Published in: Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376, Issue 1, 2021, Page(s) 296-307, ISBN 978-3-030-86837-6
Publisher: Springer
DOI: 10.1007/978-3-030-86838-3_23

Searching for OpenAIRE data...

Publications

Share this page Share this page on social networks

Download Download the content of the page