Finding Cracks in the Wall of NP-completeness

Información del proyecto

CRACKNP

Identificador del acuerdo de subvención: 853234

DOI

10.3030/853234

Proyecto cerrado

Fecha de la firma de la CE 30 Septiembre 2019

Fecha de inicio 1 Febrero 2020

Fecha de finalización 31 Enero 2025

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 499 632,00

Aportación de la UE

€ 1 499 632,00

Coordinado por

UNIVERSITEIT UTRECHT
Netherlands

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Peer reviewed articles (13)

Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph

Autores: Vasily Alferov, Ivan Bliznets, Kirill Brilliantov
Publicado en: Proceedings of the AAAI Conference on Artificial Intelligence, Edición 38, 2024, Página(s) 7918-7925, ISSN 2374-3468
Editor: AAAI presss
DOI: 10.1609/aaai.v38i8.28628

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan

Autores: Jesper Nederlof, Céline M. F. Swennenhuis
Publicado en: Algorithmica, Edición 84, 2022, Página(s) 2309-2334, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-022-00970-8

Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces

Autores: Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Publicado en: ACM Transactions on Algorithms, Edición 16/3, 2020, Página(s) 1-30, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3371389

Isometric Universal Graphs

Autores: Louis Esperet, Cyril Gavoille, Carla Groenland
Publicado en: SIAM Journal on Discrete Mathematics, Edición 35/2, 2021, Página(s) 1224-1237, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/21m1406155

Decomposing Random Permutations into Order-Isomorphic Subpermutations

Autores: Carla Groenland, Tom Johnston, Daniel Korandi, Alexander Roberts, Alex Scott, Jane Tan
Publicado en: SIAM Journal on Discrete Mathematics, Edición 37, 2023, Página(s) 1252-1261, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m148029x

Graphs of low average degree without independent transversals

Autores: Carla Groenland, Tomáš Kaiser, Oscar Treffers, Matthew Wales
Publicado en: Journal of Graph Theory, Edición 102, 2023, Página(s) 374-387, ISSN 0364-9024
Editor: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22876

Improved Algorithms for Maximum Satisfiability and Its Special Cases

Autores: Kirill Brilliantov, Vasily Alferov, Ivan Bliznets
Publicado en: Proceedings of the AAAI Conference on Artificial Intelligence, Edición 37, 2023, Página(s) 3898-3905, ISSN 2374-3468
Editor: AAAI press
DOI: 10.1609/aaai.v37i4.25503

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

Autores: Jesper Nederlof, Michał Pilipczuk, Karol Węgrzycki
Publicado en: The Electronic Journal of Combinatorics, Edición 30, 2023, ISSN 1077-8926
Editor: Electronic Journal of Combinatorics
DOI: 10.37236/11095

Reconstructing the degree sequence of a sparse graph from a partial deck

Autores: Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex Scott, Jane Tan
Publicado en: Journal of Combinatorial Theory, Series B, Edición 157, 2024, Página(s) 283-293, ISSN 0095-8956
Editor: Academic Press
DOI: 10.1016/j.jctb.2022.07.004

Approximating Pathwidth for Graphs of Small Treewidth

Autores: Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Publicado en: ACM Transactions on Algorithms, Edición 19, 2023, Página(s) 1-19, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3576044

The lengths for which bicrucial square-free permutations exist

Autores: null null, Carla Groenland, Tom Johnston, null null
Publicado en: Enumerative Combinatorics and Applications, Edición 2, 2022, Página(s) "Article #S4PP4", ISSN 2710-2335
Editor: Electronic
DOI: 10.54550/eca2022v2s4pp4

Fair division with minimal withheld information in social networks

Autores: Ivan Bliznets, Anton Bukov, Danil Sagunov
Publicado en: Theoretical Computer Science, Edición 991, 2024, Página(s) 114446, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2024.114446

Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$

Autores: Ivan Bliznets, Danil Sagunov
Publicado en: Algorithmica, Edición 85, 2023, Página(s) 384-405, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-022-01031-w

Conference proceedings (23)

Tight Lower Bounds for Problems Parameterized by Rank-width

Autores: Bergougnoux, Benjamin; Korhonen, Tuukka; Nederlof, Jesper
Publicado en: Edición 11, 2023
Editor: LIPIcs
DOI: 10.48550/arxiv.2210.02117

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints

Autores: Nederlof, Jesper; Swennenhuis, Céline M. F.; Węgrzycki, Karol
Publicado en: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Edición 1, 2025
Editor: SIAM
DOI: 10.48550/arxiv.2312.03495

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

Autores: Kisfaludi-Bak, S.; Nederlof, J.; Węgrzycki, K.
Publicado en: Crossref, Edición 5, 2021
Editor: IEEE
DOI: 10.48550/arxiv.2011.03778

On the Complexity of Problems on Tree-structured Graphs

Autores: Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo; Pilipczuk, Marcin; Pilipczuk, Michał
Publicado en: Edición 32, 2022
Editor: LIPICS
DOI: 10.48550/arxiv.2206.11828

Enumeration of Minimal Tropical Connected Sets

Autores: Ivan Bliznets; Danil Sagunov; Eugene Tagin
Publicado en: Algorithms and Complexity - 13th International Conference (CIAC), 2023
Editor: Springer

On the parameterized complexity of computing tree-partitions

Autores: Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo
Publicado en: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Edición 14, 2022
Editor: LIPICS
DOI: 10.48550/arxiv.2206.11832

A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth

Autores: Mannens, Isja; Nederlof, Jesper
Publicado en: 31st Annual European Symposium on Algorithms, ESA 2023, Edición 3, 2023
Editor: LIPICS
DOI: 10.48550/arxiv.2307.01046

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a Rooted K_4-Minor

Autores: Carla Groenland, Jesper Nederlof, Tomohiro Koana
Publicado en: 19th International Symposium on Parameterized and Exact Computation, 2024
Editor: LIPICS

Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron

Autores: Paul Bastide, Carla Groenland, Hugo Jacob, Tom Johnston
Publicado en: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, Página(s) 120-126
Editor: Masaryk University Press
DOI: 10.5817/cz.muni.eurocomb23-017

Isolation Schemes for Problems on Decomposable Graphs

Autores: Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Publicado en: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, Edición 33, 2022
Editor: LIPICS

XNLP-hardness of Parameterized Problems on Planar Graphs

Autores: Bodlaender, Hans L.; Szilágyi, Krisztina
Publicado en: 19th International Symposium on Parameterized and Exact Computation, Edición 1, 2024
Editor: LIPICS
DOI: 10.48550/arxiv.2402.03087

Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors

Autores: Jesper Nederlof, Karol Węgrzycki
Publicado en: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Página(s) 1670-1683, ISBN 9781450380539
Editor: ACM
DOI: 10.1145/3406325.3451024

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters

Autores: Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
Publicado en: 51st International Colloquium on Automata, Languages, and Programming, 2024
Editor: LIPICS
DOI: 10.4230/lipics.icalp.2024.77

Tight bounds for counting colorings and connected edge sets parameterized by cutwidth

Autores: Groenland, Carla; Mannens, Isja; Nederlof, Jesper; Szilágyi, Krisztina
Publicado en: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Edición 1, 2022
Editor: LIPCS
DOI: 10.48550/arxiv.2110.02730

Parameterized Complexities of Dominating and Independent Set Reconfiguration

Autores: Bodlaender, Hans L.; Groenland, Carla; Swennenhuis, Céline M.F.; Golovach, Petr A.; Zehavi, Meirav; Sub Algorithms and Complexity; Algorithms and Complexity
Publicado en: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Edición 1, 2021
Editor: LIPICS
DOI: 10.4230/lipics.ipec.2021.9

Detecting and counting small patterns in planar graphs in subexponential parameterized time

Autores: Jesper Nederlof
Publicado en: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Página(s) 1293-1306, ISBN 9781450369794
Editor: ACM
DOI: 10.1145/3357713.3384261

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs

Autores: Björklund, Andreas; Kaski, Petteri; Nederlof, Jesper
Publicado en: 51st International Colloquium on Automata, Languages, and Programming, Edición 5, 2024
Editor: LIPICS
DOI: 10.48550/arxiv.2308.01574

MaxCut Above Guarantee

Autores: Ivan Bliznets; Vladislav Epifanov
Publicado en: 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Editor: LIPICS

Polynomial-time Approximation of Independent Set Parameterized by Treewidth

Autores: Chalermsook, Parinya; Fomin, Fedor V.; Hamm, Thekla; Korhonen, Tuukka; Nederlof, Jesper; Orgo, Ly
Publicado en: In 31st Annual European Symposium on Algorithms, Edición 18, 2023
Editor: LIPICS
DOI: 10.48550/arxiv.2307.01341

XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure

Autores: Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo; Jaffke, Lars; Lima, Paloma T.
Publicado en: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Edición 4, 2022
Editor: LIPICS
DOI: 10.48550/arxiv.2201.13119

Faster Algorithms on Linear Delta-Matroids

Autores: Tomohiro Koana, Magnus Wahlström
Publicado en: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), 2025
Editor: LIPICS
DOI: 10.4230/lipics.stacs.2025.62

Faster Edge Coloring by Partition Sieving

Autores: Shyan Akmal, Tomohiro Koana
Publicado en: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), 2025
Editor: LIPICS
DOI: 10.4230/lipics.stacs.2025.7

Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication

Autores: Jesper Nederlof
Publicado en: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Página(s) 40-53, ISBN 9781450369794
Editor: ACM
DOI: 10.1145/3357713.3384264

Book chapters (14)

List Colouring Trees in Logarithmic Space

Autores: Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo
Publicado en: 30th Annual European Symposium on Algorithms (ESA 2022), Edición 2, 2022
Editor: LIPICS
DOI: 10.48550/arxiv.2206.09750

The Parameterised Complexity of Integer Multicommodity Flow

Autores: Mannens, Isja; Oostveen, Jelle; van Leeuwen, Erik Jan; Pandey, Sukanya; Bodlaender, Hans L.
Publicado en: 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), Edición 4, 2023
Editor: LIPICS
DOI: 10.48550/arxiv.2310.05784

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

Autores: Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Węgrzycki
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 1682-1701, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.102

Tight Double Exponential Lower Bounds

Autores: Ivan Bliznets, Markus Hecher
Publicado en: Lecture Notes in Computer Science, Theory and Applications of Models of Computation, 2024, Página(s) 124-136
Editor: Springer Nature Singapore
DOI: 10.1007/978-981-97-2340-9_11

Parameterized Algorithms for Covering by Arithmetic Progressions

Autores: Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
Publicado en: Lecture Notes in Computer Science, SOFSEM 2024: Theory and Practice of Computer Science, 2024, Página(s) 125-138
Editor: Springer Nature Switzerland
DOI: 10.1007/978-3-031-52113-3_9

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

Autores: Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, Karol Węgrzycki
Publicado en: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers, Edición 12301, 2020, Página(s) 27-39, ISBN 978-3-030-60439-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-60440-0_3

Exact and Parameterized Algorithms for Choosability

Autores: Ivan Bliznets, Jesper Nederlof
Publicado en: Lecture Notes in Computer Science, SOFSEM 2024: Theory and Practice of Computer Science, 2024, Página(s) 111-124
Editor: Springer Nature Switzerland
DOI: 10.1007/978-3-031-52113-3_8

Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs

Autores: Jesper Nederlof, Krisztina Szilágyi
Publicado en: Lecture Notes in Computer Science, SOFSEM 2024: Theory and Practice of Computer Science, 2024, Página(s) 413-426
Editor: Springer Nature Switzerland
DOI: 10.1007/978-3-031-52113-3_29

Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices

Autores: Jesper Nederlof
Publicado en: Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, Edición 12160, 2020, Página(s) 145-164, ISBN 978-3-030-42070-3
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-42071-0_11

On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem

Autores: Isja Mannens, Jesper Nederlof, Céline Swennenhuis, Krisztina Szilágyi
Publicado en: Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers, Edición 12911, 2021, Página(s) 52-79, ISBN 978-3-030-86837-6
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-86838-3_5

A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs

Autores: Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek
Publicado en: 35th International Symposium on Distributed Computing (DISC 2021), Edición 35, 2020, ISBN 978-3-95977-210-5
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.disc.2021.13

On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan

Autores: Nederlof, Jesper ; Swennenhuis, Céline M. F.
Publicado en: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020, Página(s) 25:1--25:17, ISBN 978-3-95977-172-6
Editor: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.ipec.2020.25

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space

Autores: Bodlaender, Hans L.; Groenland, Carla; Nederlof, Jesper; Swennenhuis, Celine M.F.; Sub Algorithms and Complexity; Dep Wiskunde; Sub Mathematical Modeling; Algorithms and Complexity
Publicado en: Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021, Edición 2, 2021
Editor: IEEE
DOI: 10.1109/focs52979.2021.00027

Fair Division with Minimal Withheld Information in Social Networks

Autores: Ivan Bliznets, Anton Bukov, Danil Sagunov
Publicado en: Lecture Notes in Computer Science, Computing and Combinatorics, 2023, Página(s) 126-137
Editor: Springer International Publishing
DOI: 10.1007/978-3-031-22105-7_12

Other (1)

Perfect shuffling with fewer lazy transpositions

Autores: Groenland, Carla; Johnston, Tom; Radcliffe, Jamie; Scott, Alex
Publicado en: arxiv, Edición 1, 2022
Editor: corr
DOI: 10.48550/arxiv.2208.06629