Bart M. P. Jansen

According to our database, Bart M. P. Jansen authored at least 81 papers between 2008 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2025

An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange.

Bart M. P. Jansen, Jeroen S. K. Lamme, Ruben F. A. Verhaegh

CoRR, September, 2025

The Richness of CSP Non-redundancy.

Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen, Victor Lagerkvist, Magnus Wahlström

CoRR, July, 2025

2024

Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion.

Bart M. P. Jansen, Ruben F. A. Verhaegh

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond.

Benjamin Merlin Bumpus, Bart M. P. Jansen, Jaime Venne

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Preprocessing to Reduce the Search Space for Odd Cycle Transversal.

Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, Ruben F. A. Verhaegh

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations.

Marin Bougeret, Bart M. P. Jansen, Ignasi Sau

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Steiner Tree Parameterized by Multiway Cut and Even Less.

Bart M. P. Jansen, Céline M. F. Swennenhuis

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Finding <i>k</i>-secluded trees faster.

Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon

J. Comput. Syst. Sci., December, 2023

<i>p</i>-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms.

Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström

J. Comput. Syst. Sci., May, 2023

Sparsification Lower Bounds for List <i>H</i>-Coloring.

Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski

ACM Trans. Comput. Theory, 2023

5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size.

Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk

CoRR, 2023

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

Bart M. P. Jansen, Bart van der Steenhoven

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs.

Bart M. P. Jansen, Shivesh Kumar Roy

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

On the Parameterized Complexity of Multiway Near-Separator.

Bart M. P. Jansen, Shivesh Kumar Roy

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes.

Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

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

Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size.

Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

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

Marin Bougeret, Bart M. P. Jansen, Ignasi Sau

SIAM J. Discret. Math., December, 2022

Finding k-Secluded Trees Faster.

Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Kernelization for Feedback Vertex Set via Elimination Distance to a Forest.

David Dekker, Bart M. P. Jansen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

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

Bart M. P. Jansen, Michal Wlodarczyk

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Search-Space Reduction via Essential Vertices.

Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation.

Bart M. P. Jansen, Jan Arne Telle

Algorithmica, 2021

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

Bart M. P. Jansen, Jari J. H. de Kroon

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

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

Huib Donkers, Bart M. P. Jansen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Vertex deletion parameterized by elimination distance and even less.

Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

On the Hardness of Compressing Weights.

Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

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

Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms.

Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström

CoRR, 2020

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

Bart M. P. Jansen, Jari J. H. de Kroon

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Sparsification Lower Bounds for List H-Coloring.

Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

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

Marin Bougeret, Bart M. P. Jansen, Ignasi Sau

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Optimal Polynomial-Time Compression for Boolean Max CSP.

Bart M. P. Jansen, Michal Wlodarczyk

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

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

Bart M. P. Jansen

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144).

Bart M. P. Jansen, Christian Schulz, Hisao Tamaki

NII Shonan Meet. Rep., 2019

Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor.

Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna

Algorithmica, 2019

Hamiltonicity Below Dirac's Condition.

Bart M. P. Jansen, László Kozma, Jesper Nederlof

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free Deletion.

Huib Donkers, Bart M. P. Jansen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs.

Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

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

Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth.

Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Best-Case and Worst-Case Sparsifiability of Boolean CSPs.

Hubie Chen, Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations.

Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Computing the Chromatic Number Using Graph Decompositions via Matrix Rank.

Bart M. P. Jansen, Jesper Nederlof

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT.

Bart M. P. Jansen, Astrid Pieterse

Algorithmica, 2017

Approximation and Kernelization for Chordal Vertex Deletion.

Bart M. P. Jansen, Marcin Pilipczuk

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor.

Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials.

Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems.

Lars Jaffke, Bart M. P. Jansen

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight.

Bart M. P. Jansen

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials.

Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Lower Bounds for Protrusion Replacement by Counting Equivalence Classes.

Bart M. P. Jansen, Jules J. H. M. Wulms

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

The First Parameterized Algorithms and Computational Experiments Challenge.

Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Fine-Grained Complexity Analysis of Two Classic TSP Variants.

Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes.

Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.

Bart M. P. Jansen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.

Bart M. P. Jansen, Dániel Marx

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT.

Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Uniform Kernelization Complexity of Hitting Forbidden Minors.

Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity.

Bart M. P. Jansen, Stefan Kratsch

Proceedings of the Algorithms - ESA 2015, 2015

2014

FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.

Michael R. Fellows, Bart M. P. Jansen

ACM Trans. Comput. Theory, 2014

Kernelization Lower Bounds by Cross-Composition.

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch

SIAM J. Discret. Math., 2014

A Near-Optimal Planarization Algorithm.

Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes.

Bart M. P. Jansen

Proceedings of the Algorithms - ESA 2014, 2014

2013

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity.

Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond

Eur. J. Comb., 2013

FPT Is Characterized by Useful Obstruction Sets.

Michael R. Fellows, Bart M. P. Jansen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On Sparsification for Computing Treewidth.

Bart M. P. Jansen

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Kernel Bounds for Structural Parameterizations of Pathwidth.

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?

Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011

Connect the dot: Computing feed-links for network extension.

Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann

J. Spatial Inf. Sci., 2011

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter.

Bart M. P. Jansen, Hans L. Bodlaender

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Cross-Composition: A New Technique for Kernelization Lower Bounds.

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal.

Bart M. P. Jansen, Stefan Kratsch

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Kernel Bounds for Path and Cycle Problems.

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization.

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Data Reduction for Graph Coloring Problems.

Bart M. P. Jansen, Stefan Kratsch

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Parameterized Complexity of Vertex Deletion into Perfect Graph Classes.

Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Polynomial Kernels for Hard Problems on Disk Graphs.

Bart M. P. Jansen

Proceedings of the Algorithm Theory, 2010

Determining the Winner of a Dodgson Election is Hard.

Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights.

Bart M. P. Jansen

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2008

Feed-links for network extensions.

Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jin Luo, Rodrigo I. Silveira, Bettina Speckmann

Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008