A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On complexity of a message-routing strategy for multicomputer systems
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
Performance oriented rectilinear Steiner trees
DAC '93 Proceedings of the 30th international Design Automation Conference
Performance-driven Steiner tree algorithm for global routing
DAC '93 Proceedings of the 30th international Design Automation Conference
Minimal delay interconnect design using alphabetic trees
DAC '94 Proceedings of the 31st annual Design Automation Conference
Buffer insertion and sizing under process variations for low power clock distribution
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constructing Minimal Spanning/Steiner Trees with Bounded Path Length
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |