Feodor F. Dragan
- Computational Theory and Mathematics top 0.5%
- Computer Networks and Communications top 5%
- Geometry and Topology top 2%
- Discrete Mathematics and Combinatorics top 5%
- Electrical and Electronic Engineering
- Co-authors
- Andreas BrandstädtVictor ChepoiYann VaxèsMichel HabibVitaly VoloshinDavid FuhryRuoming JinEkkehard Köhler
- Topics
- Advanced Graph Theory Research (59 papers)Complexity and Algorithms in Graphs (26 papers)Graph theory and applications (22 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology
- Journals
- SHILAP Revista de lepidopterologíaSIAM Journal on ComputingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Partner nations
- United StatesGermanyFrance
In The Last Decade
Feodor F. Dragan
79 papers receiving 968 citations
Peers
Comparison fields: 5 of 57
- Computational Theory and Mathematics 781
- Computer Networks and Communications 275
- Geometry and Topology 245
- Discrete Mathematics and Combinatorics 147
- Electrical and Electronic Engineering 115
Countries citing papers authored by Feodor F. Dragan
This map shows the geographic impact of Feodor F. Dragan'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 Feodor F. Dragan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Feodor F. Dragan more than expected).
Fields of papers citing papers by Feodor F. Dragan
This network shows the impact of papers produced by Feodor F. Dragan. 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 Feodor F. Dragan. The network helps show where Feodor F. Dragan may publish in the future.
Co-authorship network of co-authors of Feodor F. Dragan
This figure shows the co-authorship network connecting the top 25 collaborators of Feodor F. Dragan. A scholar is included among the top collaborators of Feodor F. Dragan 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 Feodor F. Dragan. Feodor F. Dragan 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 | 0 | |
| 3 | 3 | |
| 4 | 8 | |
| 5 | 1 | |
| 6 | 8 | |
| 7 | 2 | |
| 8 | 1 | |
| 9 | 6 | |
| 10 | 27 | |
| 11 | 16 | |
| 12 | New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs. | 2 |
| 13 | 19 | |
| 14 | 10 | |
| 15 | 21 | |
| 16 | 23 | |
| 17 | 12 | |
| 18 | 6 | |
| 19 | On link diameter of a simple rectilinear polygon | 1 |
| 20 | HT-graphs: centers, connected r-domination and Steiner trees | 18 |
About Feodor F. Dragan
Feodor F. Dragan is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics, having authored 82 papers that have together received 1.0k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (59 papers), Complexity and Algorithms in Graphs (26 papers) and Graph theory and applications (22 papers). The work is most often cited by research in Computational Theory and Mathematics (781 citations), Discrete Mathematics and Combinatorics (147 citations) and Geometry and Topology (245 citations). Feodor F. Dragan has collaborated with scholars based in United States, Germany and France. Frequent co-authors include Andreas Brandstädt, Victor Chepoi, Yann Vaxès, Michel Habib, Vitaly Voloshin, David Fuhry, Ruoming Jin, Ekkehard Köhler, Bertrand Estellon and Hoàng-Oanh Le. Their work appears in journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
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.