Maze Router

A Maze Router is a routing algorithm in electronic design automation that belongs to the class of grid-based pathfinding methods, distinguished by its use of iterative wavefront expansion to find optimal or near-optimal routes between two points on a rectangular grid while avoiding obstacles.

65

Publications

2.3K

Citations

129

Authors

42

Institutions

Publications per year

2017–2026

1

Authors

129

  1. JC
    Jason Cong

    University of California, Los Angeles, United States

    4 publications · 96 citations

    4

    h-index

  2. CC
    Chris Chu

    Iowa State University, United States

    4 publications · 96 citations

    4

    h-index

  3. YX
    Yue Xu

    Iowa State University, United States

    4 publications · 96 citations

    4

    h-index

  4. TW
    Ting-Chi Wang

    National Tsing Hua University, Taiwan

    4 publications · 122 citations

    4

    h-index

  5. YL
    Yih-Lang Li

    National Yang Ming Chiao Tung University, Taiwan

    3 publications · 286 citations

    3

    h-index

1–5 of 129

Venues

  1. 10

    h-index

  2. Design Automation Conference

    Conference · 8 publications · 343 citations

    8

    h-index

  3. European Design Automation Conference

    Conference · 2 publications · 36 citations

    2

    h-index

  4. Proceedings EURO-DAC '92: European Design Automation Conference

    Conference · 1 publications · 15 citations

    1

    h-index

  5. 20th Design Automation Conference Proceedings

    Conference · 1 publications · 24 citations

    1

    h-index

1–5