Danil Sagunov
Danil Sagunov 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 Limits and Structures in Graph Theory.
- World rank
- #6,811,064 of 7,710,434 ranked researchers
- Rank in Norway
- #31,924 of 33,005
- Works
- 48
- Citations
- 45
- Citations per work
- 0.9
What does Danil Sagunov research?
Danil Sagunov's work is mostly in Computer Science (66%), Mathematics (9%), Decision Sciences (6%).
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
- Physical Sciences3675.6%
- Computer Science3266.2%
- Mathematics59.4%
- Everything else613.4%
- Social Sciences511.0%
- 1Computational Theory and Mathematics46% of their works
- 2Computer Networks and Communications13% of their works
- 3Discrete Mathematics and Combinatorics9% of their works
- 4Artificial Intelligence7% of their works
- 5Management Science and Operations Research6% of their works
- 6Economics and Econometrics6% of their works
Research topics
Which keywords describe Danil Sagunov's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Graph Limits and Mechanism Design.
- Auction Theory
- Graph Labeling
- Constraint Optimization
- Mobile Robots
- Coalition Formation
- Mechanism Design
- Complexity Theory
- Parameterized Complexity
- Approximation Algorithms
- Algorithmic Applications
- Graph Theory
- Combinatorial Optimization
- Graph Limits
- Szemerédi's Theorem
- Matching Theory
- Online Algorithms
- Distributed Algorithms
- Metric Dimension
- Procurement Contracts
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 19 words, with their numbers
- Algorithmic Applications512 topics
- Approximation Algorithms512 topics
- Graph Theory281 topic
- Parameterized Complexity281 topic
- Combinatorial Optimization231 topic
- Complexity Theory231 topic
- Graph Limits111 topic
- Mechanism Design112 topics
- Szemerédi's Theorem111 topic
- Coalition Formation71 topic
- Matching Theory71 topic
- Mobile Robots71 topic
- Online Algorithms71 topic
- Constraint Optimization61 topic
- Distributed Algorithms61 topic
- Graph Labeling61 topic
- Metric Dimension61 topic
- Auction Theory41 topic
- Procurement Contracts41 topic
Where does Danil Sagunov work?
Danil Sagunov's main affiliation in the publication record is University of Bergen, Norway.
How many publications and citations does Danil Sagunov have?
OpenAlex counts 48 works and 45 citations for Danil Sagunov, an h-index of 4, ranking #6,811,064 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 Danil Sagunov. Posts are plain text and can be reported.