Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Vygen, Jens - Forschungsinstitut für Diskrete Mathematik, Universität Bonn
Resource Sharing Hangzhou, April 2009
Global Routing Hangzhou, April 2009
d-Dimensional Arrangement Revisited Daniel Rotter Jens Vygen
Chapter 17: Analytical Methods in VLSI Placement
Approximation Algorithms for Facility Location Problems
Faster Algorithm for Optimum Steiner Trees University of Bonn
Faster Resource Sharing and Global Routing in Theory and Practice
Steiner Trees in Chip Design Hangzhou, March 2009
Detailed Routing Hangzhou, March 2009
Combinatorial Optimization in Chip Design University of Bonn
Combinatorial Optimization and Applications in VLSI Design
Combinatorial Optimization in VLSI Placement and Routing
Combinatorial Problems in Chip Design Bernhard Korte Jens Vygen
Faster algorithm for optimum Steiner trees
The Repeater Tree Construction Problem C. Bartoschek1
Faster Min-Max Resource Sharing in Theory and Practice
Approximation Algorithms for Facility Location University of Bonn
Splitting trees at vertices Research Institute for Discrete Mathematics, University of Bonn
Preface to the Fourth Edition With four English editions, and translations into four other languages forthcoming,
Preface to the Fifth Edition When preparing the first edition of this book, more than ten years ago, we tried to
