Bart M. P. Jansen

172 papers A* 8A 13B 33C 2Journal 104Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Search-space reduction via essential vertices revisited: Vertex multicut and cograph deletion. J. Comput. Syst. Sci. Bart M. P. Jansen, Ruben F. A. Verhaegh
2025	B	`conf`	An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange. IPEC Bart M. P. Jansen, Jeroen S. K. Lamme, Ruben F. A. Verhaegh
2025	J	`jnl`	An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange. CoRR Bart M. P. Jansen, Jeroen S. K. Lamme, Ruben F. A. Verhaegh
2025	J	`jnl`	Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. J. Graph Algorithms Appl. Bart M. P. Jansen, Bart van der Steenhoven
2025	J	`jnl`	Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. SIAM J. Comput. Bart M. P. Jansen, Michal Wlodarczyk
2025	J	`jnl`	Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes. J. Comput. Syst. Sci. Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2025	B	`conf`	Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments. ISAAC Mark de Berg, Bart M. P. Jansen, Jeroen S. K. Lamme
2025	J	`jnl`	Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments. CoRR Mark de Berg, Bart M. P. Jansen, Jeroen S. K. Lamme
2025	J	`jnl`	The Richness of CSP Non-redundancy. CoRR Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen, Victor Lagerkvist, Magnus Wahlström
2024	—	`conf`	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond. SWAT Benjamin Merlin Bumpus, Bart M. P. Jansen, Jaime Venne
2024	A*	`conf`	Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. ICALP Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2024	J	`jnl`	Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations. CoRR Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2024	J	`jnl`	Kernelization for feedback vertex set via elimination distance to a forest. Discret. Appl. Math. David Dekker, Bart M. P. Jansen
2024	J	`jnl`	Optimal Polynomial-Time Compression for Boolean Max CSP. ACM Trans. Comput. Theory Bart M. P. Jansen, Michal Wlodarczyk
2024	B	`conf`	Preprocessing to Reduce the Search Space for Odd Cycle Transversal. IPEC Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, Ruben F. A. Verhaegh
2024	J	`jnl`	Preprocessing to Reduce the Search Space for Odd Cycle Transversal. CoRR Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, Ruben F. A. Verhaegh
2024	J	`jnl`	Preprocessing to reduce the search space: Antler structures for feedback vertex set. J. Comput. Syst. Sci. Huib Donkers, Bart M. P. Jansen
2024	J	`jnl`	Search-Space Reduction Via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. CoRR Bart M. P. Jansen, Ruben F. A. Verhaegh
2024	—	`conf`	Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. SWAT Bart M. P. Jansen, Ruben F. A. Verhaegh
2024	J	`jnl`	Search-Space Reduction via Essential Vertices. SIAM J. Discret. Math. Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
2024	A	`conf`	Steiner Tree Parameterized by Multiway Cut and Even Less. ESA Bart M. P. Jansen, Céline M. F. Swennenhuis
2024	J	`jnl`	Steiner Tree Parameterized by Multiway Cut and Even Less. CoRR Bart M. P. Jansen, Céline M. F. Swennenhuis
2023	J	`jnl`	5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size. CoRR Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2023	A	`conf`	5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. ESA Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2023	J	`jnl`	Finding J. Comput. Syst. Sci. Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
2023	J	`jnl`	Fine-grained parameterized complexity analysis of graph coloring problems. Discret. Appl. Math. Lars Jaffke, Bart M. P. Jansen
2023	B	`conf`	Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. IPEC Bart M. P. Jansen, Bart van der Steenhoven
2023	J	`jnl`	Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. CoRR Bart M. P. Jansen, Bart van der Steenhoven
2023	B	`conf`	On the Parameterized Complexity of Multiway Near-Separator. IPEC Bart M. P. Jansen, Shivesh Kumar Roy
2023	J	`jnl`	On the Parameterized Complexity of Multiway Near-Separator. CoRR Bart M. P. Jansen, Shivesh Kumar Roy
2023	J	`jnl`	Single-Exponential FPT Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes. CoRR Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2023	B	`conf`	Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. ISAAC Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2023	J	`jnl`	Sparsification Lower Bounds for List ACM Trans. Comput. Theory Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2023	B	`conf`	Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs. IPEC Bart M. P. Jansen, Shivesh Kumar Roy
2023	—	`conf`	Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. GD (2) Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023	J	`jnl`	Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth. CoRR Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2022	J	`jnl`	Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. SIAM J. Discret. Math. Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2022	B	`conf`	Finding k-Secluded Trees Faster. WG Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
2022	J	`jnl`	Finding k-Secluded Trees Faster. CoRR Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
2022	B	`conf`	Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. WG David Dekker, Bart M. P. Jansen
2022	J	`jnl`	Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. CoRR David Dekker, Bart M. P. Jansen
2022	J	`jnl`	Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. CoRR Bart M. P. Jansen, Michal Wlodarczyk
2022	A*	`conf`	Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. STOC Bart M. P. Jansen, Michal Wlodarczyk
2022	J	`jnl`	Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. Algorithmica Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
2022	J	`jnl`	Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies. J. Comput. Syst. Sci. Bart M. P. Jansen, Jari J. H. de Kroon
2022	A	`conf`	Search-Space Reduction via Essential Vertices. ESA Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
2022	J	`jnl`	Search-Space Reduction via Essential Vertices. CoRR Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
2021	J	`jnl`	A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. SIAM J. Discret. Math. Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
2021	J	`jnl`	A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion. J. Comput. Syst. Sci. Huib Donkers, Bart M. P. Jansen
2021	B	`conf`	FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. WG Bart M. P. Jansen, Jari J. H. de Kroon
2021	J	`jnl`	FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. CoRR Bart M. P. Jansen, Jari J. H. de Kroon
2021	J	`jnl`	Fine-grained Complexity Analysis of Two Classic TSP Variants. ACM Trans. Algorithms Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
2021	B	`conf`	On the Hardness of Compressing Weights. MFCS Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk
2021	J	`jnl`	On the Hardness of Compressing Weights. CoRR Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk
2021	B	`conf`	Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. IPEC Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
2021	J	`jnl`	Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. CoRR Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
2021	B	`conf`	Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. WG Huib Donkers, Bart M. P. Jansen
2021	J	`jnl`	Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. CoRR Huib Donkers, Bart M. P. Jansen
2021	J	`jnl`	Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation. Algorithmica Bart M. P. Jansen, Jan Arne Telle
2021	J	`jnl`	Vertex Deletion Parameterized by Elimination Distance and Even Less. CoRR Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2021	A*	`conf`	Vertex deletion parameterized by elimination distance and even less. STOC Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2020	J	`jnl`	Best-Case and Worst-Case Sparsifiability of Boolean CSPs. Algorithmica Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
2020	A*	`conf`	Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. ICALP Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2020	J	`jnl`	Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. CoRR Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2020	—	`conf`	Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds. Treewidth, Kernels, and Algorithms Bart M. P. Jansen
2020	J	`jnl`	Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. J. Graph Algorithms Appl. Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel
2020	J	`jnl`	Lower bounds for protrusion replacement by counting equivalence classes. Discret. Appl. Math. Bart M. P. Jansen, Jules J. H. M. Wulms
2020	A	`conf`	Optimal Polynomial-Time Compression for Boolean Max CSP. ESA Bart M. P. Jansen, Michal Wlodarczyk
2020	J	`jnl`	Optimal polynomial-time compression for Boolean Max CSP. CoRR Bart M. P. Jansen, Michal Wlodarczyk
2020	J	`jnl`	Polynomial kernels for hitting forbidden minors under structural parameterizations. Theor. Comput. Sci. Bart M. P. Jansen, Astrid Pieterse
2020	—	`conf`	Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. SWAT Bart M. P. Jansen, Jari J. H. de Kroon
2020	J	`jnl`	Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. CoRR Bart M. P. Jansen, Jari J. H. de Kroon
2020	B	`conf`	Sparsification Lower Bounds for List H-Coloring. ISAAC Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2020	J	`jnl`	Sparsification Lower Bounds for List H-Coloring. CoRR Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2020	J	`jnl`	p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. CoRR Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
2019	B	`ed.`	14th International Symposium on Parameterized and Exact Computation, IPEC 2019, Munich, Germany, September 11-13, 2019 IPEC Bart M. P. Jansen, Jan Arne Telle
2019	A	`conf`	A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. STACS Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
2019	J	`jnl`	A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion. CoRR Huib Donkers, Bart M. P. Jansen
2019	B	`conf`	A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free Deletion. WG Huib Donkers, Bart M. P. Jansen
2019	J	`jnl`	Computing the chromatic number using graph decompositions via matrix rank. Theor. Comput. Sci. Bart M. P. Jansen, Jesper Nederlof
2019	A	`conf`	Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. ESA Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
2019	J	`jnl`	Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. CoRR Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
2019	B	`conf`	Hamiltonicity Below Dirac's Condition. WG Bart M. P. Jansen, László Kozma, Jesper Nederlof
2019	J	`jnl`	Hamiltonicity below Dirac's condition. CoRR Bart M. P. Jansen, László Kozma, Jesper Nederlof
2019	J	`jnl`	Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. Algorithmica Bart M. P. Jansen, Astrid Pieterse
2019	J	`jnl`	Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. ACM Trans. Comput. Theory Bart M. P. Jansen, Astrid Pieterse
2019	J	`jnl`	Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144). NII Shonan Meet. Rep. Bart M. P. Jansen, Christian Schulz, Hisao Tamaki
2019	J	`jnl`	Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. Algorithmica Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
2018	J	`jnl`	A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs. CoRR Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
2018	J	`jnl`	Approximation and Kernelization for Chordal Vertex Deletion. SIAM J. Discret. Math. Bart M. P. Jansen, Marcin Pilipczuk
2018	B	`conf`	Best-Case and Worst-Case Sparsifiability of Boolean CSPs. IPEC Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
2018	J	`jnl`	Best-case and Worst-case Sparsifiability of Boolean CSPs. CoRR Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
2018	A	`conf`	Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. ESA Bart M. P. Jansen, Jesper Nederlof
2018	J	`jnl`	Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. CoRR Bart M. P. Jansen, Jesper Nederlof
2018	J	`jnl`	Independent-set reconfiguration thresholds of hereditary graph classes. Discret. Appl. Math. Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
2018	B	`conf`	Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. IPEC Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel
2018	J	`jnl`	Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. CoRR Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel
2018	J	`jnl`	Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. CoRR Bart M. P. Jansen, Astrid Pieterse
2018	A	`conf`	Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. ESA Bart M. P. Jansen, Astrid Pieterse
2018	J	`jnl`	Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. CoRR Bart M. P. Jansen, Astrid Pieterse
2017	A*	`conf`	Approximation and Kernelization for Chordal Vertex Deletion. SODA Bart M. P. Jansen, Marcin Pilipczuk
2017	C	`conf`	Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CIAC Lars Jaffke, Bart M. P. Jansen
2017	J	`jnl`	Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CoRR Lars Jaffke, Bart M. P. Jansen
2017	J	`jnl`	On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. J. Graph Algorithms Appl. Bart M. P. Jansen
2017	B	`conf`	Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. IPEC Bart M. P. Jansen, Astrid Pieterse
2017	J	`jnl`	Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. Algorithmica Bart M. P. Jansen, Astrid Pieterse
2017	J	`jnl`	Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. CoRR Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
2017	B	`conf`	Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. IPEC Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
2017	J	`jnl`	Turing kernelization for finding long paths and cycles in restricted graph classes. J. Comput. Syst. Sci. Bart M. P. Jansen
2017	J	`jnl`	Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2016	J	`jnl`	Approximation and Kernelization for Chordal Vertex Deletion. CoRR Bart M. P. Jansen, Marcin Pilipczuk
2016	A	`conf`	Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. STACS Bart M. P. Jansen
2016	A*	`conf`	Fine-Grained Complexity Analysis of Two Classic TSP Variants. ICALP Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
2016	J	`jnl`	Fine-Grained Complexity Analysis of Two Classic TSP Variants. CoRR Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
2016	J	`jnl`	Independent Set Reconfiguration Thresholds of Hereditary Graph Classes. CoRR Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
2016	—	`conf`	Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. FSTTCS Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
2016	B	`conf`	Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. IPEC Bart M. P. Jansen, Jules J. H. M. Wulms
2016	J	`jnl`	Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. CoRR Bart M. P. Jansen, Jules J. H. M. Wulms
2016	B	`conf`	Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. MFCS Bart M. P. Jansen, Astrid Pieterse
2016	J	`jnl`	Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials. CoRR Bart M. P. Jansen, Astrid Pieterse
2016	B	`conf`	The First Parameterized Algorithms and Computational Experiments Challenge. IPEC Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond
2015	A	`conf`	A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity. ESA Bart M. P. Jansen, Stefan Kratsch
2015	J	`jnl`	A structural approach to kernels for ILPs: Treewidth and Total Unimodularity. CoRR Bart M. P. Jansen, Stefan Kratsch
2015	A*	`conf`	Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. SODA Bart M. P. Jansen, Dániel Marx
2015	J	`jnl`	On Sparsification for Computing Treewidth. Algorithmica Bart M. P. Jansen
2015	B	`conf`	On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. WG Bart M. P. Jansen
2015	J	`jnl`	On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. CoRR Bart M. P. Jansen
2015	J	`jnl`	Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. CoRR Bart M. P. Jansen, Astrid Pieterse
2015	B	`conf`	Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. IPEC Bart M. P. Jansen, Astrid Pieterse
2015	—	`conf`	Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2015	J	`jnl`	Uniform Kernelization Complexity of Hitting Forbidden Minors. CoRR Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2014	A*	`conf`	A Near-Optimal Planarization Algorithm. SODA Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. CoRR Bart M. P. Jansen, Dániel Marx
2014	J	`jnl`	FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. ACM Trans. Comput. Theory Michael R. Fellows, Bart M. P. Jansen
2014	J	`jnl`	Kernelization Lower Bounds by Cross-Composition. SIAM J. Discret. Math. Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2014	J	`jnl`	Preprocessing subgraph and minor problems: When does a small vertex cover help? J. Comput. Syst. Sci. Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk
2014	A	`conf`	Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes. ESA Bart M. P. Jansen
2014	J	`jnl`	Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes. CoRR Bart M. P. Jansen
2013	J	`jnl`	Data reduction for graph coloring problems. Inf. Comput. Bart M. P. Jansen, Stefan Kratsch
2013	B	`conf`	FPT Is Characterized by Useful Obstruction Sets. WG Michael R. Fellows, Bart M. P. Jansen
2013	J	`jnl`	FPT is Characterized by Useful Obstruction Sets CoRR Michael R. Fellows, Bart M. P. Jansen
2013	J	`jnl`	Kernel bounds for path and cycle problems. Theor. Comput. Sci. Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2013	B	`conf`	On Sparsification for Computing Treewidth. IPEC Bart M. P. Jansen
2013	J	`jnl`	On Sparsification for Computing Treewidth. CoRR Bart M. P. Jansen
2013	J	`jnl`	Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
2013	J	`jnl`	Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. SIAM J. Discret. Math. Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2013	J	`jnl`	Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond
2013	J	`jnl`	Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. Theory Comput. Syst. Bart M. P. Jansen, Hans L. Bodlaender
2012	J	`jnl`	Kernel Bounds for Structural Parameterizations of Pathwidth CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2012	—	`conf`	Kernel Bounds for Structural Parameterizations of Pathwidth. SWAT Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2012	J	`jnl`	Kernelization Lower Bounds By Cross-Composition CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2012	J	`jnl`	Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. J. Graph Algorithms Appl. Bart M. P. Jansen
2012	B	`conf`	Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? IPEC Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk
2012	J	`jnl`	Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? CoRR Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk
2011	J	`jnl`	Connect the dot: Computing feed-links for network extension. J. Spatial Inf. Sci. 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
2011	A	`conf`	Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	J	`jnl`	Data Reduction for Graph Coloring Problems CoRR Bart M. P. Jansen, Stefan Kratsch
2011	B	`conf`	Data Reduction for Graph Coloring Problems. FCT Bart M. P. Jansen, Stefan Kratsch
2011	J	`jnl`	Kernel Bounds for Path and Cycle Problems CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	B	`conf`	Kernel Bounds for Path and Cycle Problems. IPEC Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	J	`jnl`	On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal CoRR Bart M. P. Jansen, Stefan Kratsch
2011	B	`conf`	On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. IPEC Bart M. P. Jansen, Stefan Kratsch
2011	B	`conf`	Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
2011	J	`jnl`	Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	—	`conf`	Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ICALP (1) Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	A	`conf`	Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. STACS Bart M. P. Jansen, Hans L. Bodlaender
2010	J	`jnl`	Cross-Composition: A New Technique for Kernelization Lower Bounds CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2010	—	`conf`	Determining the Winner of a Dodgson Election is Hard. FSTTCS Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh
2010	C	`conf`	Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. CIAC Bart M. P. Jansen
2010	—	`conf`	Polynomial Kernels for Hard Problems on Disk Graphs. SWAT Bart M. P. Jansen
2010	J	`jnl`	Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter CoRR Bart M. P. Jansen, Hans L. Bodlaender
2008	—	`conf`	Feed-links for network extensions. GIS 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