×

zbMATH — the first resource for mathematics

Jansen, Bart M. P.

Compute Distance To:
Author ID: jansen.bart-m-p Recent zbMATH articles by "Jansen, Bart M. P."
Published as: Jansen, Bart; Jansen, Bart M. P.
External Links: MGP · Wikidata
Documents Indexed: 60 Publications since 2005, including 1 Book

Publications by Year

Citations contained in zbMATH

47 Publications have been cited 347 times in 219 Documents Cited by Year
Kernelization lower bounds by cross-composition. Zbl 1295.05222
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
72
2014
Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
38
2011
Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Zbl 1448.68465
Fellows, Michael R.; Jansen, Bart M. P.; Rosamond, Frances
36
2013
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196
Jansen, Bart M. P.; Bodlaender, Hans L.
14
2013
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
14
2011
Data reduction for graph coloring problems. Zbl 1435.68124
Jansen, Bart M. P.; Kratsch, Stefan
12
2013
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092
Jansen, Bart M. P.; Bodlaender, Hans L.
11
2011
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Zbl 1371.68212
Jansen, Bart M. P.; Marx, Dániel
10
2015
Kernel bounds for path and cycle problems. Zbl 1407.68207
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
9
2013
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
8
2013
Kernel bounds for structural parameterizations of pathwidth. Zbl 1357.68078
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
8
2012
Data reduction for graph coloring problems. Zbl 1342.68167
Jansen, Bart M. P.; Kratsch, Stefan
8
2011
Fine-grained parameterized complexity analysis of graph coloring problems. Zbl 06751074
Jaffke, Lars; Jansen, Bart M. P.
7
2017
Uniform kernelization complexity of hitting forbidden minors. Zbl 1441.68107
Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
7
2015
Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095
Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał
7
2014
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165
Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
7
2011
A near-optimal planarization algorithm. Zbl 1423.68341
Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
6
2014
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223
Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
6
2013
A structural approach to kernels for ILPs: treewidth and total unimodularity. Zbl 06511817
Jansen, Bart M. P.; Kratsch, Stefan
5
2015
Kernel bounds for path and cycle problems. Zbl 1352.68092
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
5
2012
Approximation and kernelization for chordal vertex deletion. Zbl 1410.68300
Jansen, Bart M. P.; Pilipczuk, Marcin
4
2017
Sparsification upper and lower bounds for graph problems and not-all-equal SAT. Zbl 1372.68129
Jansen, Bart M. P.; Pieterse, Astrid
4
2017
Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 1398.68244
Jansen, Bart M. P.; Pieterse, Astrid
4
2016
Fine-grained complexity analysis of two classic TSP variants. Zbl 1388.68139
de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard
4
2016
Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1425.68144
Jansen, Bart M. P.
4
2014
Approximation and kernelization for chordal vertex deletion. Zbl 1394.05124
Jansen, Bart M. P.; Pilipczuk, Marcin
3
2018
On polynomial kernels for structural parameterizations of odd cycle transversal. Zbl 1352.68112
Jansen, Bart M. P.; Kratsch, Stefan
3
2012
Polynomial kernels for hard problems on disk graphs. Zbl 1285.68123
Jansen, Bart
3
2010
Optimal data reduction for graph coloring using low-degree polynomials. Zbl 1443.68132
Jansen, Bart M. P.; Pieterse, Astrid
2
2018
Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1356.68099
Jansen, Bart M. P.
2
2017
Sparsification upper and lower bounds for graphs problems and not-all-equal SAT. Zbl 1372.68128
Jansen, Bart M. P.; Pieterse, Astrid
2
2015
On sparsification for computing treewidth. Zbl 1312.68103
Jansen, Bart
2
2015
FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders. Zbl 1347.68167
Fellows, Michael R.; Jansen, Bart M. P.
2
2014
On sparsification for computing treewidth. Zbl 1309.68096
Jansen, Bart M. P.
2
2013
FPT is characterized by useful obstruction sets. Zbl 1417.68051
Fellows, Michael R.; Jansen, Bart M. P.
2
2013
Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1254.68126
Jansen, Bart M. P.
2
2012
Determining the winner of a Dodgson election is hard. Zbl 1245.68091
Fellows, Michael; Jansen, Bart M. P.; Lokshtanov, Daniel; Rosamond, Frances A.; Saurabh, Saket
2
2010
Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1437.05224
Jansen, Bart M. P.; Wulms, Jules J. H. M.
1
2020
Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 07143744
Jansen, Bart M. P.; Pieterse, Astrid
1
2019
Computing the chromatic number using graph decompositions via matrix rank. Zbl 1431.68053
Jansen, Bart M. P.; Nederlof, Jesper
1
2019
Turing kernelization for finding long paths in graph classes excluding a topological minor. Zbl 1430.68219
Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin
1
2019
Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137
Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
1
2017
Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1398.05110
Jansen, Bart M. P.; Wulms, Jules J. H. M.
1
2017
Independent-set reconfiguration thresholds of hereditary graph classes. Zbl 1391.05198
de Berg, Mark; Jansen, Bart M. P.; Mukherjee, Debankur
1
2016
On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT. Zbl 1417.05213
Jansen, Bart M. P.
1
2016
Preprocessing subgraph and minor problems: When does a small vertex cover help? Zbl 1374.68241
Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał
1
2012
Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1284.68298
Jansen, Bart
1
2010
Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1437.05224
Jansen, Bart M. P.; Wulms, Jules J. H. M.
1
2020
Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 07143744
Jansen, Bart M. P.; Pieterse, Astrid
1
2019
Computing the chromatic number using graph decompositions via matrix rank. Zbl 1431.68053
Jansen, Bart M. P.; Nederlof, Jesper
1
2019
Turing kernelization for finding long paths in graph classes excluding a topological minor. Zbl 1430.68219
Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin
1
2019
Approximation and kernelization for chordal vertex deletion. Zbl 1394.05124
Jansen, Bart M. P.; Pilipczuk, Marcin
3
2018
Optimal data reduction for graph coloring using low-degree polynomials. Zbl 1443.68132
Jansen, Bart M. P.; Pieterse, Astrid
2
2018
Fine-grained parameterized complexity analysis of graph coloring problems. Zbl 06751074
Jaffke, Lars; Jansen, Bart M. P.
7
2017
Approximation and kernelization for chordal vertex deletion. Zbl 1410.68300
Jansen, Bart M. P.; Pilipczuk, Marcin
4
2017
Sparsification upper and lower bounds for graph problems and not-all-equal SAT. Zbl 1372.68129
Jansen, Bart M. P.; Pieterse, Astrid
4
2017
Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1356.68099
Jansen, Bart M. P.
2
2017
Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137
Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
1
2017
Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1398.05110
Jansen, Bart M. P.; Wulms, Jules J. H. M.
1
2017
Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 1398.68244
Jansen, Bart M. P.; Pieterse, Astrid
4
2016
Fine-grained complexity analysis of two classic TSP variants. Zbl 1388.68139
de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard
4
2016
Independent-set reconfiguration thresholds of hereditary graph classes. Zbl 1391.05198
de Berg, Mark; Jansen, Bart M. P.; Mukherjee, Debankur
1
2016
On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT. Zbl 1417.05213
Jansen, Bart M. P.
1
2016
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Zbl 1371.68212
Jansen, Bart M. P.; Marx, Dániel
10
2015
Uniform kernelization complexity of hitting forbidden minors. Zbl 1441.68107
Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
7
2015
A structural approach to kernels for ILPs: treewidth and total unimodularity. Zbl 06511817
Jansen, Bart M. P.; Kratsch, Stefan
5
2015
Sparsification upper and lower bounds for graphs problems and not-all-equal SAT. Zbl 1372.68128
Jansen, Bart M. P.; Pieterse, Astrid
2
2015
On sparsification for computing treewidth. Zbl 1312.68103
Jansen, Bart
2
2015
Kernelization lower bounds by cross-composition. Zbl 1295.05222
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
72
2014
Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095
Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał
7
2014
A near-optimal planarization algorithm. Zbl 1423.68341
Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
6
2014
Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1425.68144
Jansen, Bart M. P.
4
2014
FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders. Zbl 1347.68167
Fellows, Michael R.; Jansen, Bart M. P.
2
2014
Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Zbl 1448.68465
Fellows, Michael R.; Jansen, Bart M. P.; Rosamond, Frances
36
2013
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196
Jansen, Bart M. P.; Bodlaender, Hans L.
14
2013
Data reduction for graph coloring problems. Zbl 1435.68124
Jansen, Bart M. P.; Kratsch, Stefan
12
2013
Kernel bounds for path and cycle problems. Zbl 1407.68207
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
9
2013
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
8
2013
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223
Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
6
2013
On sparsification for computing treewidth. Zbl 1309.68096
Jansen, Bart M. P.
2
2013
FPT is characterized by useful obstruction sets. Zbl 1417.68051
Fellows, Michael R.; Jansen, Bart M. P.
2
2013
Kernel bounds for structural parameterizations of pathwidth. Zbl 1357.68078
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
8
2012
Kernel bounds for path and cycle problems. Zbl 1352.68092
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
5
2012
On polynomial kernels for structural parameterizations of odd cycle transversal. Zbl 1352.68112
Jansen, Bart M. P.; Kratsch, Stefan
3
2012
Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1254.68126
Jansen, Bart M. P.
2
2012
Preprocessing subgraph and minor problems: When does a small vertex cover help? Zbl 1374.68241
Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał
1
2012
Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
38
2011
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
14
2011
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092
Jansen, Bart M. P.; Bodlaender, Hans L.
11
2011
Data reduction for graph coloring problems. Zbl 1342.68167
Jansen, Bart M. P.; Kratsch, Stefan
8
2011
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165
Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
7
2011
Polynomial kernels for hard problems on disk graphs. Zbl 1285.68123
Jansen, Bart
3
2010
Determining the winner of a Dodgson election is hard. Zbl 1245.68091
Fellows, Michael; Jansen, Bart M. P.; Lokshtanov, Daniel; Rosamond, Frances A.; Saurabh, Saket
2
2010
Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1284.68298
Jansen, Bart
1
2010
all top 5

Cited by 274 Authors

26 Jansen, Bart M. P.
20 Saurabh, Saket
18 Kratsch, Stefan
17 Niedermeier, Rolf
14 Pilipczuk, Marcin
13 Lokshtanov, Daniel
12 Cygan, Marek
11 Nichterlein, André
11 Sau, Ignasi
10 Komusiewicz, Christian
10 Pilipczuk, Michał
9 Fomin, Fedor V.
9 Golovach, Petr A.
9 Thilikos, Dimitrios M.
8 van Bevern, René
8 Zehavi, Meirav
7 Bodlaender, Hans L.
7 Fellows, Michael Ralph
7 Sorge, Manuel
6 Bredereck, Robert
6 Ganian, Robert
6 Hartung, Sepp
6 Hermelin, Danny
6 Raman, Venkatesh
6 Suchý, Ondřej
5 Gutin, Gregory Z.
5 Heggernes, Pinar
5 Majumdar, Diptapriyo
5 Mnich, Matthias
5 Otachi, Yota
5 Paul, Christophe
5 Pieterse, Astrid
5 Rai, Ashutosh
5 Ramanujan, M. S.
5 Weller, Mathias
4 Baste, Julien
4 Bonnet, Edouard
4 Eiben, Eduard
4 Fluschnik, Till
4 Koutecký, Martin
4 Liedloff, Mathieu
4 Mertzios, George B.
4 Misra, Neeldhara
4 Ordyniak, Sebastian
4 Panolan, Fahad
4 Paulusma, Daniël
4 Rosamond, Frances A.
4 Szeider, Stefan
4 Thomassé, Stéphan
4 van ’t Hof, Pim
4 Wahlström, Magnus
3 Bougeret, Marin
3 Cai, Leizhen
3 Chen, Jiehua
3 Garnero, Valentin
3 Knop, Dušan
3 Krithika, R.
3 Kwon, Ojoung
3 Li, Wenjun
3 Marx, Dániel
3 Montealegre, Pedro
3 Perez, Anthony
3 Philip, Geevarghese
3 Protti, Fábio
3 Sikora, Florian
3 Todinca, Ioan
3 Van Leeuwen, Erik Jan
3 Villanger, Yngve
3 Watrigant, Rémi
2 Abu-Khzam, Faisal N.
2 Agrawal, Akanksha
2 Araújo, Júlio César Silva
2 Bazgan, Cristina
2 Bessy, Stéphane
2 Bliznets, Ivan A.
2 Bulteau, Laurent
2 Campos, Victor A.
2 Cao, Yixin
2 Chopin, Morgan
2 Crampton, Jason
2 Dantas da Silva, Maise
2 Das, Bireswar
2 Dell, Holger
2 Dondi, Riccardo
2 dos Santos Souza, Uéverton
2 Downey, Rodney Graham
2 Enduri, Murali Krishna
2 Escoffier, Bruno
2 Fernau, Henning
2 Froese, Vincent
2 Giannopoulou, Archontia C.
2 Giroudeau, Rodolphe
2 Guo, Jiong
2 Gupta, Sushmita
2 Jiang, Minghui
2 Karpov, Nikolay
2 Ke, Yuping
2 Kim, Eunjung
2 Kiyomi, Masashi
2 Kolay, Sudeshna
...and 174 more Authors

Citations by Year

Wikidata Timeline