Book Chapter
A new approach to knock-knee channel routing
Dorothea Wagner
Lecture Notes in Computer Science, 1991, Volume 557, ISA'91 Algorithms, Pages 83-93
Book Chapter
Channel routing with short wires
Michael Kaufmann and Ioannis G. Tollis
Lecture Notes in Computer Science, 1988, Volume 319, VLSI Algorithms and Architectures, Pages 226-236
Book Chapter
Top-down VLSI design experiments on a picture database computer
Kazunori Yamaguchi and Tosiyasu L. Kunii
Lecture Notes in Computer Science, 1984, Volume 163, VLSI Engineering, Pages 228-255
Book Chapter
Computing Optimal Embeddings for Planar Graphs
Petra Mutzel and René Weiskircher
Lecture Notes in Computer Science, 2000, Volume 1858, Computing and Combinatorics, Pages 95-104
Book Chapter
Fifty-Plus Years of Combinatorial Integer Programming
William Cook
2010, 50 Years of Integer Programming 1958-2008, Part 2, Pages 387-430
Journal Article
Algorithms for finding optimum trees: Description, use and evaluation
P. M. Camerini, G. Galbiati and F. Maffioli
Annals of Operations Research, 1988, Volume 13, Number 1, Pages 263-397
Journal Article
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
J. F. Pekny and D. L. Miller
Mathematical Programming, 1992, Volume 55, Numbers 1-3, Pages 17-33
Book Chapter
Large-Scale Circuit Placement
Ameya Agnihotri, Satoshi Ono, Mehmet Yildiz and Patrick Madden
Integrated Circuits and Systems, 2006, High-Performance Energy-Efficient Microprocessor Design, Pages 121-146
Book Chapter
Tight lower bounds for computing shortest paths on proper interval and bipartite permutation graphs
Lin Chen
Lecture Notes in Computer Science, 1997, Volume 1277, Parallel Computing Technologies, Pages 7-12
Book Chapter
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
Reuven Bar-Yehuda and Dror Rawitz
Lecture Notes in Computer Science, 2001, Volume 2129, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, Pages 24-36