Fedor V. Fomin
Fedor V. Fomin 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 Graph Labeling and Dimension Problems.
- World rank
- #359,874 of 7,710,434 ranked researchers
- Rank in Norway
- #2,143 of 33,005
- Works
- 685
- Citations
- 14k
- Citations per work
- 20.4
What does Fedor V. Fomin research?
Fedor V. Fomin's work is mostly in Computer Science (77%), Mathematics (4%), Engineering (2%).
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 Sciences57183.3%
- Computer Science52977.2%
- Mathematics274.0%
- Engineering142.1%
- Everything else11416.7%
- 1Computational Theory and Mathematics58% of their works
- 2Computer Networks and Communications11% of their works
- 3Artificial Intelligence6% of their works
- 4Discrete Mathematics and Combinatorics4% of their works
- 5Computer Graphics and Computer-Aided Design3% of their works
- 6Electrical and Electronic Engineering2% of their works
Research topics
Which keywords describe Fedor V. Fomin's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Graph Labeling and Metric Dimension.
- Suffix Arrays
- Mesh Generation
- Networks on Chip
- Szemerédi's Theorem
- Online Algorithms
- Metric Dimension
- Complexity Theory
- Parameterized Complexity
- Algorithmic Applications
- Approximation Algorithms
- Graph Theory
- Combinatorial Optimization
- Graph Labeling
- Mobile Robots
- Graph Limits
- Interconnection Networks
- Delaunay Triangulations
- Compression
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
- Approximation Algorithms9463 topics
- Algorithmic Applications8962 topics
- Graph Theory5211 topic
- Parameterized Complexity5211 topic
- Combinatorial Optimization3751 topic
- Complexity Theory3751 topic
- Graph Labeling1511 topic
- Metric Dimension1511 topic
- Mobile Robots981 topic
- Online Algorithms981 topic
- Graph Limits721 topic
- Szemerédi's Theorem721 topic
- Interconnection Networks681 topic
- Networks on Chip681 topic
- Delaunay Triangulations501 topic
- Mesh Generation501 topic
- Compression401 topic
- Suffix Arrays401 topic
Where does Fedor V. Fomin work?
Fedor V. Fomin's main affiliation in the publication record is University of Bergen, Norway.
How many publications and citations does Fedor V. Fomin have?
OpenAlex counts 685 works and 13,949 citations for Fedor V. Fomin, an h-index of 56, ranking #359,874 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 Fedor V. Fomin. Posts are plain text and can be reported.