2026 Feodor F. Dragan: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	30	14170	13736	5601	5325	175	3214

Overview

Feodor F. Dragan is affiliated with Kent State University in the United States. Their research primarily lies at the intersection of computer science and mathematics, with a significant focus on computational theory and mathematics.

Their scholarly output includes a number of publications in prominent venues, covering topics in advanced graph theory and its applications. The recent papers authored or co-authored by Dragan include:

A story of diameter, radius, and (almost) Helly property, 2020, published in Networks
Eccentricity function in distance-hereditary graphs, 2020, published in Theoretical Computer Science
Eccentricity terrain of δ-hyperbolic graphs, 2020, published in Journal of Computer and System Sciences
αᵢ-Metric Graphs: Radius, Diameter and all Eccentricities, 2024, published in Algorithmica
Injective Hulls of Various Graph Classes, 2022, published in Graphs and Combinatorics

Frequent co-authors collaborating with Dragan include:

Guillaume Ducoffe
Heather M. Guarnera
Arne Leitert
Michel Habib
Laurent Viennot

The main publication venues for Dragan's work encompass:

arXiv (Cornell University)
Theoretical Computer Science
Journal of Computer and System Sciences
Networks
Algorithmica

Their research spans several fields and subfields of study, including:

Computer Science
Mathematics
Computational Theory and Mathematics
Geometry and Topology
Computer Networks and Communications
Discrete Mathematics and Combinatorics
Computer Graphics and Computer-Aided Design

Dragan's main topics of research involve:

Advanced Graph Theory Research
Graph theory and applications
Graph Labeling and Dimension Problems
Complexity and Algorithms in Graphs
Limits and Structures in Graph Theory
Computational Geometry and Mesh Generation
Geometric and Algebraic Topology

Best Publications

Dually Chordal Graphs

Andreas Brandstädt;Feodor Dragan;Victor Chepoi;Vitaly Voloshin

188
Citations
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs

Victor Chepoi;Feodor Dragan;Bertrand Estellon;Michel Habib

147
Citations
The algorithmic use of hypertree structure and maximum neighbourhood orderings

Andreas Brandstädt;Victor D. Chepoi;Feodor F. Dragan

112
Citations
Metric tree-like structures in real-world networks: an empirical study

Muad Abu-Ata;Feodor F. Dragan

106
Citations
Distance Approximating Trees for Chordal and Dually Chordal Graphs

Andreas Brandstädt;Victor Chepoi;Feodor Dragan

96
Citations
Convexity and HHD-Free Graphs

Feodor F. Dragan;Falk Nicolai;Andreas Brandstädt

96
Citations
Summarizing transactional databases with overlapped hyperrectangles

Yang Xiang;Ruoming Jin;David Fuhry;Feodor F. Dragan

85
Citations
New Graph Classes of Bounded Clique-Width

Andreas Brandstädt;Feodor F. Dragan;Hoàng-Oanh Le;Raffaele Mosca

83
Citations
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs

Victor Chepoi;Feodor F. Dragan;Bertrand Estellon;Michel Habib

77
Citations
Diameter determination on restricted graph families

Derek G. Corneil;Feodor E. Dragan;Michel Habib;Christophe Paul

74
Citations
Tree spanners on chordal graphs: complexity and algorithms

Andreas Brandstädt;Feodor F. Dragan;Hoàng-Oanh Le;Van Bang Le

71
Citations
LexBFS-orderings and powers of chordal graphs

Andreas Brandstädt;Feodor F. Dragan;Falk Nicolai

68
Citations
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph

Victor Chepoi;Feodor F. Dragan

66
Citations
LexBFS-Orderings and Power of Graphs

Feodor F. Dragan;Falk Nicolai;Andreas Brandstädt

65
Citations
A Note on Distance Approximating Trees in Graphs

Victor Chepoi;Feodor Dragan

64
Citations
Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs

Victor Chepoi;Feodor F. Dragan;Bertrand Estellon;Michel Habib

64
Citations
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs

Andreas Brandstädt;Feodor F. Dragan

61
Citations
Dominating Cliques in Distance-Hereditary Graphs

Feodor F. Dragan

61
Citations
On the power of BFS to determine a graph's diameter

Derek G. Corneil;Feodor F. Dragan;Ekkehard Köhler

61
Citations
On stable cutsets in graphs

Andreas Brandstädt;Feodor F. Dragan;Van Bang Le;Thomas Szymczak

60
Citations
Center and diameter problems in plane triangulations and quadrangulations

Victor Chepoi;Feodor Dragan;Yann Vaxès

59
Citations
Provably good global buffering using an available buffer block plan

Feodor F. Dragan;Andrew B. Kahng;Ion Măndoiu;Sudhakar Muddu

58
Citations

Frequent Co-Authors

Victor Chepoi Aix-Marseille University

Andreas Brandstädt University of Rostock

Derek G. Corneil University of Toronto

Michel Habib Université Paris Cité

Ruoming Jin Kent State University

Alexander Zelikovsky Georgia State University

Fedor V. Fomin University of Bergen

Andrew B. Kahng University of California, San Diego

Yuri Breitbart Kent State University

Bin Ren Xiamen University

External Links

Personal website of Feodor F. Dragan

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degree options can open new opportunities for students interested in Computer Science and related fields. Many choose flexible study routes, such as a 1 year computer science degree online, to fast-track their learning and quickly enter the workforce.

For those curious about interdisciplinary applications, other STEM fields also offer excellent online programs. If your interests overlap with sustainability or the natural sciences, you may look into environmental engineering degrees online. These programs provide hands-on skills for solving real-world environmental problems.

Engineering majors are in high demand, and studying online can often be more affordable. Prospective students focused on cost can compare options with this guide to mechanical engineering degree online cost. Planning for the financial side is just as important as choosing the right major.

Career outcomes for Computer Science graduates are diverse. For inspiration, you can discover possible jobs for environmental science majors, many of which overlap with data analysis, software, and technology roles.