Bart M. P. Jansen
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications
- Discrete Mathematics and Combinatorics top 10%
- Artificial Intelligence
- Electrical and Electronic Engineering
- Co-authors
- Hans L. BodlaenderStefan KratschMichael R. FellowsFrances RosamondMarcin PilipczukSaket SaurabhDaniel LokshtanovMichał Pilipczuk
- Topics
- Advanced Graph Theory Research (40 papers)Complexity and Algorithms in Graphs (29 papers)Graph Labeling and Dimension Problems (7 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
- Journals
- SHILAP Revista de lepidopterologíaSIAM Journal on ComputingTheoretical Computer Science
- Partner nations
- NetherlandsNorwayGermany
In The Last Decade
Bart M. P. Jansen
37 papers receiving 246 citations
Peers
Comparison fields: 5 of 45
- Computational Theory and Mathematics 216
- Computer Networks and Communications 54
- Discrete Mathematics and Combinatorics 37
- Artificial Intelligence 28
- Electrical and Electronic Engineering 22
Countries citing papers authored by Bart M. P. Jansen
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 1 | |
| 6 | 0 | |
| 7 | 1 | |
| 8 | 1 | |
| 9 | 3 | |
| 10 | 5 | |
| 11 | 5 | |
| 12 | 7 | |
| 13 | 8 | |
| 14 | 15 | |
| 15 | 12 | |
| 16 | 10 | |
| 17 | 23 | |
| 18 | 13 | |
| 19 | 19 | |
| 20 | 42 |
About Bart M. P. Jansen
Bart M. P. Jansen is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics, having authored 45 papers that have together received 254 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (40 papers), Complexity and Algorithms in Graphs (29 papers) and Graph Labeling and Dimension Problems (7 papers). The work is most often cited by research in Computational Theory and Mathematics (216 citations), Discrete Mathematics and Combinatorics (37 citations) and Computer Graphics and Computer-Aided Design (20 citations). Bart M. P. Jansen has collaborated with scholars based in Netherlands, Norway and Germany. Frequent 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. Their work appears in journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Theoretical Computer Science.
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.