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

Daniel Lokshtanov

Daniel Lokshtanov publishes mostly in Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics, on topics such as Advanced Graph Theory Research, Complexity and Algorithms in Graphs and Optimization and Search Problems.

ORCID 0000-0002-3166-9212 OpenAlex
World rank
#537,888
of 7,710,434 ranked researchers
Rank in Norway
#3,336
of 33,005
Works
506
Citations
9.6k
Citations per work
19.0
h-index
45
i10-index 161Top 1.4% in Computational Theory and Mathematics
Daniel Lokshtanov

What does Daniel Lokshtanov research?

Daniel Lokshtanov's work is mostly in Computer Science (77%), Mathematics (5%), Engineering (3%).

Physical Sciences: 434 works · 85.7% of their workComputer Science: 392 works · 77.4% of their workComputational Theory and Mathematics: 291 works · 57.5% of their workComputer Networks and Communications: 60 works · 11.8% of their workArtificial Intelligence: 24 works · 4.8% of their workComputer Graphics and Computer-Aided Design: 17 works · 3.3% of their workMathematics: 27 works · 5.4% of their workDiscrete Mathematics and Combinatorics: 27 works · 5.4% of their workEngineering: 15 works · 2.9% of their workElectrical and Electronic Engineering: 15 works · 2.9% of their workEverything else: 72 works · 14.3% of their workTHEIR WORKDaniel Lokshtanov506works
Physical Sciences86%

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 Science39277.4%
    2. Mathematics275.4%
    3. Engineering152.9%
  2. Everything else7214.3%
  1. 1Computational Theory and Mathematics57% of their works
  2. 2Computer Networks and Communications12% of their works
  3. 3Discrete Mathematics and Combinatorics5% of their works
  4. 4Artificial Intelligence5% of their works
  5. 5Computer Graphics and Computer-Aided Design3% of their works
  6. 6Electrical and Electronic Engineering3% of their works

Research topics

Which keywords describe Daniel Lokshtanov's research?

The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Graph Limits and Mobile Robots.

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.

All 18 words, with their numbers
  1. Approximation Algorithms7433 topics
  2. Algorithmic Applications6952 topics
  3. Graph Theory3961 topic
  4. Parameterized Complexity3961 topic
  5. Combinatorial Optimization2991 topic
  6. Complexity Theory2991 topic
  7. Graph Limits741 topic
  8. Mobile Robots741 topic
  9. Online Algorithms741 topic
  10. Szemerédi's Theorem741 topic
  11. Graph Labeling721 topic
  12. Metric Dimension721 topic
  13. Interconnection Networks591 topic
  14. Networks on Chip591 topic
  15. Delaunay Triangulations481 topic
  16. Mesh Generation481 topic
  17. Compression301 topic
  18. Suffix Arrays301 topic

Where does Daniel Lokshtanov work?

Daniel Lokshtanov's main affiliation in the publication record is University of Bergen, Norway.

How many publications and citations does Daniel Lokshtanov have?

OpenAlex counts 506 works and 9,629 citations for Daniel Lokshtanov, an h-index of 45, ranking #537,888 of 7,710,434 researchers worldwide on the quality score.

Ranked on field-normalised 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 Daniel Lokshtanov. Posts are plain text and can be reported.