Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
SBCCI '04 Proceedings of the 17th symposium on Integrated circuits and system design
Thick non-crossing paths and minimum-cost flows in polygonal domains
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Constructing pairwise disjoint paths with few links
ACM Transactions on Algorithms (TALG)
Extended minimal routing in 2-D meshes with faulty blocks
International Journal of High Performance Computing and Networking
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
Computational Geometry: Theory and Applications
Reduction rules deliver efficient FPT-algorithms for covering points with lines
Journal of Experimental Algorithmics (JEA)
Algorithms and theory of computation handbook
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Gridless pin access in detailed routing
Proceedings of the 48th Design Automation Conference
Faster algorithms for minimum-link paths with restricted orientations
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximation of octilinear steiner trees constrained by hard and soft obstacles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
GD'09 Proceedings of the 17th international conference on Graph Drawing
Computational Geometry: Theory and Applications
Improved FPT algorithms for rectilinear k-links spanning path
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
BonnRoute: Algorithms and data structures for fast and good VLSI routing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Rectilinear paths with minimum segment lengths
Discrete Applied Mathematics
Computational Geometry: Theory and Applications
| Hi-index | 0.04 |