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 (GIS, 2008)

Determining the Winner of a Dodgson Election is Hard. - Michael R. Fellows; Bart M. P. Jansen; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh 001 (FSTTCS, 2010)

Polynomial Kernels for Hard Problems on Disk Graphs. - Bart M. P. Jansen (SWAT, 2010)

On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. - Bart M. P. Jansen; Stefan Kratsch (IPEC, 2011)

Cross-Composition: A New Technique for Kernelization Lower Bounds. - Hans L. Bodlaender; Bart M. P. Jansen; Stefan Kratsch (STACS, 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 008; Rodrigo I. Silveira; Bettina Speckmann (J. Spatial Inf. Sci., 2011)

Kernel Bounds for Structural Parameterizations of Pathwidth. - Hans L. Bodlaender; Bart M. P. Jansen; Stefan Kratsch (SWAT, 2012)

Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. - Bart M. P. Jansen (J. Graph Algorithms Appl., 2012)

FPT Is Characterized by Useful Obstruction Sets. - Michael R. Fellows; Bart M. P. Jansen (WG, 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)

Data reduction for graph coloring problems. - Bart M. P. Jansen; Stefan Kratsch (Inf. Comput., 2013)

Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. - Bart M. P. Jansen; Hans L. Bodlaender (Theory Comput. Syst., 2013)

Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. - Hans L. Bodlaender; Bart M. P. Jansen; Stefan Kratsch (SIAM J. Discret. Math., 2013)

Kernel bounds for path and cycle problems. - Hans L. Bodlaender; Bart M. P. Jansen; Stefan Kratsch (Theor. Comput. Sci., 2013)

Parameterized complexity of vertex deletion into perfect graph classes. - Pinar Heggernes; Pim van 't Hof; Bart M. P. Jansen; Stefan Kratsch; Yngve Villanger (Theor. Comput. Sci., 2013)

A Near-Optimal Planarization Algorithm. - Bart M. P. Jansen; Daniel Lokshtanov; Saket Saurabh 001 (SODA, 2014)

Preprocessing subgraph and minor problems: When does a small vertex cover help? - Fedor V. Fomin; Bart M. P. Jansen; Michal Pilipczuk (J. Comput. Syst. Sci., 2014)

Kernelization Lower Bounds by Cross-Composition. - Hans L. Bodlaender; Bart M. P. Jansen; Stefan Kratsch (SIAM J. Discret. Math., 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)

A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity. - Bart M. P. Jansen; Stefan Kratsch (ESA, 2015)

Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. - Bart M. P. Jansen; Astrid Pieterse (IPEC, 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 (SODA, 2015)

On Sparsification for Computing Treewidth. - Bart M. P. Jansen (Algorithmica, 2015)

The First Parameterized Algorithms and Computational Experiments Challenge. - Holger Dell; Thore Husfeldt; Bart M. P. Jansen; Petteri Kaski; Christian Komusiewicz; Frances A. Rosamond (IPEC, 2016)

Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. - Bart M. P. Jansen (STACS, 2016)

Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. - Bart M. P. Jansen; Marcin Pilipczuk; Marcin Wrochna (IPEC, 2017)

Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. - Bart M. P. Jansen; Astrid Pieterse (Algorithmica, 2017)

Turing kernelization for finding long paths and cycles in restricted graph classes. - Bart M. P. Jansen (J. Comput. Syst. Sci., 2017)

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. - Bart M. P. Jansen (J. Graph Algorithms Appl., 2017)

Uniform Kernelization Complexity of Hitting Forbidden Minors. - Archontia C. Giannopoulou; Bart M. P. Jansen; Daniel Lokshtanov; Saket Saurabh 001 (ACM Trans. Algorithms, 2017)

Independent-set reconfiguration thresholds of hereditary graph classes. - Mark de Berg; Bart M. P. Jansen; Debankur Mukherjee (Discret. Appl. Math., 2018)

Approximation and Kernelization for Chordal Vertex Deletion. - Bart M. P. Jansen; Marcin Pilipczuk (SIAM J. Discret. Math., 2018)

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. - Édouard Bonnet; Yoichi Iwata; Bart M. P. Jansen; Lukasz Kowalik (ESA, 2019)

Hamiltonicity Below Dirac's Condition. - Bart M. P. Jansen; László Kozma 002; Jesper Nederlof (WG, 2019)

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. - Bart M. P. Jansen; Astrid Pieterse (Algorithmica, 2019)

Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. - Bart M. P. Jansen; Marcin Pilipczuk; Marcin Wrochna (Algorithmica, 2019)

Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144). - Bart M. P. Jansen; Christian Schulz 003; Hisao Tamaki (NII Shonan Meet. Rep., 2019)

Computing the chromatic number using graph decompositions via matrix rank. - Bart M. P. Jansen; Jesper Nederlof (Theor. Comput. Sci., 2019)

Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. - Bart M. P. Jansen; Astrid Pieterse (ACM Trans. Comput. Theory, 2019)

Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds. - Bart M. P. Jansen (Treewidth, Kernels, and Algorithms, 2020)

Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. - Marin Bougeret; Bart M. P. Jansen; Ignasi Sau (ICALP, 2020)

Sparsification Lower Bounds for List H-Coloring. - Hubie Chen; Bart M. P. Jansen; Karolina Okrasa; Astrid Pieterse; Pawel Rzazewski (ISAAC, 2020)

Best-Case and Worst-Case Sparsifiability of Boolean CSPs. - Hubie Chen; Bart M. P. Jansen; Astrid Pieterse (Algorithmica, 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)

Lower bounds for protrusion replacement by counting equivalence classes. - Bart M. P. Jansen; Jules J. H. M. Wulms (Discret. Appl. Math., 2020)

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 (J. Graph Algorithms Appl., 2020)

Polynomial kernels for hitting forbidden minors under structural parameterizations. - Bart M. P. Jansen; Astrid Pieterse (Theor. Comput. Sci., 2020)

On the Hardness of Compressing Weights. - Bart M. P. Jansen; Shivesh Kumar Roy; Michal Wlodarczyk 001 (MFCS, 2021)

Vertex deletion parameterized by elimination distance and even less. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (STOC, 2021)

FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. - Bart M. P. Jansen; Jari J. H. de Kroon (WG, 2021)

Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation. - Bart M. P. Jansen; Jan Arne Telle (Algorithmica, 2021)

A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion. - Huib Donkers; Bart M. P. Jansen (J. Comput. Syst. Sci., 2021)

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 (SIAM J. Discret. Math., 2021)

Fine-grained Complexity Analysis of Two Classic TSP Variants. - Mark de Berg; Kevin Buchin; Bart M. P. Jansen; Gerhard J. Woeginger (ACM Trans. Algorithms, 2021)

Finding k-Secluded Trees Faster. - Huib Donkers; Bart M. P. Jansen; Jari J. H. de Kroon (WG, 2022)

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. - Huib Donkers; Bart M. P. Jansen; Michal Wlodarczyk 001 (Algorithmica, 2022)

Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies. - Bart M. P. Jansen; Jari J. H. de Kroon (J. Comput. Syst. Sci., 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., 2022)

5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (ESA, 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 (GD (2), 2023)

On the Parameterized Complexity of Multiway Near-Separator. - Bart M. P. Jansen; Shivesh Kumar Roy (IPEC, 2023)

Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs. - Bart M. P. Jansen; Shivesh Kumar Roy (IPEC, 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 001 (CoRR, 2023)

Fine-grained parameterized complexity analysis of graph coloring problems. - Lars Jaffke; Bart M. P. Jansen (Discret. Appl. Math., 2023)

Sparsification Lower Bounds for List H-Coloring. - Hubie Chen; Bart M. P. Jansen; Karolina Okrasa; Astrid Pieterse; Pawel Rzazewski (ACM Trans. Comput. Theory, 2023)

p-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., 2023)

Finding k-secluded trees faster. - Huib Donkers; Bart M. P. Jansen; Jari J. H. de Kroon (J. Comput. Syst. Sci., 2023)

Steiner Tree Parameterized by Multiway Cut and Even Less. - Bart M. P. Jansen; Céline M. F. Swennenhuis (ESA, 2024)

Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. - Marin Bougeret; Bart M. P. Jansen; Ignasi Sau (ICALP, 2024)

Preprocessing to Reduce the Search Space for Odd Cycle Transversal. - Bart M. P. Jansen; Yosuke Mizutani; Blair D. Sullivan; Ruben F. A. Verhaegh (IPEC, 2024)

Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond. - Benjamin Merlin Bumpus; Bart M. P. Jansen; Jaime Venne (SWAT, 2024)

Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. - Bart M. P. Jansen; Ruben F. A. Verhaegh (SWAT, 2024)

Kernelization for feedback vertex set via elimination distance to a forest. - David Dekker; Bart M. P. Jansen (Discret. Appl. Math., 2024)

Preprocessing to reduce the search space: Antler structures for feedback vertex set. - Huib Donkers; Bart M. P. Jansen (J. Comput. Syst. Sci., 2024)

Search-Space Reduction via Essential Vertices. - Benjamin Merlin Bumpus; Bart M. P. Jansen; Jari J. H. de Kroon (SIAM J. Discret. Math., 2024)

Optimal Polynomial-Time Compression for Boolean Max CSP. - Bart M. P. Jansen; Michal Wlodarczyk 001 (ACM Trans. Comput. Theory, 2024)

Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (J. Comput. Syst. Sci., 2025)

Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. - Bart M. P. Jansen; Bart van der Steenhoven (J. Graph Algorithms Appl., 2025)

Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. - Bart M. P. Jansen; Michal Wlodarczyk 001 (SIAM J. Comput., 2025)

The Richness of CSP Non-redundancy. - Joshua Brakensiek; Venkatesan Guruswami; Bart M. P. Jansen; Victor Lagerkvist; Magnus Wahlström (CoRR, 2025)