Rigorous Search Space Reduction

Información del proyecto

ReduceSearch

Identificador del acuerdo de subvención: 803421

DOI

10.3030/803421

Proyecto cerrado

Fecha de la firma de la CE 4 Septiembre 2018

Fecha de inicio 1 Enero 2019

Fecha de finalización 31 Diciembre 2023

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 473 020,00

Aportación de la UE

€ 1 473 020,00

Coordinado por

TECHNISCHE UNIVERSITEIT EINDHOVEN
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

Thesis and dissertations (1)

Parameterized Graph Modification Beyond the Natural Parameter

Autores: Jari J. H. de Kroon
Publicado en: 2023
Editor: Eindhoven University of Technology

Peer reviewed articles (6)

Finding k-secluded trees faster

Autores: Huib Donkers; Bart M.P. Jansen; Jari J.H. de Kroon
Publicado en: Journal of Computer and System Sciences, Edición 138, 2023, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2023.05.006

Edge Exploration of Temporal Graphs

Autores: Benjamin Merlin Bumpus, Kitty Meeks
Publicado en: Algorithmica, 2022, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-022-01018-7

Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies

Autores: Bart M. P. Jansen, Jari J. H. de Kroon
Publicado en: Journal of Computer and System Sciences, Edición 126, 2022, Página(s) 59--79, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2021.12.003

Spined categories: generalizing tree-width beyond graphs

Autores: Benjamin Merlin Bumpus, Zoltan A. Kocsis
Publicado en: European Journal of Combinatorics, Edición 114, 2023, Página(s) 103794, ISSN 0195-6698
Editor: Academic Press
DOI: 10.1016/j.ejc.2023.103794

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size

Autores: Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Publicado en: Algorithmica, Edición 84, 2022, Página(s) 3407--3458, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-022-00984-2

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

Autores: Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Publicado en: SIAM Journal on Discrete Mathematics, Edición 36, 2022, Página(s) 2737--2773, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/21m1400766

Conference proceedings (19)

Kernelization for Feedback Vertex Set via Elimination Distance to a Forest

Autores: David Dekker, Bart M. P. Jansen
Publicado en: Proceedings of the 48th 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022, Edición 13453, 2022, Página(s) 158--172
Editor: Springer
DOI: 10.1007/978-3-031-15914-5_12

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size

Autores: Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Publicado en: Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Edición 214, 2021, Página(s) 14:1--14:18
Editor: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.ipec.2021.14

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth

Autores: Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Publicado en: Proceedings of the 31th International Symposium on Graph Drawing and Network Visualization, GD 2023, Edición 14466, 2023, Página(s) 203–217
Editor: Springer
DOI: 10.1007/978-3-031-49275-4_14

5-approximation for H-treewidth essentially as fast as H-deletion parameterized by solution size

Autores: Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk
Publicado en: Proceedings of the 31st European Symposium on Algorithms, ESA 2023, 2023
Editor: LIPICS
DOI: 10.4230/lipics.esa.2023.66

Optimal Polynomial-Time Compression for Boolean Max CSP

Autores: Bart M. P. Jansen, Michal Wlodarczyk
Publicado en: Proceedings of the 28th Annual European Symposium on Algorithms, ESA 2020, Edición 173, 2020, Página(s) 63:1--63:19, ISBN 978-3-95977-162-7
Editor: Schloss Dagstuhl--Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.esa.2020.63

Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes

Autores: Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk
Publicado en: Proceedings of the 34th International Symposium on Algorithms and Computation, ISAAC 2023, 2023
Editor: LIPICS
DOI: 10.4230/lipics.isaac.2023.42

On the Parameterized Complexity of Multiway Near-Separator

Autores: Jansen, Bart M. P.; Roy, Shivesh K.
Publicado en: Proceedings of the 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Edición 285, 2023, Página(s) 28:1–28:18
Editor: LIPICS
DOI: 10.4230/lipics.ipec.2023.28

Finding k-Secluded Trees Faster

Autores: Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
Publicado en: Proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022, Edición 13453, 2022, Página(s) 173--186
Editor: Springer
DOI: 10.1007/978-3-031-15914-5_13

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Autores: Edouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
Publicado en: Proceedings of the 27th Annual European Symposium on Algorithms, ESA 2019, Edición 144, 2019, Página(s) 23:1--23:14, ISBN 978-3-95977-124-5
Editor: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.esa.2019.23

Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

Autores: Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Publicado en: Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Edición 168, 2020, Página(s) 16:1--16:19, ISBN 978-3-95977-138-2
Editor: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.icalp.2020.16

Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies

Autores: Bart M. P. Jansen, Jari J. H. de Kroon
Publicado en: Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, Edición 162, 2020, Página(s) 27:1--27:15, ISBN 978-3-95977-150-4
Editor: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.swat.2020.27

Vertex deletion parameterized by elimination distance and even less

Autores: Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk
Publicado en: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Página(s) 1757-1769, ISBN 9781450380539
Editor: ACM
DOI: 10.1145/3406325.3451068

Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion

Autores: Bart M. P. Jansen, Michał Włodarczyk
Publicado en: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC'22, 2022, Página(s) 900--913
Editor: ACM
DOI: 10.1145/3519935.3520021

FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More

Autores: Bart M. P. Jansen, Jari J. H. de Kroon
Publicado en: Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2021, 2021, Página(s) 80-93
Editor: Springer
DOI: 10.1007/978-3-030-86838-3_6

Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions

Autores: Jansen, Bart M. P.; van der Steenhoven, Bart
Publicado en: Proceedings of the 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Edición 285, 2023, Página(s) 27:1–27:15
Editor: LIPICS
DOI: 10.4230/lipics.ipec.2023.27

Search-Space Reduction via Essential Vertices

Autores: Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
Publicado en: Proceedings of the 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Página(s) 244
Editor: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.esa.2022.30

On the hardness of compressing weights

Autores: Bart M. P. Jansen, Shivesh K. Roy, Michal Wlodarczyk
Publicado en: Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, Edición 202, 2021, Página(s) 64:1–64:21, ISBN 978-3-95977-201-3
Editor: Schloss Dagstuhl--Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.mfcs.2021.64

Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set

Autores: Huib Donkers, Bart M. P. Jansen
Publicado en: Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2021, 2021, Página(s) 1-14
Editor: Springer
DOI: 10.1007/978-3-030-86838-3_1

Sunflowers meet sparsity: a linear-vertex kernel for weighted clique-packing on sparse graphs

Autores: Bart M. P. Jansen, Shivesh K. Roy
Publicado en: 2023
Editor: LIPICS
DOI: 10.4230/lipics.ipec.2023.29

Book chapters (1)

Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds

Autores: Bart M. P. Jansen
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) 89-111, ISBN 978-3-030-42070-3
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-42071-0_8

Other (1)

Vertex Deletion Parameterized by Elimination Distance and Even Less

Autores: Michal Wlodarczyk
Publicado en: Parameterized Complexity News: Newsletter of the Parameterized Complexity Community, Edición Volume 17 number 2, 2021, Página(s) 7-8
Editor: fpt.wikidot.com