Erhan Erkut

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Engineering and Technology D-index 35 Citations 6,913 69 World Ranking 5144 National Ranking 24

Overview

What are the main themes of his work throughout his whole career to date

His study in Constrained Shortest Path First extends to Shortest path problem with its themes. His Constrained Shortest Path First study frequently draws connections between related disciplines such as K shortest path routing. K shortest path routing and Graph are frequently intertwined in his study. Graph and Discrete mathematics are commonly linked in his work. His research ties Shortest path problem and Discrete mathematics together. Erhan Erkut regularly ties together related areas like Programming language in his Path (computing) studies. Programming language is often connected to Path (computing) in his work. His research on Mathematical optimization often connects related topics like Maximization. His Maximization study typically links adjacent topics like Mathematical optimization.

Erhan Erkut most often published in these fields:

Shortest path problem (100.00%)
Path (computing) (100.00%)
Mathematical optimization (100.00%)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.