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
124
The surgical treatment of atrial fibrillation. IV. Surgical technique.
Jafna L. Cox · PubMed · 1991 · 484 citations
Medicine, Cardiology, Surgery +11
Jiří Soukup · Design Automation Conference · 1978 · 137 citations
1–5 of 124
249
University of Illinois Urbana-Champaign, United States
9 publications · 427 citations
9
h-index
9
h-index
6
h-index
6
h-index
6
h-index
1–5 of 249
85
The University of Texas at Austin
Austin, United States
11 h-index
28 publications
1.4K citations
Iowa State University
Ames, United States
9 h-index
22 publications
1.3K citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
10 publications
384 citations
University of California, Los Angeles
Los Angeles, United States
7 h-index
16 publications
475 citations
National Tsing Hua University
Hsinchu, Taiwan
6 h-index
13 publications
343 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
6 h-index
16 publications
1K citations
Intel (United States)
Santa Clara, United States
5 h-index
7 publications
350 citations
Universidade Federal do Rio Grande do Sul
Porto Alegre, Brazil
5 h-index
12 publications
152 citations
1–8 of 85
22 publications · 864 citations
18
h-index
Conference · 7 publications · 326 citations
7
h-index
Conference · 2 publications · 36 citations
2
h-index
Conference · 2 publications · 71 citations
2
h-index
TODAES · 2 publications · 33 citations
2
h-index
1–5