Timing-driven routing for symmetrical array-based FPGAs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Dimensioning server access bandwidth and multicast routing in overlay networks
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Semi-online maintenance of geometric optima and measures
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum Restricted Diameter Spanning Trees
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Facility Location and the Geometric Minimum-Diameter Spanning Tree
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Building bridges between convex regions
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Facility location and the geometric minimum-diameter spanning tree
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
A distributed algorithm for constructing a minimum diameter spanning tree
Journal of Parallel and Distributed Computing
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the minimum diameter spanning tree problem
Information Processing Letters
An efficient phase detector connection structure for the skew synchronization system
Proceedings of the 47th Design Automation Conference
Algorithms and theory of computation handbook
Euclidean chains and their shortcuts
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Minimum-sum dipolar spanning tree in R3
Computational Geometry: Theory and Applications
Euclidean chains and their shortcuts
Theoretical Computer Science
Bounded-degree minimum-radius spanning trees in wireless sensor networks
Theoretical Computer Science
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
| Hi-index | 0.00 |