Maze Routing

Maze Routing is a path-finding algorithm in Very-Large-Scale Integration layout design that belongs to the class of grid-based routing methods and is distinguished by its systematic exploration of all possible paths in a grid to determine the shortest or optimal route between two points while avoiding obstacles.

124

Publications

5.6K

Citations

249

Authors

85

Institutions

Publications per year

2017–2026

8

Authors

249

  1. MD
    Martin D. F. Wong

    University of Illinois Urbana-Champaign, United States

    9 publications · 427 citations

    9

    h-index

  2. CC
    Chris Chu

    Iowa State University, United States

    9 publications · 537 citations

    9

    h-index

  3. JF
    Jie Fang

    Fuzhou University, China

    6 publications · 259 citations

    6

    h-index

  4. YX
    Yue Xu

    Iowa State University, United States

    6 publications · 289 citations

    6

    h-index

  5. KK
    Kei-Yong Khoo

    University of California, Los Angeles, United States

    6 publications · 191 citations

    6

    h-index

1–5 of 249

Venues

  1. 18

    h-index

  2. Design Automation Conference

    Conference · 7 publications · 326 citations

    7

    h-index

  3. European Design Automation Conference

    Conference · 2 publications · 36 citations

    2

    h-index

  4. 2

    h-index

  5. ACM Transactions on Design Automation of Electronic Systems

    TODAES · 2 publications · 33 citations

    2

    h-index

1–5