Bart M. P. Jansen

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 117

Top Venues

CoRR

IPEC

ESA

J. Comput. Syst. Sci.

Publications

David Dekker, Bart M. P. Jansen
Kernelization for feedback vertex set via elimination distance to a forest. Discret. Appl. Math. 346 (2024)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations. CoRR (2024)
Benjamin Merlin Bumpus, Bart M. P. Jansen, Jaime Venne
Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond. SWAT (2024)
Bart M. P. Jansen, Michal Wlodarczyk
Optimal Polynomial-Time Compression for Boolean Max CSP. ACM Trans. Comput. Theory 16 (1) (2024)
Huib Donkers, Bart M. P. Jansen
Preprocessing to reduce the search space: Antler structures for feedback vertex set. J. Comput. Syst. Sci. 144 (2024)
Bart M. P. Jansen, Ruben F. A. Verhaegh
Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. SWAT (2024)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. ICALP (2024)
Bart M. P. Jansen, Ruben F. A. Verhaegh
Search-Space Reduction Via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. CoRR (2024)
Bart M. P. Jansen, Céline M. F. Swennenhuis
Steiner Tree Parameterized by Multiway Cut and Even Less. CoRR (2024)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. GD (2) (2023)
Bart M. P. Jansen, Bart van der Steenhoven
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. IPEC (2023)
Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133 (2023)
Bart M. P. Jansen, Bart van der Steenhoven
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. CoRR (2023)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth. CoRR (2023)
Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
-secluded trees faster. J. Comput. Syst. Sci. 138 (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. ISAAC (2023)
Bart M. P. Jansen, Shivesh Kumar Roy
On the Parameterized Complexity of Multiway Near-Separator. CoRR (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. ESA (2023)
Bart M. P. Jansen, Shivesh Kumar Roy
Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs. IPEC (2023)
Lars Jaffke, Bart M. P. Jansen
Fine-grained parameterized complexity analysis of graph coloring problems. Discret. Appl. Math. 327 (2023)
Bart M. P. Jansen, Shivesh Kumar Roy
On the Parameterized Complexity of Multiway Near-Separator. IPEC (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size. CoRR (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Single-Exponential FPT Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes. CoRR (2023)
Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
Finding k-Secluded Trees Faster. WG (2022)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. SIAM J. Discret. Math. 36 (4) (2022)
Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. Algorithmica 84 (11) (2022)
David Dekker, Bart M. P. Jansen
Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. WG (2022)
Bart M. P. Jansen, Michal Wlodarczyk
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. STOC (2022)
Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
Search-Space Reduction via Essential Vertices. ESA (2022)
Bart M. P. Jansen, Michal Wlodarczyk
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. CoRR (2022)
David Dekker, Bart M. P. Jansen
Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. CoRR (2022)
Bart M. P. Jansen, Jari J. H. de Kroon
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies. J. Comput. Syst. Sci. 126 (2022)
Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
Search-Space Reduction via Essential Vertices. CoRR (2022)
Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
Finding k-Secluded Trees Faster. CoRR (2022)
Huib Donkers, Bart M. P. Jansen
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. WG (2021)
Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. IPEC (2021)
Bart M. P. Jansen, Jan Arne Telle
Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation. Algorithmica 83 (8) (2021)
Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
Fine-grained Complexity Analysis of Two Classic TSP Variants. ACM Trans. Algorithms 17 (1) (2021)
Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. SIAM J. Discret. Math. 35 (4) (2021)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Vertex Deletion Parameterized by Elimination Distance and Even Less. CoRR (2021)
Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk
On the Hardness of Compressing Weights. MFCS (2021)
Bart M. P. Jansen, Jari J. H. de Kroon
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. CoRR (2021)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Vertex deletion parameterized by elimination distance and even less. STOC (2021)
Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk
On the Hardness of Compressing Weights. CoRR (2021)
Huib Donkers, Bart M. P. Jansen
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. CoRR (2021)
Huib Donkers, Bart M. P. Jansen
A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion. J. Comput. Syst. Sci. 119 (2021)
Bart M. P. Jansen, Jari J. H. de Kroon
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. WG (2021)
Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. CoRR (2021)
Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
Sparsification Lower Bounds for List H-Coloring. ISAAC (2020)
Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
Sparsification Lower Bounds for List H-Coloring. CoRR (2020)
Bart M. P. Jansen, Jari J. H. de Kroon
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. SWAT (2020)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. ICALP (2020)
Bart M. P. Jansen
Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds. Treewidth, Kernels, and Algorithms (2020)
Bart M. P. Jansen, Michal Wlodarczyk
Optimal Polynomial-Time Compression for Boolean Max CSP. ESA (2020)
Bart M. P. Jansen, Jari J. H. de Kroon
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. CoRR (2020)
Bart M. P. Jansen, Jules J. H. M. Wulms
Lower bounds for protrusion replacement by counting equivalence classes. Discret. Appl. Math. 278 (2020)
Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. Algorithmica 82 (8) (2020)
Bart M. P. Jansen, Michal Wlodarczyk
Optimal polynomial-time compression for Boolean Max CSP. CoRR (2020)
Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. CoRR (2020)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. CoRR (2020)
Bart M. P. Jansen, Astrid Pieterse
Polynomial kernels for hitting forbidden minors under structural parameterizations. Theor. Comput. Sci. 841 (2020)
Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. J. Graph Algorithms Appl. 24 (3) (2020)
Bart M. P. Jansen, László Kozma, Jesper Nederlof
Hamiltonicity Below Dirac's Condition. WG (2019)
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. CoRR (2019)
Bart M. P. Jansen, Christian Schulz, Hisao Tamaki
Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144). NII Shonan Meet. Rep. 2019 (2019)
Bart M. P. Jansen, Astrid Pieterse
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. ACM Trans. Comput. Theory 11 (4) (2019)
Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. STACS (2019)
Bart M. P. Jansen, László Kozma, Jesper Nederlof
Hamiltonicity below Dirac's condition. CoRR (2019)
Huib Donkers, Bart M. P. Jansen
A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free Deletion. WG (2019)
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. ESA (2019)
Bart M. P. Jansen, Astrid Pieterse
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. Algorithmica 81 (10) (2019)
Huib Donkers, Bart M. P. Jansen
A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion. CoRR (2019)
Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. Algorithmica 81 (10) (2019)
Bart M. P. Jansen, Jesper Nederlof
Computing the chromatic number using graph decompositions via matrix rank. Theor. Comput. Sci. 795 (2019)
Bart M. P. Jansen, Astrid Pieterse
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. CoRR (2018)
Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs. CoRR (2018)
Bart M. P. Jansen, Jesper Nederlof
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. CoRR (2018)
Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. IPEC (2018)
Bart M. P. Jansen, Marcin Pilipczuk
Approximation and Kernelization for Chordal Vertex Deletion. SIAM J. Discret. Math. 32 (3) (2018)
Bart M. P. Jansen, Astrid Pieterse
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. ESA (2018)
Bart M. P. Jansen, Jesper Nederlof
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. ESA (2018)
Bart M. P. Jansen, Astrid Pieterse
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. CoRR (2018)
Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
Best-case and Worst-case Sparsifiability of Boolean CSPs. CoRR (2018)
Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
Independent-set reconfiguration thresholds of hereditary graph classes. Discret. Appl. Math. 250 (2018)
Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. CoRR (2018)
Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. IPEC (2018)
Bart M. P. Jansen
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. J. Graph Algorithms Appl. 21 (2) (2017)
Bart M. P. Jansen
Turing kernelization for finding long paths and cycles in restricted graph classes. J. Comput. Syst. Sci. 85 (2017)
Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. CoRR (2017)
Bart M. P. Jansen, Astrid Pieterse
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. Algorithmica 79 (1) (2017)
Bart M. P. Jansen, Marcin Pilipczuk
Approximation and Kernelization for Chordal Vertex Deletion. SODA (2017)
Lars Jaffke, Bart M. P. Jansen
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CoRR (2017)
Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms 13 (3) (2017)
Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. IPEC (2017)
Lars Jaffke, Bart M. P. Jansen
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CIAC (2017)
Bart M. P. Jansen, Astrid Pieterse
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. IPEC (2017)
Bart M. P. Jansen, Astrid Pieterse
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. MFCS (2016)
Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
Independent Set Reconfiguration Thresholds of Hereditary Graph Classes. CoRR (2016)
Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. FSTTCS (2016)
Bart M. P. Jansen
Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. STACS (2016)

Bart M. P. Jansen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bart M. P. Jansen