default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBart M. P. Jansen
Person information
- affiliation: Eindhoven University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j44]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. J. Comput. Syst. Sci. 148: 103597 (2025)- [j43]Bart M. P. Jansen, Bart van der Steenhoven:
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. J. Graph Algorithms Appl. 29(1): 1-28 (2025) - [j42]Bart M. P. Jansen, Michal Wlodarczyk:
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. SIAM J. Comput. 54(1): 1-91 (2025) - 2024
- [j41]David Dekker, Bart M. P. Jansen:
Kernelization for feedback vertex set via elimination distance to a forest. Discret. Appl. Math. 346: 192-214 (2024) - [j40]Huib Donkers, Bart M. P. Jansen:
Preprocessing to reduce the search space: Antler structures for feedback vertex set. J. Comput. Syst. Sci. 144: 103532 (2024) - [j39]Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon:
Search-Space Reduction via Essential Vertices. SIAM J. Discret. Math. 38(3): 2392-2415 (2024) - [j38]Bart M. P. Jansen, Michal Wlodarczyk:
Optimal Polynomial-Time Compression for Boolean Max CSP. ACM Trans. Comput. Theory 16(1): 4:1-4:20 (2024) - [c65]Bart M. P. Jansen, Céline M. F. Swennenhuis:
Steiner Tree Parameterized by Multiway Cut and Even Less. ESA 2024: 76:1-76:16 - [c64]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. ICALP 2024: 33:1-33:20 - [c63]Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, Ruben F. A. Verhaegh:
Preprocessing to Reduce the Search Space for Odd Cycle Transversal. IPEC 2024: 15:1-15:18 - [c62]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: 19:1-19:16 - [c61]Bart M. P. Jansen, Ruben F. A. Verhaegh:
Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. SWAT 2024: 28:1-28:17 - [i57]Bart M. P. Jansen, Ruben F. A. Verhaegh:
Search-Space Reduction Via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. CoRR abs/2404.09769 (2024) - [i56]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations. CoRR abs/2404.16695 (2024) - [i55]Bart M. P. Jansen, Céline M. F. Swennenhuis:
Steiner Tree Parameterized by Multiway Cut and Even Less. CoRR abs/2406.19819 (2024) - [i54]Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, Ruben F. A. Verhaegh:
Preprocessing to Reduce the Search Space for Odd Cycle Transversal. CoRR abs/2409.00245 (2024) - 2023
- [j37]Lars Jaffke, Bart M. P. Jansen:
Fine-grained parameterized complexity analysis of graph coloring problems. Discret. Appl. Math. 327: 33-46 (2023) - [j36]Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström:
p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133: 23-40 (2023) - [j35]Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon:
Finding k-secluded trees faster. J. Comput. Syst. Sci. 138: 103461 (2023) - [j34]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. ACM Trans. Comput. Theory 15(3-4): 8:1-8:23 (2023) - [c60]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: 66:1-66:16 - [c59]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: 203-217 - [c58]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: 42:1-42:18 - [c57]Bart M. P. Jansen, Bart van der Steenhoven:
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. IPEC 2023: 27:1-27:15 - [c56]Bart M. P. Jansen, Shivesh Kumar Roy:
On the Parameterized Complexity of Multiway Near-Separator. IPEC 2023: 28:1-28:18 - [c55]Bart M. P. Jansen, Shivesh Kumar Roy:
Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs. IPEC 2023: 29:1-29:13 - [i53]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 abs/2306.17065 (2023) - [i52]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 abs/2309.01264 (2023) - [i51]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 abs/2309.11366 (2023) - [i50]Bart M. P. Jansen, Bart van der Steenhoven:
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. CoRR abs/2310.04303 (2023) - [i49]Bart M. P. Jansen, Shivesh Kumar Roy:
On the Parameterized Complexity of Multiway Near-Separator. CoRR abs/2310.04332 (2023) - 2022
- [j33]Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk:
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. Algorithmica 84(11): 3407-3458 (2022) - [j32]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: 59-79 (2022) - [j31]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): 2737-2773 (2022) - [c54]Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon:
Search-Space Reduction via Essential Vertices. ESA 2022: 30:1-30:15 - [c53]Bart M. P. Jansen, Michal Wlodarczyk:
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. STOC 2022: 900-913 - [c52]David Dekker, Bart M. P. Jansen:
Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. WG 2022: 158-172 - [c51]Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon:
Finding k-Secluded Trees Faster. WG 2022: 173-186 - [i48]Bart M. P. Jansen, Michal Wlodarczyk:
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. CoRR abs/2202.02174 (2022) - [i47]David Dekker, Bart M. P. Jansen:
Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. CoRR abs/2206.04387 (2022) - [i46]Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon:
Finding k-Secluded Trees Faster. CoRR abs/2206.09884 (2022) - [i45]Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon:
Search-Space Reduction via Essential Vertices. CoRR abs/2207.00386 (2022) - 2021
- [j30]Bart M. P. Jansen, Jan Arne Telle:
Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation. Algorithmica 83(8): 2469-2470 (2021) - [j29]Huib Donkers, Bart M. P. Jansen:
A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion. J. Comput. Syst. Sci. 119: 164-182 (2021) - [j28]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): 2387-2429 (2021) - [j27]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): 5:1-5:29 (2021) - [c50]Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk:
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. IPEC 2021: 14:1-14:18 - [c49]Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk:
On the Hardness of Compressing Weights. MFCS 2021: 64:1-64:21 - [c48]Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
Vertex deletion parameterized by elimination distance and even less. STOC 2021: 1757-1769 - [c47]Huib Donkers, Bart M. P. Jansen:
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. WG 2021: 1-14 - [c46]Bart M. P. Jansen, Jari J. H. de Kroon:
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. WG 2021: 80-93 - [i44]Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
Vertex Deletion Parameterized by Elimination Distance and Even Less. CoRR abs/2103.09715 (2021) - [i43]Bart M. P. Jansen, Jari J. H. de Kroon:
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. CoRR abs/2106.04191 (2021) - [i42]Huib Donkers, Bart M. P. Jansen:
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. CoRR abs/2106.11675 (2021) - [i41]Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk:
On the Hardness of Compressing Weights. CoRR abs/2107.02554 (2021) - [i40]Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk:
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. CoRR abs/2110.01868 (2021) - 2020
- [j26]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. Algorithmica 82(8): 2200-2242 (2020) - [j25]Bart M. P. Jansen, Jules J. H. M. Wulms:
Lower bounds for protrusion replacement by counting equivalence classes. Discret. Appl. Math. 278: 12-27 (2020) - [j24]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): 461-482 (2020) - [j23]Bart M. P. Jansen, Astrid Pieterse:
Polynomial kernels for hitting forbidden minors under structural parameterizations. Theor. Comput. Sci. 841: 124-166 (2020) - [c45]Bart M. P. Jansen:
Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds. Treewidth, Kernels, and Algorithms 2020: 89-111 - [c44]Bart M. P. Jansen, Michal Wlodarczyk:
Optimal Polynomial-Time Compression for Boolean Max CSP. ESA 2020: 63:1-63:19 - [c43]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. ICALP 2020: 16:1-16:19 - [c42]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. ISAAC 2020: 58:1-58:17 - [c41]Bart M. P. Jansen, Jari J. H. de Kroon:
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. SWAT 2020: 27:1-27:15 - [i39]Bart M. P. Jansen, Michal Wlodarczyk:
Optimal polynomial-time compression for Boolean Max CSP. CoRR abs/2002.03443 (2020) - [i38]Bart M. P. Jansen, Jari J. H. de Kroon:
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. CoRR abs/2004.08818 (2020) - [i37]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. CoRR abs/2004.12865 (2020) - [i36]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 abs/2009.08158 (2020) - [i35]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. CoRR abs/2009.08353 (2020)
2010 – 2019
- 2019
- [j22]Bart M. P. Jansen, Astrid Pieterse:
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. Algorithmica 81(10): 3865-3889 (2019) - [j21]Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. Algorithmica 81(10): 3936-3967 (2019) - [j20]Bart M. P. Jansen, Jesper Nederlof:
Computing the chromatic number using graph decompositions via matrix rank. Theor. Comput. Sci. 795: 520-539 (2019) - [j19]Bart M. P. Jansen, Astrid Pieterse:
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. ACM Trans. Comput. Theory 11(4): 28:1-28:26 (2019) - [c40]É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: 23:1-23:14 - [c39]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: 39:1-39:18 - [c38]Bart M. P. Jansen, László Kozma, Jesper Nederlof:
Hamiltonicity Below Dirac's Condition. WG 2019: 27-39 - [c37]Huib Donkers, Bart M. P. Jansen:
A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free Deletion. WG 2019: 106-119 - [e1]Bart M. P. Jansen, Jan Arne Telle:
14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany. LIPIcs 148, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-129-0 [contents] - [i34]Bart M. P. Jansen, László Kozma, Jesper Nederlof:
Hamiltonicity below Dirac's condition. CoRR abs/1902.01745 (2019) - [i33]Huib Donkers, Bart M. P. Jansen:
A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion. CoRR abs/1906.05565 (2019) - [i32]Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik:
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. CoRR abs/1908.09325 (2019) - [i31]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) - 2018
- [j18]Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent-set reconfiguration thresholds of hereditary graph classes. Discret. Appl. Math. 250: 165-182 (2018) - [j17]Bart M. P. Jansen, Marcin Pilipczuk:
Approximation and Kernelization for Chordal Vertex Deletion. SIAM J. Discret. Math. 32(3): 2258-2301 (2018) - [c36]Bart M. P. Jansen, Jesper Nederlof:
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. ESA 2018: 47:1-47:15 - [c35]Bart M. P. Jansen, Astrid Pieterse:
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. ESA 2018: 48:1-48:15 - [c34]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: 3:1-3:14 - [c33]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. IPEC 2018: 15:1-15:13 - [i30]Bart M. P. Jansen, Astrid Pieterse:
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. CoRR abs/1802.02050 (2018) - [i29]Bart M. P. Jansen, Astrid Pieterse:
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. CoRR abs/1804.08885 (2018) - [i28]Bart M. P. Jansen, Jesper Nederlof:
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. CoRR abs/1806.10501 (2018) - [i27]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 abs/1806.10513 (2018) - [i26]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-case and Worst-case Sparsifiability of Boolean CSPs. CoRR abs/1809.06171 (2018) - [i25]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 abs/1810.01136 (2018) - 2017
- [j16]Bart M. P. Jansen, Astrid Pieterse:
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. Algorithmica 79(1): 3-28 (2017) - [j15]Bart M. P. Jansen:
Turing kernelization for finding long paths and cycles in restricted graph classes. J. Comput. Syst. Sci. 85: 18-37 (2017) - [j14]Bart M. P. Jansen:
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. J. Graph Algorithms Appl. 21(2): 219-243 (2017) - [j13]Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms 13(3): 35:1-35:35 (2017) - [c32]Lars Jaffke, Bart M. P. Jansen:
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CIAC 2017: 345-356 - [c31]Bart M. P. Jansen, Astrid Pieterse:
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. IPEC 2017: 22:1-22:12 - [c30]Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. IPEC 2017: 23:1-23:13 - [c29]Bart M. P. Jansen, Marcin Pilipczuk:
Approximation and Kernelization for Chordal Vertex Deletion. SODA 2017: 1399-1418 - [i24]Lars Jaffke, Bart M. P. Jansen:
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CoRR abs/1701.06985 (2017) - [i23]Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. CoRR abs/1707.01797 (2017) - 2016
- [c28]Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. FSTTCS 2016: 34:1-34:15 - [c27]Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger:
Fine-Grained Complexity Analysis of Two Classic TSP Variants. ICALP 2016: 5:1-5:14 - [c26]Bart M. P. Jansen, Jules J. H. M. Wulms:
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. IPEC 2016: 17:1-17:12 - [c25]Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond:
The First Parameterized Algorithms and Computational Experiments Challenge. IPEC 2016: 30:1-30:9 - [c24]Bart M. P. Jansen, Astrid Pieterse:
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. MFCS 2016: 71:1-71:14 - [c23]Bart M. P. Jansen:
Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. STACS 2016: 45:1-45:13 - [i22]Bart M. P. Jansen, Marcin Pilipczuk:
Approximation and Kernelization for Chordal Vertex Deletion. CoRR abs/1605.03001 (2016) - [i21]Bart M. P. Jansen, Astrid Pieterse:
Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials. CoRR abs/1606.03233 (2016) - [i20]Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger:
Fine-Grained Complexity Analysis of Two Classic TSP Variants. CoRR abs/1607.02725 (2016) - [i19]Bart M. P. Jansen, Jules J. H. M. Wulms:
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. CoRR abs/1609.09304 (2016) - [i18]Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent Set Reconfiguration Thresholds of Hereditary Graph Classes. CoRR abs/1610.03766 (2016) - 2015
- [j12]Bart M. P. Jansen:
On Sparsification for Computing Treewidth. Algorithmica 71(3): 605-635 (2015) - [c22]Bart M. P. Jansen, Stefan Kratsch:
A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity. ESA 2015: 779-791 - [c21]Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) 2015: 629-641 - [c20]Bart M. P. Jansen, Astrid Pieterse:
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. IPEC 2015: 163-174 - [c19]Bart M. P. Jansen, Dániel Marx:
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. SODA 2015: 616-629 - [c18]Bart M. P. Jansen:
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. WG 2015: 472-486 - [i17]Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. CoRR abs/1502.03965 (2015) - [i16]Bart M. P. Jansen, Stefan Kratsch:
A structural approach to kernels for ILPs: Treewidth and Total Unimodularity. CoRR abs/1506.07729 (2015) - [i15]Bart M. P. Jansen:
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. CoRR abs/1507.05890 (2015) - [i14]Bart M. P. Jansen, Astrid Pieterse:
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. CoRR abs/1509.07437 (2015) - 2014
- [j11]Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk:
Preprocessing subgraph and minor problems: When does a small vertex cover help? J. Comput. Syst. Sci. 80(2): 468-495 (2014) - [j10]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernelization Lower Bounds by Cross-Composition. SIAM J. Discret. Math. 28(1): 277-305 (2014) - [j9]Michael R. Fellows, Bart M. P. Jansen:
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. ACM Trans. Comput. Theory 6(4): 16:1-16:26 (2014) - [c17]Bart M. P. Jansen:
Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes. ESA 2014: 579-591 - [c16]Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
A Near-Optimal Planarization Algorithm. SODA 2014: 1802-1811 - [i13]Bart M. P. Jansen:
Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes. CoRR abs/1402.4718 (2014) - [i12]Bart M. P. Jansen, Dániel Marx:
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. CoRR abs/1410.0855 (2014) - 2013
- [j8]Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond:
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34(3): 541-566 (2013) - [j7]Bart M. P. Jansen, Stefan Kratsch:
Data reduction for graph coloring problems. Inf. Comput. 231: 70-88 (2013) - [j6]Bart M. P. Jansen, Hans L. Bodlaender:
Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. Theory Comput. Syst. 53(2): 263-299 (2013) - [j5]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. SIAM J. Discret. Math. 27(4): 2108-2142 (2013) - [j4]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel bounds for path and cycle problems. Theor. Comput. Sci. 511: 117-136 (2013) - [j3]Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger:
Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. 511: 172-180 (2013) - [c15]Bart M. P. Jansen:
On Sparsification for Computing Treewidth. IPEC 2013: 216-229 - [c14]Michael R. Fellows, Bart M. P. Jansen:
FPT Is Characterized by Useful Obstruction Sets. WG 2013: 261-273 - [i11]Michael R. Fellows, Bart M. P. Jansen:
FPT is Characterized by Useful Obstruction Sets. CoRR abs/1305.3102 (2013) - [i10]Bart M. P. Jansen:
On Sparsification for Computing Treewidth. CoRR abs/1308.3665 (2013) - 2012
- [j2]Bart M. P. Jansen:
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. J. Graph Algorithms Appl. 16(4): 811-846 (2012) - [c13]Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk:
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? IPEC 2012: 97-108 - [c12]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Structural Parameterizations of Pathwidth. SWAT 2012: 352-363 - [i9]Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk:
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? CoRR abs/1206.4912 (2012) - [i8]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernelization Lower Bounds By Cross-Composition. CoRR abs/1206.5941 (2012) - [i7]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Structural Parameterizations of Pathwidth. CoRR abs/1207.4900 (2012) - 2011
- [j1]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:
Connect the dot: Computing feed-links for network extension. J. Spatial Inf. Sci. 3(1): 3-31 (2011) - [c11]Bart M. P. Jansen, Stefan Kratsch:
Data Reduction for Graph Coloring Problems. FCT 2011: 90-101 - [c10]Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger:
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT 2011: 240-251 - [c9]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ICALP (1) 2011: 437-448 - [c8]Bart M. P. Jansen, Stefan Kratsch:
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. IPEC 2011: 132-144 - [c7]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Path and Cycle Problems. IPEC 2011: 145-158 - [c6]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS 2011: 165-176 - [c5]Bart M. P. Jansen, Hans L. Bodlaender:
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. STACS 2011: 177-188 - [i6]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. CoRR abs/1104.4217 (2011) - [i5]Bart M. P. Jansen, Stefan Kratsch:
Data Reduction for Graph Coloring Problems. CoRR abs/1104.4229 (2011) - [i4]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Path and Cycle Problems. CoRR abs/1106.4141 (2011) - [i3]Bart M. P. Jansen, Stefan Kratsch:
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. CoRR abs/1107.3658 (2011) - 2010
- [c4]Bart M. P. Jansen:
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. CIAC 2010: 192-203 - [c3]Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh:
Determining the Winner of a Dodgson Election is Hard. FSTTCS 2010: 459-468 - [c2]Bart M. P. Jansen:
Polynomial Kernels for Hard Problems on Disk Graphs. SWAT 2010: 310-321 - [i2]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Cross-Composition: A New Technique for Kernelization Lower Bounds. CoRR abs/1011.4224 (2010) - [i1]Bart M. P. Jansen, Hans L. Bodlaender:
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. CoRR abs/1012.4701 (2010)
2000 – 2009
- 2008
- [c1]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:
Feed-links for network extensions. GIS 2008: 35
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-03 00:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
