Rigorous Search Space Reduction

Informazioni relative al progetto

ReduceSearch

ID dell’accordo di sovvenzione: 803421

DOI

10.3030/803421

Progetto chiuso

Data della firma CE 4 Settembre 2018

Data di avvio 1 Gennaio 2019

Data di completamento 31 Dicembre 2023

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 473 020,00

Contributo UE

€ 1 473 020,00

Coordinato da

TECHNISCHE UNIVERSITEIT EINDHOVEN
Netherlands

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Thesis and dissertations (1)

Parameterized Graph Modification Beyond the Natural Parameter

Autori: Jari J. H. de Kroon
Pubblicato in: 2023
Editore: Eindhoven University of Technology

Peer reviewed articles (6)

Finding k-secluded trees faster

Autori: Huib Donkers; Bart M.P. Jansen; Jari J.H. de Kroon
Pubblicato in: Journal of Computer and System Sciences, Numero 138, 2023, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2023.05.006

Edge Exploration of Temporal Graphs

Autori: Benjamin Merlin Bumpus, Kitty Meeks
Pubblicato in: Algorithmica, 2022, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-022-01018-7

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

Autori: Bart M. P. Jansen, Jari J. H. de Kroon
Pubblicato in: Journal of Computer and System Sciences, Numero 126, 2022, Pagina/e 59--79, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2021.12.003

Spined categories: generalizing tree-width beyond graphs

Autori: Benjamin Merlin Bumpus, Zoltan A. Kocsis
Pubblicato in: European Journal of Combinatorics, Numero 114, 2023, Pagina/e 103794, ISSN 0195-6698
Editore: Academic Press
DOI: 10.1016/j.ejc.2023.103794

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

Autori: Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Pubblicato in: Algorithmica, Numero 84, 2022, Pagina/e 3407--3458, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-022-00984-2

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

Autori: Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 36, 2022, Pagina/e 2737--2773, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/21m1400766

Conference proceedings (19)

Kernelization for Feedback Vertex Set via Elimination Distance to a Forest

Autori: David Dekker, Bart M. P. Jansen
Pubblicato in: Proceedings of the 48th 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022, Numero 13453, 2022, Pagina/e 158--172
Editore: Springer
DOI: 10.1007/978-3-031-15914-5_12

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

Autori: Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Pubblicato in: Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Numero 214, 2021, Pagina/e 14:1--14:18
Editore: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.ipec.2021.14

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

Autori: Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Pubblicato in: Proceedings of the 31th International Symposium on Graph Drawing and Network Visualization, GD 2023, Numero 14466, 2023, Pagina/e 203–217
Editore: 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

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

Optimal Polynomial-Time Compression for Boolean Max CSP

Autori: Bart M. P. Jansen, Michal Wlodarczyk
Pubblicato in: Proceedings of the 28th Annual European Symposium on Algorithms, ESA 2020, Numero 173, 2020, Pagina/e 63:1--63:19, ISBN 978-3-95977-162-7
Editore: 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

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

On the Parameterized Complexity of Multiway Near-Separator

Autori: Jansen, Bart M. P.; Roy, Shivesh K.
Pubblicato in: Proceedings of the 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Numero 285, 2023, Pagina/e 28:1–28:18
Editore: LIPICS
DOI: 10.4230/lipics.ipec.2023.28

Finding k-Secluded Trees Faster

Autori: Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
Pubblicato in: Proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022, Numero 13453, 2022, Pagina/e 173--186
Editore: Springer
DOI: 10.1007/978-3-031-15914-5_13

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

Autori: Edouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
Pubblicato in: Proceedings of the 27th Annual European Symposium on Algorithms, ESA 2019, Numero 144, 2019, Pagina/e 23:1--23:14, ISBN 978-3-95977-124-5
Editore: 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

Autori: Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Pubblicato in: Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Numero 168, 2020, Pagina/e 16:1--16:19, ISBN 978-3-95977-138-2
Editore: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.icalp.2020.16

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

Autori: Bart M. P. Jansen, Jari J. H. de Kroon
Pubblicato in: Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, Numero 162, 2020, Pagina/e 27:1--27:15, ISBN 978-3-95977-150-4
Editore: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.swat.2020.27

Vertex deletion parameterized by elimination distance and even less

Autori: Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk
Pubblicato in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Pagina/e 1757-1769, ISBN 9781450380539
Editore: ACM
DOI: 10.1145/3406325.3451068

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

Autori: Bart M. P. Jansen, Michał Włodarczyk
Pubblicato in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC'22, 2022, Pagina/e 900--913
Editore: ACM
DOI: 10.1145/3519935.3520021

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

Autori: Bart M. P. Jansen, Jari J. H. de Kroon
Pubblicato in: Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2021, 2021, Pagina/e 80-93
Editore: Springer
DOI: 10.1007/978-3-030-86838-3_6

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

Autori: Jansen, Bart M. P.; van der Steenhoven, Bart
Pubblicato in: Proceedings of the 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Numero 285, 2023, Pagina/e 27:1–27:15
Editore: LIPICS
DOI: 10.4230/lipics.ipec.2023.27

Search-Space Reduction via Essential Vertices

Autori: Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
Pubblicato in: Proceedings of the 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Pagina/e 244
Editore: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.esa.2022.30

On the hardness of compressing weights

Autori: Bart M. P. Jansen, Shivesh K. Roy, Michal Wlodarczyk
Pubblicato in: Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, Numero 202, 2021, Pagina/e 64:1–64:21, ISBN 978-3-95977-201-3
Editore: 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

Autori: Huib Donkers, Bart M. P. Jansen
Pubblicato in: Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2021, 2021, Pagina/e 1-14
Editore: Springer
DOI: 10.1007/978-3-030-86838-3_1

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

Autori: Bart M. P. Jansen, Shivesh K. Roy
Pubblicato in: 2023
Editore: 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

Autori: Bart M. P. Jansen
Pubblicato in: Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, Numero 12160, 2020, Pagina/e 89-111, ISBN 978-3-030-42070-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-42071-0_8

Other (1)

Vertex Deletion Parameterized by Elimination Distance and Even Less

Autori: Michal Wlodarczyk
Pubblicato in: Parameterized Complexity News: Newsletter of the Parameterized Complexity Community, Numero Volume 17 number 2, 2021, Pagina/e 7-8
Editore: fpt.wikidot.com