Science Explorer Back to mapMap
Discussion
Researcher · University of Bergen · Norway

Martin Vatshelle

Martin Vatshelle publishes mostly in Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence, on topics such as Advanced Graph Theory Research, Complexity and Algorithms in Graphs and Interconnection Networks and Systems.

OpenAlex
World rank
#1,249,536
of 7,710,434 ranked researchers
Rank in Norway
#7,958
of 33,005
Works
44
Citations
897
Citations per work
20.4
h-index
17
i10-index 21Top 19% in Computational Theory and Mathematics
Martin Vatshelle

What does Martin Vatshelle research?

Martin Vatshelle's work is mostly in Computer Science (89%), Mathematics (6%).

Physical Sciences: 41 works · 94.3% of their workComputer Science: 39 works · 88.6% of their workComputational Theory and Mathematics: 29 works · 65.6% of their workComputer Networks and Communications: 7 works · 16.4% of their workArtificial Intelligence: 2 works · 4.1% of their workComputer Graphics and Computer-Aided Design: 1 works · 2.5% of their workMathematics: 3 works · 5.7% of their workDiscrete Mathematics and Combinatorics: 2 works · 4.1% of their workGeometry and Topology: 1 works · 1.6% of their workEverything else: 3 works · 5.7% of their workTHEIR WORKMartin Vatshelle44works
Physical Sciences94%

Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.

The fields and subfields, with their numbers
    1. Computer Science3988.6%
    2. Mathematics35.7%
  2. Everything else35.7%
  1. 1Computational Theory and Mathematics66% of their works
  2. 2Computer Networks and Communications16% of their works
  3. 3Artificial Intelligence4% of their works
  4. 4Discrete Mathematics and Combinatorics4% of their works
  5. 5Computer Graphics and Computer-Aided Design2% of their works
  6. 6Geometry and Topology2% of their works

Research topics

Which keywords describe Martin Vatshelle's research?

The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Interconnection Networks and Networks on Chip.

Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.

All 18 words, with their numbers
  1. Approximation Algorithms733 topics
  2. Algorithmic Applications702 topics
  3. Graph Theory381 topic
  4. Parameterized Complexity381 topic
  5. Combinatorial Optimization321 topic
  6. Complexity Theory321 topic
  7. Interconnection Networks101 topic
  8. Networks on Chip101 topic
  9. Graph Labeling71 topic
  10. Metric Dimension71 topic
  11. Mobile Robots61 topic
  12. Online Algorithms61 topic
  13. Graph Limits51 topic
  14. Szemerédi's Theorem51 topic
  15. Constraint Optimization41 topic
  16. Distributed Algorithms41 topic
  17. Delaunay Triangulations31 topic
  18. Mesh Generation31 topic

Where does Martin Vatshelle work?

Martin Vatshelle's main affiliation in the publication record is University of Bergen, Norway.

How many publications and citations does Martin Vatshelle have?

OpenAlex counts 44 works and 897 citations for Martin Vatshelle, an h-index of 17, ranking #1,249,536 of 7,710,434 researchers worldwide on the quality score.

Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.

Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.

Discussion

Ask a question or share a note about Martin Vatshelle. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.