World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
3214
World Ranking
14167
National Ranking
5599

Feodor F. Dragan publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Feodor F. Dragan sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 175 publications — 37th percentile

37% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Feodor F. Dragan D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Feodor F. Dragan sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 30 D-Index — 3rd percentile

3% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

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

    Victor Chepoi;Feodor Dragan;Bertrand Estellon;Michel Habib

  • The algorithmic use of hypertree structure and maximum neighbourhood orderings

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

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

    Muad Abu-Ata;Feodor F. Dragan

  • Distance Approximating Trees for Chordal and Dually Chordal Graphs

    Andreas Brandstädt;Victor Chepoi;Feodor Dragan

  • Convexity and HHD-Free Graphs

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

  • Summarizing transactional databases with overlapped hyperrectangles

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

  • New Graph Classes of Bounded Clique-Width

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

  • Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs

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

  • Diameter determination on restricted graph families

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

  • Tree spanners on chordal graphs: complexity and algorithms

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

  • LexBFS-orderings and powers of chordal graphs

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

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

    Victor Chepoi;Feodor F. Dragan

  • LexBFS-Orderings and Power of Graphs

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

  • A Note on Distance Approximating Trees in Graphs

    Victor Chepoi;Feodor Dragan

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

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

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

    Andreas Brandstädt;Feodor F. Dragan

  • Dominating Cliques in Distance-Hereditary Graphs

    Feodor F. Dragan

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

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

  • On stable cutsets in graphs

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

  • Center and diameter problems in plane triangulations and quadrangulations

    Victor Chepoi;Feodor Dragan;Yann Vaxès

  • Provably good global buffering using an available buffer block plan

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

Frequent Co-Authors

Victor Chepoi
Victor Chepoi Aix-Marseille University
Andreas Brandstädt
Andreas Brandstädt University of Rostock
Derek G. Corneil
Derek G. Corneil University of Toronto
Michel Habib
Michel Habib Université Paris Cité
Ruoming Jin
Ruoming Jin Kent State University
Alexander Zelikovsky
Alexander Zelikovsky Georgia State University
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Andrew B. Kahng
Andrew B. Kahng University of California, San Diego
Yuri Breitbart
Yuri Breitbart Kent State University
Bin Ren
Bin Ren Xiamen University

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Feodor F. Dragan

Trending Scientists

Recently Published Articles