Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
A test problem generator for the Steiner problem in graphs
ACM Transactions on Mathematical Software (TOMS)
An architecture-independent approach to FPGA routing based on multi-weighted graphs
EURO-DAC '94 Proceedings of the conference on European design automation
Efficient solutions to multicast routing in communication networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
A new heuristic for rectilinear Steiner trees
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Mickey: a macro cell global router
EURO-DAC '91 Proceedings of the conference on European design automation
A polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An Optimal Share Transfer Problem on Secret Sharing Storage Systems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Proceedings of the 19th international symposium on Physical design
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An optimal share transfer problem on secret sharing storage systems
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
A super-stabilizing log(n)-approximation algorithm for dynamic Steiner trees
Theoretical Computer Science
| Hi-index | 0.00 |