| 2026 | WG | Parameterized Complexity of Power Network Design: Coordinating Cable Placement Is Hard. | Thekla Hamm, Bart M. P. Jansen, Faezeh Motiei |
| 2025 | ISAAC | Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments. | Mark de Berg, Bart M. P. Jansen, Jeroen S. K. Lamme |
| 2024 | ESA | Steiner Tree Parameterized by Multiway Cut and Even Less. | Bart M. P. Jansen, Cline M. F. Swennenhuis |
| 2024 | ICALP | Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. | Marin Bougeret, Bart M. P. Jansen, Ignasi Sau |
| 2023 | ESA | 5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. | Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk |
| 2023 | GD | 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 |
| 2023 | ISAAC | 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 |
| 2022 | ESA | Search-Space Reduction via Essential Vertices. | Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon |
| 2022 | STOC | Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. | Bart M. P. Jansen, Michal Wlodarczyk |
| 2022 | WG | Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. | David Dekker, Bart M. P. Jansen |
| 2022 | WG | Finding k-Secluded Trees Faster. | Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon |
| 2021 | MFCS | On the Hardness of Compressing Weights. | Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk |
| 2021 | STOC | Vertex deletion parameterized by elimination distance and even less. | Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk |
| 2021 | WG | Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. | Huib Donkers, Bart M. P. Jansen |
| 2021 | WG | FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. | Bart M. P. Jansen, Jari J. H. de Kroon |
| 2020 | ESA | Optimal Polynomial-Time Compression for Boolean Max CSP. | Bart M. P. Jansen, Michal Wlodarczyk |
| 2020 | ICALP | Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. | Marin Bougeret, Bart M. P. Jansen, Ignasi Sau |
| 2020 | ISAAC | Sparsification Lower Bounds for List H-Coloring. | Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski |
| 2019 | ESA | Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. | douard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik |
| 2019 | STACS | 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 |
| 2019 | WG | A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free Deletion. | Huib Donkers, Bart M. P. Jansen |
| 2019 | WG | Hamiltonicity Below Dirac's Condition. | Bart M. P. Jansen, Lszl Kozma, Jesper Nederlof |
| 2018 | ESA | Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. | Bart M. P. Jansen, Jesper Nederlof |
| 2018 | ESA | Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. | Bart M. P. Jansen, Astrid Pieterse |
| 2017 | CIAC | Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. | Lars Jaffke, Bart M. P. Jansen |
| 2017 | SODA | Approximation and Kernelization for Chordal Vertex Deletion. | Bart M. P. Jansen, Marcin Pilipczuk |
| 2016 | ICALP | Fine-Grained Complexity Analysis of Two Classic TSP Variants. | Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger |
| 2016 | MFCS | Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. | Bart M. P. Jansen, Astrid Pieterse |
| 2016 | STACS | Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. | Bart M. P. Jansen |
| 2015 | ESA | A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity. | Bart M. P. Jansen, Stefan Kratsch |
| 2015 | ICALP | Uniform Kernelization Complexity of Hitting Forbidden Minors. | Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh |
| 2015 | SODA | Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. | Bart M. P. Jansen, Dniel Marx |
| 2015 | WG | On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. | Bart M. P. Jansen |
| 2014 | ESA | Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes. | Bart M. P. Jansen |
| 2014 | SODA | A Near-Optimal Planarization Algorithm. | Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh |
| 2013 | WG | FPT Is Characterized by Useful Obstruction Sets. | Michael R. Fellows, Bart M. P. Jansen |
| 2011 | FCT | Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. | Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger |
| 2011 | FCT | Data Reduction for Graph Coloring Problems. | Bart M. P. Jansen, Stefan Kratsch |
| 2011 | ICALP | Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
| 2011 | STACS | Cross-Composition: A New Technique for Kernelization Lower Bounds. | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
| 2011 | STACS | Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. | Bart M. P. Jansen, Hans L. Bodlaender |
| 2010 | CIAC | Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. | Bart M. P. Jansen |