Geometric Routing

Geometric Routing is a computational method in geometric graph theory that determines paths between nodes based on their embedded geometric coordinates, distinguished by its reliance on spatial positions rather than abstract adjacency to guide route selection.

64

Publications

5.4K

Citations

153

Authors

82

Institutions

Publications per year

2017–2026

2

Authors

153

  1. FK
    Fabian Kühn

    ETH Zurich, Switzerland

    6 publications · 1.8K citations

    6

    h-index

  2. AZ
    Aaron Zollinger

    ETH Zurich, Switzerland

    6 publications · 1.8K citations

    6

    h-index

  3. PB
    Prosenjit Bose

    Carleton University, Canada

    5 publications · 183 citations

    5

    h-index

  4. RW
    Rogert Wattenhofer

    ETH Zurich, Switzerland

    5 publications · 1.8K citations

    5

    h-index

  5. NA
    Nael Abu‐Ghazaleh

    Binghamton University, United States

    3 publications · 77 citations

    3

    h-index

1–5 of 153

Venues

  1. Theoretical Computer Science

    3 publications · 272 citations

    3

    h-index

  2. IEEE Communications Letters

    2 publications · 25 citations

    2

    h-index

  3. 2

    h-index

  4. IEEE/ACM Transactions on Networking

    TON · 2 publications · 172 citations

    2

    h-index

  5. Information Processing Letters

    1 publications · 61 citations

    1

    h-index

1–5