Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A new heuristic for rectilinear Steiner trees
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
On the Number of Simple Cycles in Planar Graphs
Combinatorics, Probability and Computing
| Hi-index | 0.00 |