Systematic mapping of the complexity landscape of hard algorithmic graph problems

Pubblicazioni

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

Autori: Jacob Focke, Dániel Marx, Pawel Rzazewski
Pubblicato in: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Pagina/e 431--458, ISBN 978-1-61197-707-3
Editore: SIAM
DOI: 10.1137/1.9781611977073.22

On the Parameterized Complexity of Grid Contraction

Autori: Saket Saurabh; Uéverton dos Santos Souza; Prafullkumar Tale
Pubblicato in: 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), 2020, Pagina/e 34:1-34:17, ISBN 978-3-95977-150-4
Editore: 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

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

Fine-Grained Complexity of Regular Expression Pattern Matching and Membership

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

Counting small induced subgraphs with hereditary properties

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

Sample Compression Schemes for Balls in Graphs

Autori: Chalopin, Jérémie; Chepoi, Victor; Mc Inerney, Fionn; Ratel, Sébastien; Vaxès, Yann
Pubblicato in: MFCS 2022, Numero 2022, 2022, Pagina/e 31:1-31:14, ISBN 978-3-95977-256-3
Editore: 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

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

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search

Autori: Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Pubblicato in: 30th Annual European Symposium on Algorithms (ESA 2022), 2022, Pagina/e 50:1-50:19, ISBN 978-3-95977-247-1
Editore: 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)

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

Domination and cut problems on chordal graphs with bounded leafage

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

Hitting Long Directed Cycles Is Fixed-Parameter Tractable

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

The Complexity of Contracting Bipartite Graphs into Small Cycles

Autori: Krithika, R.; Sharma, R.; Tale, P.
Pubblicato in: Graph-Theoretic Concepts in Computer Science - 48th International Workshop (WG 2022), 2022, Pagina/e 356-369, ISBN 978-3-031-15913-8
Editore: Springer
DOI: 10.1007/978-3-031-15914-5_26

Computing Square Colorings on Bounded-Treewidth and Planar Graphs

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

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations

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

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

Autori: Dániel Marx, Govind S. Sankar, Philipp Schepper
Pubblicato in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021, Pagina/e 95:1--95:20, ISBN 978-3-95977-195-5
Editore: 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

Autori: Vincent Cohen-Addad, Philip N. Klein, Dániel Marx, Archer Wheeler, Christopher Wolfram
Pubblicato in: 2nd Symposium on Foundations of Responsible Computing (FORC 2021), 2021, Pagina/e 3:1-3:18, ISBN 978-3-95977-187-0
Editore: 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

Autori: Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk
Pubblicato in: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, Pagina/e 474-484, ISBN 978-1-5386-4230-6
Editore: IEEE
DOI: 10.1109/focs.2018.00052

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

Autori: Feldmann, Andreas Emil ; Marx, Dániel
Pubblicato in: 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018, Pagina/e 19:1-19:13, ISBN 978-3-95977-068-2
Editore: 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

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

Exploring the Kernelization Borders for Hitting Cycles

Autori: Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh
Pubblicato in: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), 2019, Pagina/e 14:1--14:14, ISBN 978-3-95977-084-2
Editore: 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

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

Multi-Budgeted Directed Cuts

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

Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems

Autori: Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Pubblicato in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018), 2018, Pagina/e 1:1--1:15, ISBN 978-3-95977-085-9
Editore: 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

Autori: Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
Pubblicato in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018, 2018, Pagina/e 574-586, ISBN 9781-450355599
Editore: ACM Press
DOI: 10.1145/3188745.3188854

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

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

Parameterized Streaming Algorithms for Min-Ones d-SAT

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

Connecting the Dots (with Minimum Crossings

Autori: Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
Pubblicato in: 35th International Symposium on Computational Geometry (SoCG 2019), Numero 2019, 2019, Pagina/e 7:1--7:17, ISBN 978-3-95977-104-7
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.socg.2019.7

Path Contraction Faster Than 2^n

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

A Polynomial Kernel for Diamond-Free Editing

Autori: Cao, Yixin; Rai, Ashutosh; Sandeep, R. B.; Ye, Junjie
Pubblicato in: 26th Annual European Symposium on Algorithms (ESA 2018), Numero 2019, 2019, Pagina/e 10:1--10:13, ISBN 978-3-95977-081-1
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2018.10

Finding and Counting Permutations via CSPs

Autori: Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Pubblicato in: 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Numero 2019, 2019, Pagina/e 1:1--1:16, ISBN 978-3-95977-129-0
Editore: 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?

Autori: Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
Pubblicato in: 30th International Symposium on Algorithms and Computation (ISAAC 2019), Numero 2019, 2019, Pagina/e 36:1--36:18, ISBN 978-3-95977-130-6
Editore: 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.

Autori: Marvin Künnemann, Dániel Marx
Pubblicato in: Proceedings of the Computational Complexity Conference 2020, 2020, Pagina/e 27:1-27:28, ISBN 978-3-95977-156-6
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020
DOI: 10.4230/lipics.ccc.2020.27

Chordless Cycle Packing Is Fixed-Parameter Tractable

Autori: Dániel Marx
Pubblicato in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Pagina/e 71:1--71:19, ISBN 978-3-95977-162-7
Editore: 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

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

Isomorphism Testing Parameterized by Genus and Beyond

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

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

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

Parameterized Complexity of Weighted Multicut in Trees

Autori: Galby, E.; Marx, D.; Schepper, P.; Sharma, R.; Tale, P.
Pubblicato in: Graph-Theoretic Concepts in Computer Science (WG 2022), 2022, Pagina/e 257-270, ISBN 978-3-031-15913-8
Editore: Springer
DOI: 10.1007/978-3-031-15914-5_19

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

Autori: Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
Pubblicato in: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Pagina/e 2085-2127, ISBN 978-1-61197-707-3
Editore: SIAM
DOI: 10.1137/1.9781611977073.83

Approximately counting answers to conjunctive queries with disequalities and negations

Autori: Focke, J; Goldberg, L; Roth, M; Zivny, S
Pubblicato in: PODC 2022, Numero 2022, 2022, Pagina/e 315-324, ISBN 978-1-4503-9260-0
Editore: Association for Computing Machinery
DOI: 10.1145/3517804.3526231

Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction

Autori: Dániel Marx
Pubblicato in: PODS'21: Proceedings of the 40th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems, 2021, Pagina/e 19-29, ISBN 9781450383813
Editore: ACM
DOI: 10.1145/3452021.3458814

Parameterized Approximation Schemes for Clustering with General Norm Objectives

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

enComputing Generalized Convolutions Faster Than Brute Force

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

Using edge contractions to reduce the semitotal domination number

Autori: Esther Galby; Paloma T. Lima; Felix Mann; Bernard Ries
Pubblicato in: Theoretical Computer Science, Numero 939, 2023, Pagina/e 140-160, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2022.10.020

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

Autori: Marx Dániel; Sandeep, R. B.
Pubblicato in: J. Comput. Syst. Sci., Numero 125, 2022, Pagina/e 25-58, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2021.11.001

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

Autori: Saurabh, Saket; Tale, Prafullkumar
Pubblicato in: Algorithmica, Numero 84(2), 2022, Pagina/e 405-435, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-021-00897-6

Sparsification Lower Bound for Linear Spanners in Directed Graphs

Autori: Prafullkumar Tale
Pubblicato in: Theor. Comput. Sci., Numero 898, 2022, Pagina/e 69--74, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2021.10.022

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

Autori: Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk
Pubblicato in: SIAM Journal on Computing, Numero 51(2), 2022, Pagina/e 254-289, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1304088

The Maker-Breaker Largest Connected Subgraph game

Autori: Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid
Pubblicato in: Theoretical Computer Science, Numero 943, 2022, Pagina/e 102-120, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2022.12.014

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

Autori: Spoorthy Gunda; Pallavi Jain; Daniel Lokshtanov; Saket Saurabh; Prafullkumar Tale
Pubblicato in: ACM Trans. Comput. Theory, Numero 13(4), 2022, Pagina/e 27:1-27:40, ISSN 1942-3454
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3470869

On a vertex-capturing game

Autori: Julien Bensmail; Fionn Mc Inerney
Pubblicato in: Theoretical Computer Science, Numero 3, 2022, Pagina/e 27-46, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2022.04.050

Parameterized and Exact Algorithms for Class Domination Coloring

Autori: R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Pubblicato in: Discret. Appl. Math., Numero 291, 2021, Pagina/e 286-299, ISSN 0166-218X
Editore: Elsevier BV
DOI: 10.1016/j.dam.2020.12.015

Parameterized Intractability of Even Set and Shortest Vector Problem

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

Parameterized Complexity of Maximum Edge Colorable Subgraph

Autori: Akanksha Agrawal; Madhumita Kundu; Abhishek Sahu; Saket Saurabh; Prafullkumar Tale
Pubblicato in: Algorithmica, Numero 84, 2022, Pagina/e 3075–3100, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-022-01003-0

Subcubic Certificates for CFL Reachability

Autori: Chistikov, Dmitry; Majumdar, Rupak; Schepper, Philipp
Pubblicato in: Proc. {ACM} Program. Lang., Numero 6, 2022, Pagina/e 41:1-41:29, ISSN 2475-1421
Editore: ACM
DOI: 10.1145/3498702

Finding and Counting Permutations via CSPs

Autori: Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Pubblicato in: Algorithmica, Numero 83(8), 2021, Pagina/e 2552-2577, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-021-00812-z

Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams

Autori: Dániel Marx, Michal Pilipczuk
Pubblicato in: ACM Transactions on Algorithms, Numero 18(2), 2022, Pagina/e 13:1-13:64, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3483425

Slightly Superexponential Parameterized Problems

Autori: Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Pubblicato in: SIAM Journal on Computing, Numero 47/3, 2018, Pagina/e 675-702, ISSN 0097-5397
Editore: 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

Autori: Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Pubblicato in: Algorithmica, Numero 81/2, 2019, Pagina/e 421-438, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-018-0479-5

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

Autori: Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Pubblicato in: ACM Transactions on Algorithms, Numero 14/2, 2018, Pagina/e 1-30, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3170442

Fine-grained complexity of coloring unit disks and balls

Autori: Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Paweł Rzążewski
Pubblicato in: Journal of Computational Geometry, Numero 9(2), 2018, Pagina/e 47-80, ISSN 1920-180X
Editore: -
DOI: 10.20382/jocg.v9i2a4

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

Autori: Radu Curticapean
Pubblicato in: Information and Computation, Numero 261, 2018, Pagina/e 265-280, ISSN 0890-5401
Editore: Academic Press
DOI: 10.1016/j.ic.2018.02.008

Routing with congestion in acyclic digraphs

Autori: Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Pubblicato in: Information Processing Letters, Numero 151, 2019, Pagina/e 105836, ISSN 0020-0190
Editore: 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

Autori: Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Pubblicato in: Algorithmica, Numero 81/10, 2019, Pagina/e 3890-3935, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-019-00579-4

Multi-budgeted Directed Cuts

Autori: Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
Pubblicato in: Algorithmica, Numero 82/8, 2020, Pagina/e 2135-2155, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-019-00609-1

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

Autori: Andreas Emil Feldmann, Dániel Marx
Pubblicato in: Algorithmica, Numero 82/7, 2020, Pagina/e 1989-2005, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-020-00683-w

Disjoint Paired-Dominating sets in Cubic Graphs

Autori: Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza
Pubblicato in: Graphs and Combinatorics, Numero 35/5, 2019, Pagina/e 1129-1138, ISSN 0911-0119
Editore: Springer Verlag
DOI: 10.1007/s00373-019-02063-w

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

Autori: Rajesh H. Chitnis, Andreas E. Feldmann, MohammadTaghi HajiAghayi, Daniel Marx
Pubblicato in: SIAM Journal on Computing, Numero 49/2, 2020, Pagina/e 318-364, ISSN 0097-5397
Editore: 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

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

Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes

Autori: Radu Curticapean; Holger Dell; Marc Roth
Pubblicato in: Theoretical Computer Science, Numero 63, 2019, Pagina/e 987-1026, ISSN 1432-4350
Editore: Springer Verlag
DOI: 10.1007/s00224-018-9893-y

Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set

Autori: Alexander Göke, Dániel Marx, Matthias Mnich
Pubblicato in: Discrete Optimization, Numero 46, 2022, Pagina/e 100740, ISSN 1572-5286
Editore: Elsevier BV
DOI: 10.1016/j.disopt.2022.100740

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

Autori: Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Pubblicato in: SIAM Journal on Computing, Numero 51(6), 2022, Pagina/e 1866-1930, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1262504

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs

Autori: Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
Pubblicato in: Journal of the ACM, Numero 68(4), 2021, Pagina/e 30:1-30:26, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3450704

Four Shorts Stories on Surprising Algorithmic Uses of Treewidth

Autori: Dániel Marx
Pubblicato in: Treewidth, Kernels, and Algorithms, 2020, Pagina/e 129-144, ISBN 978-3-030-42070-3
Editore: Springer
DOI: 10.1007/978-3-030-42071-0_10

Covering a tree with rooted subtrees – parameterized and approximation algorithms

Autori: Lin Chen, Daniel Marx
Pubblicato in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018, Pagina/e 2801-2820, ISBN 978-1-61197-503-1
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.178

Interval Vertex Deletion Admits a Polynomial Kernel

Autori: Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Pubblicato in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Pagina/e 1711-1730, ISBN 978-1-61197-548-2
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.103

Quadratic Vertex Kernel for Split Vertex Deletion

Autori: Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Pubblicato in: Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings, Numero 11485, 2019, Pagina/e 1-12, ISBN 978-3-030-17401-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-17402-6_1

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs

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

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank

Autori: Radu Curticapea, Nathan Lindzey, Jesper Nederlof
Pubblicato in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Numero 2018, 2018, Pagina/e 1080-1099, ISBN 978-1-61197-503-1
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.70

Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set

Autori: Alexander Göke, Dániel Marx, Matthias Mnich
Pubblicato in: Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings, Numero 11485, 2019, Pagina/e 249-261, ISBN 978-3-030-17401-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-17402-6_21

The Largest Connected Subgraph Game

Autori: Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse
Pubblicato in: Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376, Numero 1, 2021, Pagina/e 296-307, ISBN 978-3-030-86837-6
Editore: Springer
DOI: 10.1007/978-3-030-86838-3_23

È in corso la ricerca di dati su OpenAIRE...

Pubblicazioni

Condividi questa pagina

Scarica