Rip-up
Rip-Up is a routing algorithmic technique in electronic design automation that belongs to the class of iterative improvement methods, distinguished by its strategy of selectively removing existing routing paths to enable the reconstruction of higher-quality routes that overcome local optimality traps.
24
Publications
802
Citations
57
Authors
23
Institutions
Publications per year
2017–2026
2
Parents
24
1–5 of 24
57
3
h-index
3 publications · 96 citations
3
h-index
University of Illinois Urbana-Champaign, United States
3 publications · 152 citations
3
h-index
2
h-index
2
h-index
1–5 of 57
23
National Tsing Hua University
Hsinchu, Taiwan
5 h-index
9 publications
391 citations
Intel (United States)
Santa Clara, United States
3 h-index
3 publications
152 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
3 publications
152 citations
IBM Research - Austin
Austin, United States
2 h-index
9 publications
218 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
1 h-index
5 publications
60 citations
Mitsubishi Group (Japan)
Tokyo, Japan
1 h-index
3 publications
48 citations
IBM (United States)
Armonk, United States
1 h-index
3 publications
72 citations
University of Michigan
Ann Arbor, United States
1 h-index
2 publications
52 citations
1–8 of 23
4 publications · 189 citations
4
h-index
Conference · 2 publications · 129 citations
2
h-index
Conference · 2 publications · 50 citations
2
h-index
Conference · 1 publications · 49 citations
1
h-index
Conference · 1 publications · 33 citations
1
h-index
1–5