Martin Vatshelle

882 total citations
19 papers, 251 citations indexed

About

Martin Vatshelle is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Martin Vatshelle has authored 19 papers receiving a total of 251 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 8 papers in Computer Networks and Communications and 3 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Martin Vatshelle's work include Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (15 papers) and Interconnection Networks and Systems (4 papers). Martin Vatshelle is often cited by papers focused on Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (15 papers) and Interconnection Networks and Systems (4 papers). Martin Vatshelle collaborates with scholars based in Norway, Canada and India. Martin Vatshelle's co-authors include Jan Arne Telle, Binh-Minh Bui-Xuan, Yngve Villanger, Chı́nh T. Hoàng, Sang‐il Oum, Joe Sawada, Bart M. P. Jansen, Joseph S. B. Mitchell, Julian Keil and Venkatesh Raman and has published in prestigious journals such as Theoretical Computer Science, Journal of Artificial Intelligence Research and Discrete Applied Mathematics.

In The Last Decade

Martin Vatshelle

18 papers receiving 245 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Martin Vatshelle Norway	10	232	81	72	26	15	19	251
Luis Cereceda United Kingdom	5	201 0.9×	79 1.0×	64 0.9×	17 0.7×	30 2.0×	7	206
Ján Katrenič Slovakia	6	199 0.9×	103 1.3×	54 0.8×	26 1.0×	22 1.5×	10	236
Hoàng-Oanh Le Germany	10	199 0.9×	58 0.7×	57 0.8×	52 2.0×	12 0.8×	17	204
Sebastian Siebertz Germany	9	206 0.9×	44 0.5×	62 0.9×	26 1.0×	8 0.5×	38	224
Dimitrios M. Thilikos France	7	127 0.5×	36 0.4×	43 0.6×	18 0.7×	9 0.6×	25	149
R. Sritharan United States	11	287 1.2×	123 1.5×	67 0.9×	29 1.1×	51 3.4×	33	307
Ross J. Kang Netherlands	9	207 0.9×	26 0.3×	137 1.9×	52 2.0×	32 2.1×	56	252
Célia Picinin de Mello Brazil	10	231 1.0×	35 0.4×	86 1.2×	51 2.0×	49 3.3×	30	248
Deepak Rajendraprasad India	6	166 0.7×	39 0.5×	78 1.1×	34 1.3×	22 1.5×	24	172
Charis Papadopoulos Greece	8	145 0.6×	52 0.6×	39 0.5×	54 2.1×	17 1.1×	31	167

Countries citing papers authored by Martin Vatshelle

Since Specialization

Citations

This map shows the geographic impact of Martin Vatshelle'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 Martin Vatshelle with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Martin Vatshelle more than expected).

Fields of papers citing papers by Martin Vatshelle

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Martin Vatshelle. 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 Martin Vatshelle. The network helps show where Martin Vatshelle may publish in the future.

Co-authorship network of co-authors of Martin Vatshelle

This figure shows the co-authorship network connecting the top 25 collaborators of Martin Vatshelle. A scholar is included among the top collaborators of Martin Vatshelle 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 Martin Vatshelle. Martin Vatshelle is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

19 of 19 papers shown

Lien, Martha, et al.. (2022). Monitoring the Snøhvit Gas Field Using Seabed Gravimetry and Subsidence. First Break. 40(3). 93–96. 2 indexed citations

Keil, Julian, et al.. (2016). An algorithm for the maximum weight independent set problem on outerstring graphs. Computational Geometry. 60. 19–25. 10 indexed citations

Vatshelle, Martin, et al.. (2015). Hardness of computing width parameters based on branch decompositions over the vertex set. Theoretical Computer Science. 615. 120–125. 9 indexed citations

Telle, Jan Arne, et al.. (2015). Solving #SAT and MAXSAT by Dynamic Programming. Journal of Artificial Intelligence Research. 54. 59–82. 5 indexed citations

Vatshelle, Martin, et al.. (2015). Hardness of computing width parameters based on branch decompositions over the vertex set. Electronic Notes in Discrete Mathematics. 49. 301–308.

Vatshelle, Martin, et al.. (2014). Independent set in P 5 -free graphs in polynomial time. Symposium on Discrete Algorithms. 570–581. 34 indexed citations

Hoàng, Chı́nh T., et al.. (2014). Constructions ofk-criticalP5-free graphs. Discrete Applied Mathematics. 182. 91–98. 22 indexed citations

Oum, Sang‐il, et al.. (2014). Faster algorithms for vertex partitioning problems parameterized by clique-width. Theoretical Computer Science. 535. 16–24. 11 indexed citations

Jansen, Bart M. P., Venkatesh Raman, & Martin Vatshelle. (2014). Parameter ecology for Feedback Vertex Set. Tsinghua Science & Technology. 19(4). 387–409. 8 indexed citations

10.

Bui-Xuan, Binh-Minh, Jan Arne Telle, & Martin Vatshelle. (2013). Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theoretical Computer Science. 511. 66–76. 33 indexed citations

11.

Biedl, Thérèse & Martin Vatshelle. (2013). THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS. International Journal of Computational Geometry & Applications. 23(04n05). 357–395. 1 indexed citations

12.

Vatshelle, Martin, et al.. (2013). Graph classes with structured neighborhoods and algorithmic applications. Theoretical Computer Science. 511. 54–65. 31 indexed citations

13.

Vatshelle, Martin, et al.. (2013). Independent Set in P₅-Free Graphs in Polynomial Time. 570–581. 29 indexed citations

14.

Bui-Xuan, Binh-Minh, Ondřej Suchý, Jan Arne Telle, & Martin Vatshelle. (2012). Feedback vertex set on graphs of low clique-width. European Journal of Combinatorics. 34(3). 666–679. 6 indexed citations

15.

Biedl, Thérèse & Martin Vatshelle. (2012). The point-set embeddability problem for plane graphs. 41–50. 3 indexed citations

16.

Bui-Xuan, Binh-Minh, Jan Arne Telle, & Martin Vatshelle. (2011). Boolean-width of graphs. Theoretical Computer Science. 412(39). 5187–5204. 28 indexed citations

17.

Bui-Xuan, Binh-Minh, Jan Arne Telle, & Martin Vatshelle. (2010). Feedback vertex set on graphs of low cliquewidth. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations

18.

Bui-Xuan, Binh-Minh, Jan Arne Telle, & Martin Vatshelle. (2009). H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics. 158(7). 809–819. 15 indexed citations

19.

Meister, Daniel, Jan Arne Telle, & Martin Vatshelle. (2009). Recognizing digraphs of Kelly-width 2. Discrete Applied Mathematics. 158(7). 741–746. 3 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