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
Parents
65
Jiří Soukup · Design Automation Conference · 1978 · 137 citations
CUGR: Detailed-Routability-Driven 3D Global Routing with Probabilistic Resource Model
Jinwei Liu, Chak-Wa Pui, Fangzhou Wang et al. · 2020 · 93 citations
Minsik Cho, David Z. Pan · 2006 · 83 citations
1–5 of 65
129
4
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 129
42
National Tsing Hua University
Hsinchu, Taiwan
6 h-index
13 publications
343 citations
University of California, Los Angeles
Los Angeles, United States
4 h-index
9 publications
236 citations
Iowa State University
Ames, United States
4 h-index
10 publications
244 citations
University of California, Berkeley
Berkeley, United States
4 h-index
19 publications
547 citations
Universidade Federal do Rio Grande do Sul
Porto Alegre, Brazil
3 h-index
9 publications
117 citations
IBM (United States)
Armonk, United States
3 h-index
6 publications
91 citations
The University of Texas at Austin
Austin, United States
3 h-index
5 publications
382 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
3 h-index
8 publications
821 citations
1–8 of 42
10 publications · 485 citations
10
h-index
Conference · 8 publications · 343 citations
8
h-index
Conference · 2 publications · 36 citations
2
h-index
Conference · 1 publications · 15 citations
1
h-index
Conference · 1 publications · 24 citations
1
h-index
1–5