Sven Peyer

According to our database, Sven Peyer authored at least 6 papers between 2003 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2015

Detailed Routing Algorithms for Advanced Technology Nodes.

Markus Ahrens, Michael Gester, Niko Klewinghaus, Dirk Müller, Sven Peyer, Christian Schulte, Gustavo E. Téllez

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2015

2009

A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing.

Sven Peyer, Dieter Rautenbach, Jens Vygen

J. Discrete Algorithms, 2009

2007

Shortest Paths and Steiner Trees in VLSI Routing

Sven Peyer

PhD thesis, 2007

2006

Yield Improvement by Local Wiring Redundancy.

Jeanne Bickford, Jason Hibbeler, Markus Bühler, Jürgen Koehl, Dirk Müller, Sven Peyer, Christian Schulte

Proceedings of the 7th International Symposium on Quality of Electronic Design (ISQED 2006), 2006

2004

Delay-related secondary objectives for rectilinear Steiner minimum trees.

Sven Peyer, Martin Zachariasen, David Grove Jørgensen

Discret. Appl. Math., 2004

2003

Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles.

Matthias Müller-Hannemann, Sven Peyer

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003