Bart M. P. Jansen

1.4k total citations
45 papers, 254 citations indexed

About

Bart M. P. Jansen is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Bart M. P. Jansen has authored 45 papers receiving a total of 254 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 5 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Bart M. P. Jansen's work include Advanced Graph Theory Research (40 papers), Complexity and Algorithms in Graphs (29 papers) and Graph Labeling and Dimension Problems (7 papers). Bart M. P. Jansen is often cited by papers focused on Advanced Graph Theory Research (40 papers), Complexity and Algorithms in Graphs (29 papers) and Graph Labeling and Dimension Problems (7 papers). Bart M. P. Jansen collaborates with scholars based in Netherlands, Norway and Germany. Bart M. P. Jansen's co-authors include Hans L. Bodlaender, Stefan Kratsch, Michael R. Fellows, Frances Rosamond, Marcin Pilipczuk, Saket Saurabh, Daniel Lokshtanov, Michał Pilipczuk, Fedor V. Fomin and Kevin Buchin and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Bart M. P. Jansen

37 papers receiving 246 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Bart M. P. Jansen Netherlands 10 216 54 37 28 22 45 254
Frederic Dorn Norway 9 178 0.8× 75 1.4× 25 0.7× 34 1.2× 23 1.0× 16 207
N. V. R. Mahadev United States 10 215 1.0× 75 1.4× 51 1.4× 11 0.4× 29 1.3× 30 277
Uéverton S. Souza Brazil 8 138 0.6× 55 1.0× 42 1.1× 25 0.9× 23 1.0× 68 190
Eiji Miyano Japan 8 113 0.5× 97 1.8× 5 0.1× 36 1.3× 21 1.0× 47 184
Mihály Hujter Hungary 6 194 0.9× 42 0.8× 83 2.2× 9 0.3× 20 0.9× 12 250
Vinícius F. dos Santos Brazil 7 88 0.4× 15 0.3× 29 0.8× 50 1.8× 23 1.0× 39 148
Tınaz Ekim Türkiye 9 178 0.8× 69 1.3× 50 1.4× 7 0.3× 29 1.3× 50 245
Haruko Okamura Japan 8 217 1.0× 136 2.5× 35 0.9× 6 0.2× 76 3.5× 18 277
Anna Adamaszek Denmark 9 58 0.3× 50 0.9× 5 0.1× 13 0.5× 8 0.4× 27 142
Yahav Nussbaum Israel 9 101 0.5× 55 1.0× 5 0.1× 5 0.2× 13 0.6× 13 152

Countries citing papers authored by Bart M. P. Jansen

Since Specialization
Citations

This map shows the geographic impact of Bart M. P. Jansen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bart M. P. Jansen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bart M. P. Jansen more than expected).

Fields of papers citing papers by Bart M. P. Jansen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bart M. P. Jansen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bart M. P. Jansen. The network helps show where Bart M. P. Jansen may publish in the future.

Co-authorship network of co-authors of Bart M. P. Jansen

This figure shows the co-authorship network connecting the top 25 collaborators of Bart M. P. Jansen. A scholar is included among the top collaborators of Bart M. P. Jansen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Bart M. P. Jansen. Bart M. P. Jansen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Jansen, Bart M. P., et al.. (2024). Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes. Journal of Computer and System Sciences. 148. 103597–103597.
2.
Jansen, Bart M. P., et al.. (2024). Search-Space Reduction via Essential Vertices. SIAM Journal on Discrete Mathematics. 38(3). 2392–2415.
3.
Jansen, Bart M. P., et al.. (2023). Finding k-secluded trees faster. Journal of Computer and System Sciences. 138. 103461–103461. 1 indexed citations
4.
Jansen, Bart M. P., et al.. (2022). Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. TU/e Research Portal. 900–913. 1 indexed citations
5.
Jansen, Bart M. P., et al.. (2021). On the Hardness of Compressing Weights. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 21. 1 indexed citations
6.
Jansen, Bart M. P., et al.. (2018). Polynomial Kernels for Hitting Forbidden Minors under Structural\n Parameterizations. arXiv (Cornell University).
7.
Jansen, Bart M. P., Marcin Pilipczuk, & Erik Jan van Leeuwen. (2018). A deterministic polynomial kernel for Odd Cycle Transversal and Vertex\n Multiway Cut in planar graphs. arXiv (Cornell University). 1 indexed citations
8.
Berg, Mark de, Bart M. P. Jansen, & Debankur Mukherjee. (2018). Independent-set reconfiguration thresholds of hereditary graph classes. Discrete Applied Mathematics. 250. 165–182. 1 indexed citations
9.
Jansen, Bart M. P. & Marcin Pilipczuk. (2017). Approximation and kernelization for chordal vertex deletion. Symposium on Discrete Algorithms. 1399–1418. 3 indexed citations
10.
Berg, Mark de, Kevin Buchin, Bart M. P. Jansen, & Gerhard J. Woeginger. (2016). Fine-grained complexity analysis of two classic TSP variants. TU/e Research Portal. 5 indexed citations
11.
Jansen, Bart M. P.. (2016). Turing kernelization for finding long paths and cycles in restricted graph classes. Journal of Computer and System Sciences. 85. 18–37. 5 indexed citations
12.
Bonnechère, Bruno, Bart M. P. Jansen, Luboš Omelina, Marcel Rooze, & Serge Van Sint Jan. (2015). Interchangeability of the Wii Balance Board for Bipedal Balance Assessment. JMIR Rehabilitation and Assistive Technologies. 2(2). e8–e8. 7 indexed citations
13.
Jansen, Bart M. P. & Dániel Marx. (2015). Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Symposium on Discrete Algorithms. 616–629. 8 indexed citations
14.
Jansen, Bart M. P. & Stefan Kratsch. (2013). Data reduction for graph coloring problems. Information and Computation. 231. 70–88. 15 indexed citations
15.
Fomin, Fedor V., Bart M. P. Jansen, & Michał Pilipczuk. (2013). Preprocessing subgraph and minor problems: When does a small vertex cover help?. Journal of Computer and System Sciences. 80(2). 468–495. 12 indexed citations
16.
Bodlaender, Hans L., Bart M. P. Jansen, & Stefan Kratsch. (2013). Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. SIAM Journal on Discrete Mathematics. 27(4). 2108–2142. 10 indexed citations
17.
Jansen, Bart M. P. & Hans L. Bodlaender. (2012). Vertex Cover Kernelization Revisited. Theory of Computing Systems. 53(2). 263–299. 23 indexed citations
18.
Heggernes, Pinar, Pim van ’t Hof, Bart M. P. Jansen, Stefan Kratsch, & Yngve Villanger. (2012). Parameterized complexity of vertex deletion into perfect graph classes. Theoretical Computer Science. 511. 172–180. 13 indexed citations
19.
Bodlaender, Hans L., Bart M. P. Jansen, & Stefan Kratsch. (2012). Kernel bounds for path and cycle problems. Theoretical Computer Science. 511. 117–136. 19 indexed citations
20.
Fellows, Michael R., Bart M. P. Jansen, & Frances Rosamond. (2012). Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. European Journal of Combinatorics. 34(3). 541–566. 42 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Frederic Dorn Breakdown of academic impact, for papers by N. V. R. Mahadev Breakdown of academic impact, for papers by Uéverton S. Souza Breakdown of academic impact, for papers by Eiji Miyano Breakdown of academic impact, for papers by Mihály Hujter Breakdown of academic impact, for papers by Vinícius F. dos Santos Breakdown of academic impact, for papers by Tınaz Ekim Breakdown of academic impact, for papers by Haruko Okamura Breakdown of academic impact, for papers by Anna Adamaszek Breakdown of academic impact, for papers by Yahav Nussbaum
Rankless by CCL
2026