A. N. Glebov
- Computational Theory and Mathematics top 2%
- Computer Graphics and Computer-Aided Design top 2%
- Discrete Mathematics and Combinatorics top 5%
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Co-authors
- O. V. BorodinAndré RaspaudMohammad R. SalavatipourHajo BroersmaJan van den HeuvelMickaël MontassierÈ. Kh. GimadiA. O. Ivanova
- Topics
- Advanced Graph Theory Research (15 papers)Computational Geometry and Mesh Generation (9 papers)Vehicle Routing Optimization Methods (6 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignDiscrete Mathematics and CombinatoricsComputational Theory and Mathematics
- Partner nations
- RussiaUnited StatesFrance
In The Last Decade
A. N. Glebov
17 papers receiving 244 citations
Peers
Comparison fields: 5 of 21
- Computational Theory and Mathematics 231
- Computer Graphics and Computer-Aided Design 115
- Discrete Mathematics and Combinatorics 78
- Electrical and Electronic Engineering 62
- Computer Networks and Communications 27
Countries citing papers authored by A. N. Glebov
This map shows the geographic impact of A. N. Glebov'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 A. N. Glebov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A. N. Glebov more than expected).
Fields of papers citing papers by A. N. Glebov
This network shows the impact of papers produced by A. N. Glebov. 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 A. N. Glebov. The network helps show where A. N. Glebov may publish in the future.
Co-authorship network of co-authors of A. N. Glebov
This figure shows the co-authorship network connecting the top 25 collaborators of A. N. Glebov. A scholar is included among the top collaborators of A. N. Glebov 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 A. N. Glebov. A. N. Glebov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 2 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 3 | |
| 6 | 7 | |
| 7 | 6 | |
| 8 | 15 | |
| 9 | 17 | |
| 10 | 11 | |
| 11 | 24 | |
| 12 | Path partitions of planar graphs. | 16 |
| 13 | 4 | |
| 14 | 5 | |
| 15 | 85 | |
| 16 | Sufficient conditions for planar graphs to be 2-distance ()-colourable. | 18 |
| 17 | Stars and bunches in planar graphs. Part I: Triangulations | 7 |
| 18 | Stars and bunches in planar graphs. Part II: General planar graphs and colourings | 35 |
About A. N. Glebov
A. N. Glebov is a scholar working on Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics, having authored 18 papers that have together received 257 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (15 papers), Computational Geometry and Mesh Generation (9 papers) and Vehicle Routing Optimization Methods (6 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (115 citations), Discrete Mathematics and Combinatorics (78 citations) and Computational Theory and Mathematics (231 citations). A. N. Glebov has collaborated with scholars based in Russia, United States and France. Frequent co-authors include O. V. Borodin, André Raspaud, Mohammad R. Salavatipour, Hajo Broersma, Jan van den Heuvel, Mickaël Montassier, È. Kh. Gimadi, A. O. Ivanova, Alexandr Kostochka and Torben R. Jensen. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of Combinatorial Theory Series B.
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.