Shortest Paths

Shortest Paths is a fundamental graph-theoretic construct in geometric graphs that identifies the minimum-length path between two vertices, where the length is measured as the sum of Euclidean edge weights along the path.

3.1K

Publications

204.3K

Citations

6.6K

Authors

1.9K

Institutions

Publications per year

2017–2026

637

Authors

6.6K

  1. JS
    Joseph S. B. Mitchell

    Stony Brook University, United States

    17 publications · 1.2K citations

    17

    h-index

  2. SS
    Subhash Suri

    University of California, Santa Barbara, United States

    17 publications · 1.3K citations

    16

    h-index

  3. JH
    John Hershberger

    Stanford University, United States

    17 publications · 1.8K citations

    16

    h-index

  4. UZ
    Uri Zwick

    Tel Aviv University, Israel

    17 publications · 1.7K citations

    16

    h-index

  5. DN
    Danupon Nanongkai

    University of Vienna, Austria

    17 publications · 692 citations

    15

    h-index

1–5 of 6.6K

Venues

  1. SIAM Journal on Computing

    58 publications · 6.9K citations

    38

    h-index

  2. Networks

    75 publications · 5.9K citations

    36

    h-index

  3. Algorithmica

    33 publications · 1.7K citations

    23

    h-index

  4. European Journal of Operational Research

    29 publications · 2.3K citations

    23

    h-index

  5. Journal of the ACM

    JACM · 24 publications · 7.1K citations

    21

    h-index

1–5