Edit Profile Jansen, Bart M. P. Compute Distance To: Compute Author ID: jansen.bart-m-p Published as: Jansen, Bart; Jansen, Bart M. P. External Links: MGP Documents Indexed: 61 Publications since 2005, including 1 Book all top 5 Co-Authors 10 single-authored 13 Kratsch, Stefan 9 Bodlaender, Hans L. 8 Pieterse, Astrid 4 Fellows, Michael Ralph 4 Lokshtanov, Daniel 4 Pilipczuk, Marcin 4 Saurabh, Saket 3 de Berg, Mark Theodoor 2 Donkers, Huib 2 Fomin, Fedor V. 2 Giannopoulou, Archontia C. 2 Heggernes, Pinar 2 Mukherjee, Debankur 2 Nederlof, Jesper 2 Pilipczuk, Michał 2 Rosamond, Frances A. 2 van ’t Hof, Pim 2 Villanger, Yngve 2 Wrochna, Marcin 2 Wulms, Jules J. H. M. 1 Barri, Adriaan 1 Buchin, Kevin 1 Chen, Hubie 1 de Kroon, Arnoud A. W. M. 1 De Vylder, Bart 1 Dooms, Ann 1 Jaffke, Lars 1 Kozma, Laszlo 1 Lenaerts, Tom 1 Marx, Dániel 1 Morel, Rolf 1 Schelkens, Peter 1 Telle, Jan Arne 1 Tuyls, Karl 1 van Geffen, Bas A. M. 1 Woeginger, Gerhard Johannes all top 5 Serials 5 Algorithmica 4 Theoretical Computer Science 3 Journal of Computer and System Sciences 3 SIAM Journal on Discrete Mathematics 3 Journal of Graph Algorithms and Applications 2 Discrete Applied Mathematics 2 ACM Transactions on Computation Theory 1 European Journal of Combinatorics 1 Information and Computation 1 Theory of Computing Systems 1 IEEE Transactions on Image Processing 1 ACM Transactions on Algorithms 1 LIPIcs – Leibniz International Proceedings in Informatics 1 Journal of Theoretical Biology all top 5 Fields 55 Computer science (68-XX) 46 Combinatorics (05-XX) 6 Operations research, mathematical programming (90-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 General and overarching topics; collections (00-XX) 1 Information and communication theory, circuits (94-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 48 Publications have been cited 362 times in 225 Documents Cited by ▼ Year ▼ Kernelization lower bounds by cross-composition. Zbl 1295.05222Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 73 2014 Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 38 2011 Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Zbl 1448.68465Fellows, Michael R.; Jansen, Bart M. P.; Rosamond, Frances 36 2013 Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196Jansen, Bart M. P.; Bodlaender, Hans L. 15 2013 Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 14 2011 Data reduction for graph coloring problems. Zbl 1435.68124Jansen, Bart M. P.; Kratsch, Stefan 13 2013 Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092Jansen, 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.68212Jansen, Bart M. P.; Marx, Dániel 10 2015 Kernel bounds for path and cycle problems. Zbl 1407.68207Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 10 2013 Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 8 2014 Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 8 2013 Kernel bounds for structural parameterizations of pathwidth. Zbl 1357.68078Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 8 2012 Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve 8 2011 Data reduction for graph coloring problems. Zbl 1342.68167Jansen, Bart M. P.; Kratsch, Stefan 8 2011 Fine-grained parameterized complexity analysis of graph coloring problems. Zbl 06751074Jaffke, Lars; Jansen, Bart M. P. 7 2017 Uniform kernelization complexity of hitting forbidden minors. Zbl 1441.68107Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 7 2015 A near-optimal planarization algorithm. Zbl 1423.68341Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 7 2014 Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve 6 2013 Sparsification upper and lower bounds for graph problems and not-all-equal SAT. Zbl 1372.68129Jansen, Bart M. P.; Pieterse, Astrid 5 2017 Fine-grained complexity analysis of two classic TSP variants. Zbl 1388.68139de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard 5 2016 A structural approach to kernels for ILPs: treewidth and total unimodularity. Zbl 06511817Jansen, Bart M. P.; Kratsch, Stefan 5 2015 Kernel bounds for path and cycle problems. Zbl 1352.68092Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 5 2012 Approximation and kernelization for chordal vertex deletion. Zbl 1410.68300Jansen, Bart M. P.; Pilipczuk, Marcin 4 2017 Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 1398.68244Jansen, Bart M. P.; Pieterse, Astrid 4 2016 Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1425.68144Jansen, Bart M. P. 4 2014 Approximation and kernelization for chordal vertex deletion. Zbl 1394.05124Jansen, Bart M. P.; Pilipczuk, Marcin 3 2018 Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 3 2017 Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1356.68099Jansen, Bart M. P. 3 2017 Sparsification upper and lower bounds for graphs problems and not-all-equal SAT. Zbl 1372.68128Jansen, Bart M. P.; Pieterse, Astrid 3 2015 On polynomial kernels for structural parameterizations of odd cycle transversal. Zbl 1352.68112Jansen, Bart M. P.; Kratsch, Stefan 3 2012 Polynomial kernels for hard problems on disk graphs. Zbl 1285.68123Jansen, Bart 3 2010 Turing kernelization for finding long paths in graph classes excluding a topological minor. Zbl 1430.68219Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin 2 2019 Optimal data reduction for graph coloring using low-degree polynomials. Zbl 1443.68132Jansen, Bart M. P.; Pieterse, Astrid 2 2018 On sparsification for computing treewidth. Zbl 1312.68103Jansen, Bart 2 2015 FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders. Zbl 1347.68167Fellows, Michael R.; Jansen, Bart M. P. 2 2014 On sparsification for computing treewidth. Zbl 1309.68096Jansen, Bart M. P. 2 2013 FPT is characterized by useful obstruction sets. Zbl 1417.68051Fellows, Michael R.; Jansen, Bart M. P. 2 2013 Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1254.68126Jansen, Bart M. P. 2 2012 Determining the winner of a Dodgson election is hard. Zbl 1245.68091Fellows, Michael; Jansen, Bart M. P.; Lokshtanov, Daniel; Rosamond, Frances A.; Saurabh, Saket 2 2010 Polynomial kernels for hitting forbidden minors under structural parameterizations. Zbl 1455.68143Jansen, Bart M. P.; Pieterse, Astrid 1 2020 Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1437.05224Jansen, Bart M. P.; Wulms, Jules J. H. M. 1 2020 Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 07143744Jansen, Bart M. P.; Pieterse, Astrid 1 2019 Computing the chromatic number using graph decompositions via matrix rank. Zbl 1431.68053Jansen, Bart M. P.; Nederlof, Jesper 1 2019 Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1398.05110Jansen, Bart M. P.; Wulms, Jules J. H. M. 1 2017 Independent-set reconfiguration thresholds of hereditary graph classes. Zbl 1391.05198de 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.05213Jansen, Bart M. P. 1 2016 Preprocessing subgraph and minor problems: When does a small vertex cover help? Zbl 1374.68241Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 1 2012 Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1284.68298Jansen, Bart 1 2010 Polynomial kernels for hitting forbidden minors under structural parameterizations. Zbl 1455.68143Jansen, Bart M. P.; Pieterse, Astrid 1 2020 Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1437.05224Jansen, Bart M. P.; Wulms, Jules J. H. M. 1 2020 Turing kernelization for finding long paths in graph classes excluding a topological minor. Zbl 1430.68219Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin 2 2019 Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 07143744Jansen, Bart M. P.; Pieterse, Astrid 1 2019 Computing the chromatic number using graph decompositions via matrix rank. Zbl 1431.68053Jansen, Bart M. P.; Nederlof, Jesper 1 2019 Approximation and kernelization for chordal vertex deletion. Zbl 1394.05124Jansen, Bart M. P.; Pilipczuk, Marcin 3 2018 Optimal data reduction for graph coloring using low-degree polynomials. Zbl 1443.68132Jansen, Bart M. P.; Pieterse, Astrid 2 2018 Fine-grained parameterized complexity analysis of graph coloring problems. Zbl 06751074Jaffke, Lars; Jansen, Bart M. P. 7 2017 Sparsification upper and lower bounds for graph problems and not-all-equal SAT. Zbl 1372.68129Jansen, Bart M. P.; Pieterse, Astrid 5 2017 Approximation and kernelization for chordal vertex deletion. Zbl 1410.68300Jansen, Bart M. P.; Pilipczuk, Marcin 4 2017 Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 3 2017 Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1356.68099Jansen, Bart M. P. 3 2017 Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1398.05110Jansen, Bart M. P.; Wulms, Jules J. H. M. 1 2017 Fine-grained complexity analysis of two classic TSP variants. Zbl 1388.68139de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard 5 2016 Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 1398.68244Jansen, Bart M. P.; Pieterse, Astrid 4 2016 Independent-set reconfiguration thresholds of hereditary graph classes. Zbl 1391.05198de 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.05213Jansen, Bart M. P. 1 2016 Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Zbl 1371.68212Jansen, Bart M. P.; Marx, Dániel 10 2015 Uniform kernelization complexity of hitting forbidden minors. Zbl 1441.68107Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 7 2015 A structural approach to kernels for ILPs: treewidth and total unimodularity. Zbl 06511817Jansen, Bart M. P.; Kratsch, Stefan 5 2015 Sparsification upper and lower bounds for graphs problems and not-all-equal SAT. Zbl 1372.68128Jansen, Bart M. P.; Pieterse, Astrid 3 2015 On sparsification for computing treewidth. Zbl 1312.68103Jansen, Bart 2 2015 Kernelization lower bounds by cross-composition. Zbl 1295.05222Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 73 2014 Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 8 2014 A near-optimal planarization algorithm. Zbl 1423.68341Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 7 2014 Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1425.68144Jansen, Bart M. P. 4 2014 FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders. Zbl 1347.68167Fellows, Michael R.; Jansen, Bart M. P. 2 2014 Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Zbl 1448.68465Fellows, Michael R.; Jansen, Bart M. P.; Rosamond, Frances 36 2013 Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196Jansen, Bart M. P.; Bodlaender, Hans L. 15 2013 Data reduction for graph coloring problems. Zbl 1435.68124Jansen, Bart M. P.; Kratsch, Stefan 13 2013 Kernel bounds for path and cycle problems. Zbl 1407.68207Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 10 2013 Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 8 2013 Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve 6 2013 On sparsification for computing treewidth. Zbl 1309.68096Jansen, Bart M. P. 2 2013 FPT is characterized by useful obstruction sets. Zbl 1417.68051Fellows, Michael R.; Jansen, Bart M. P. 2 2013 Kernel bounds for structural parameterizations of pathwidth. Zbl 1357.68078Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 8 2012 Kernel bounds for path and cycle problems. Zbl 1352.68092Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 5 2012 On polynomial kernels for structural parameterizations of odd cycle transversal. Zbl 1352.68112Jansen, Bart M. P.; Kratsch, Stefan 3 2012 Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1254.68126Jansen, Bart M. P. 2 2012 Preprocessing subgraph and minor problems: When does a small vertex cover help? Zbl 1374.68241Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 1 2012 Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 38 2011 Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 14 2011 Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092Jansen, Bart M. P.; Bodlaender, Hans L. 11 2011 Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve 8 2011 Data reduction for graph coloring problems. Zbl 1342.68167Jansen, Bart M. P.; Kratsch, Stefan 8 2011 Polynomial kernels for hard problems on disk graphs. Zbl 1285.68123Jansen, Bart 3 2010 Determining the winner of a Dodgson election is hard. Zbl 1245.68091Fellows, 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.68298Jansen, Bart 1 2010 all cited Publications top 5 cited Publications all top 5 Cited by 277 Authors 27 Jansen, Bart M. P. 21 Saurabh, Saket 18 Kratsch, Stefan 17 Niedermeier, Rolf 14 Pilipczuk, Marcin 13 Lokshtanov, Daniel 12 Cygan, Marek 11 Nichterlein, André 11 Pilipczuk, Michał 11 Sau, Ignasi 10 Komusiewicz, Christian 10 Thilikos, Dimitrios M. 9 Fomin, Fedor V. 9 Golovach, Petr A. 8 van Bevern, René 8 Zehavi, Meirav 7 Bodlaender, Hans L. 7 Fellows, Michael Ralph 7 Ganian, Robert 7 Sorge, Manuel 6 Bredereck, Robert 6 Gutin, Gregory Z. 6 Hartung, Sepp 6 Hermelin, Danny 6 Majumdar, Diptapriyo 6 Ordyniak, Sebastian 6 Raman, Venkatesh 6 Suchý, Ondřej 5 Heggernes, Pinar 5 Mnich, Matthias 5 Otachi, Yota 5 Paul, Christophe 5 Pieterse, Astrid 5 Rai, Ashutosh 5 Ramanujan, M. S. 5 Rosamond, Frances A. 5 Wahlström, Magnus 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 Panolan, Fahad 4 Paulusma, Daniël 4 Szeider, Stefan 4 Thomassé, Stéphan 4 van ’t Hof, Pim 3 Agrawal, Akanksha 3 Bougeret, Marin 3 Cai, Leizhen 3 Chen, Jiehua 3 Garnero, Valentin 3 Giannopoulou, Archontia C. 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 Tale, Prafullkumar 3 Todinca, Ioan 3 Van Leeuwen, Erik Jan 3 Villanger, Yngve 3 Watrigant, Rémi 3 Wrochna, Marcin 2 Abu-Khzam, Faisal N. 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 Giroudeau, Rodolphe 2 Guo, Jiong 2 Gupta, Sushmita 2 Jiang, Minghui 2 Kanesh, Lawqueen 2 Karpov, Nikolay 2 Ke, Yuping ...and 177 more Authors all top 5 Cited in 32 Serials 41 Algorithmica 29 Theoretical Computer Science 20 Journal of Computer and System Sciences 18 SIAM Journal on Discrete Mathematics 17 Discrete Applied Mathematics 7 Theory of Computing Systems 5 Information Processing Letters 4 Information and Computation 4 Journal of Scheduling 4 Journal of Graph Algorithms and Applications 4 ACM Transactions on Computation Theory 2 Artificial Intelligence 2 Discrete & Computational Geometry 2 The Journal of Artificial Intelligence Research (JAIR) 2 Journal of Combinatorial Optimization 2 Algorithms 1 Acta Informatica 1 Journal of Combinatorial Theory. Series B 1 Networks 1 SIAM Journal on Computing 1 European Journal of Combinatorics 1 Computers & Operations Research 1 Journal of Automated Reasoning 1 International Journal of Foundations of Computer Science 1 European Journal of Operational Research 1 Mathematical Programming. Series A. Series B 1 RAIRO. Operations Research 1 Quantum Information Processing 1 ACM Journal of Experimental Algorithmics 1 Discrete Optimization 1 Optimization Letters 1 Computer Science Review all top 5 Cited in 11 Fields 202 Computer science (68-XX) 157 Combinatorics (05-XX) 35 Operations research, mathematical programming (90-XX) 8 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 2 Mathematical logic and foundations (03-XX) 2 Biology and other natural sciences (92-XX) 2 Information and communication theory, circuits (94-XX) 1 History and biography (01-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Quantum theory (81-XX) Citations by Year