Rigorous Search Space Reduction

Project Information

ReduceSearch

Grant agreement ID: 803421

DOI

10.3030/803421

Project closed

EC signature date 4 September 2018

Start date 1 January 2019

End date 31 December 2023

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 473 020,00

EU contribution

€ 1 473 020,00

Coordinated by

TECHNISCHE UNIVERSITEIT EINDHOVEN
Netherlands

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

Thesis and dissertations (1)

Parameterized Graph Modification Beyond the Natural Parameter

Author(s): Jari J. H. de Kroon
Published in: 2023
Publisher: Eindhoven University of Technology

Peer reviewed articles (6)

Finding k-secluded trees faster

Author(s): Huib Donkers; Bart M.P. Jansen; Jari J.H. de Kroon
Published in: Journal of Computer and System Sciences, Issue 138, 2023, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2023.05.006

Edge Exploration of Temporal Graphs

Author(s): Benjamin Merlin Bumpus, Kitty Meeks
Published in: Algorithmica, 2022, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-022-01018-7

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

Author(s): Bart M. P. Jansen, Jari J. H. de Kroon
Published in: Journal of Computer and System Sciences, Issue 126, 2022, Page(s) 59--79, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2021.12.003

Spined categories: generalizing tree-width beyond graphs

Author(s): Benjamin Merlin Bumpus, Zoltan A. Kocsis
Published in: European Journal of Combinatorics, Issue 114, 2023, Page(s) 103794, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2023.103794

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

Author(s): Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Published in: Algorithmica, Issue 84, 2022, Page(s) 3407--3458, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-022-00984-2

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

Author(s): Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Published in: SIAM Journal on Discrete Mathematics, Issue 36, 2022, Page(s) 2737--2773, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/21m1400766

Conference proceedings (19)

Kernelization for Feedback Vertex Set via Elimination Distance to a Forest

Author(s): David Dekker, Bart M. P. Jansen
Published in: Proceedings of the 48th 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022, Issue 13453, 2022, Page(s) 158--172
Publisher: Springer
DOI: 10.1007/978-3-031-15914-5_12

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

Author(s): Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Published in: Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Issue 214, 2021, Page(s) 14:1--14:18
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.ipec.2021.14

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

Author(s): Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Published in: Proceedings of the 31th International Symposium on Graph Drawing and Network Visualization, GD 2023, Issue 14466, 2023, Page(s) 203–217
Publisher: 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

Author(s): Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk
Published in: Proceedings of the 31st European Symposium on Algorithms, ESA 2023, 2023
Publisher: LIPICS
DOI: 10.4230/lipics.esa.2023.66

Optimal Polynomial-Time Compression for Boolean Max CSP

Author(s): Bart M. P. Jansen, Michal Wlodarczyk
Published in: Proceedings of the 28th Annual European Symposium on Algorithms, ESA 2020, Issue 173, 2020, Page(s) 63:1--63:19, ISBN 978-3-95977-162-7
Publisher: 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

Author(s): Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk
Published in: Proceedings of the 34th International Symposium on Algorithms and Computation, ISAAC 2023, 2023
Publisher: LIPICS
DOI: 10.4230/lipics.isaac.2023.42

On the Parameterized Complexity of Multiway Near-Separator

Author(s): Jansen, Bart M. P.; Roy, Shivesh K.
Published in: Proceedings of the 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Issue 285, 2023, Page(s) 28:1–28:18
Publisher: LIPICS
DOI: 10.4230/lipics.ipec.2023.28

Finding k-Secluded Trees Faster

Author(s): Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
Published in: Proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022, Issue 13453, 2022, Page(s) 173--186
Publisher: Springer
DOI: 10.1007/978-3-031-15914-5_13

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

Author(s): Edouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
Published in: Proceedings of the 27th Annual European Symposium on Algorithms, ESA 2019, Issue 144, 2019, Page(s) 23:1--23:14, ISBN 978-3-95977-124-5
Publisher: 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

Author(s): Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Published in: Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Issue 168, 2020, Page(s) 16:1--16:19, ISBN 978-3-95977-138-2
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.icalp.2020.16

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

Author(s): Bart M. P. Jansen, Jari J. H. de Kroon
Published in: Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, Issue 162, 2020, Page(s) 27:1--27:15, ISBN 978-3-95977-150-4
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.swat.2020.27

Vertex deletion parameterized by elimination distance and even less

Author(s): Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Page(s) 1757-1769, ISBN 9781450380539
Publisher: ACM
DOI: 10.1145/3406325.3451068

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

Author(s): Bart M. P. Jansen, Michał Włodarczyk
Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC'22, 2022, Page(s) 900--913
Publisher: ACM
DOI: 10.1145/3519935.3520021

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

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

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

Author(s): Jansen, Bart M. P.; van der Steenhoven, Bart
Published in: Proceedings of the 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Issue 285, 2023, Page(s) 27:1–27:15
Publisher: LIPICS
DOI: 10.4230/lipics.ipec.2023.27

Search-Space Reduction via Essential Vertices

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

On the hardness of compressing weights

Author(s): Bart M. P. Jansen, Shivesh K. Roy, Michal Wlodarczyk
Published in: Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, Issue 202, 2021, Page(s) 64:1–64:21, ISBN 978-3-95977-201-3
Publisher: 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

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

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

Author(s): Bart M. P. Jansen, Shivesh K. Roy
Published in: 2023
Publisher: 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

Author(s): Bart M. P. Jansen
Published in: Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, Issue 12160, 2020, Page(s) 89-111, ISBN 978-3-030-42070-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-42071-0_8

Other (1)

Vertex Deletion Parameterized by Elimination Distance and Even Less

Author(s): Michal Wlodarczyk
Published in: Parameterized Complexity News: Newsletter of the Parameterized Complexity Community, Issue Volume 17 number 2, 2021, Page(s) 7-8
Publisher: fpt.wikidot.com