Items where Subject is "68-XX Computer science > 68Wxx Algorithms > 68W35 VLSI algorithms"
![]() | Up a level |
- MSC Classification Numbers (11)
- 68-XX Computer science (11)
- 68Wxx Algorithms (11)
- 68W35 VLSI algorithms (11)
- 68Wxx Algorithms (11)
- 68-XX Computer science (11)
B
Bastert, Oliver and Fekete, Sandor P.
(1998)
Geometric Wire Routing.
Technical Report
p.
Bastert, Oliver and Fekete, Sandor P.
(1996)
Geometrische Verdrahtungsprobleme.
Technical Report
, 81 p.
D
Dahlhaus, Elias
(1998)
Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization (Extended Abstract).
Published In:
Theoretical informatics : proceedings / LATIN '98, Third Latin American Symposium, Campinas, Brazil, April 20 - 24, 1998, Lecture notes in computer science. 1380 Springer 1998, pp. 239-248.
Dahlhaus, Elias
(1998)
A Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization.
Technical Report
, 18 p.
F
Fuchs, Bernhard and Schulze, Anna
(2009)
A Fast 2-Approximation of Minimum Manhattan Networks.
Technical Report
, 27 p.
Fuchs, Bernhard and Schulze, Anna
(2008)
A Simple 3-Approximation of Minimum Manhattan Networks.
Technical Report
, 16 p.
M
Müller-Hannemann, Matthias and Schulze, Anna
(2006)
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.
Published In:
Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6 - 8, 2006 ; proceedings, Lecture Notes in Computer Science. 4059 Springer 2006, pp. 242-254.
Müller-Hannemann, Matthias and Schulze, Anna
(2006)
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.
Technical Report
, 22 p.
Müller-Hannemann, Matthias and Schulze, Anna
(2005)
Hardness and Approximation of Octilinear Steiner Trees.
Published In:
Algorithms and computation 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005 ; proceedings, Lecture Notes in Computer Science. 3827 Springer 2005, pp. 256-265.
Müller-Hannemann, Matthias and Schulze, Anna
(2007)
Hardness and Approximation of Octilinear Steiner Trees.
Published in:
International Journal of Computational Geometry and Applications (IJCGA) Vol. 17 (3).
pp. 231-260.
S
Schwikowski, B. and Speckenmeyer, Ewald
(1997)
On computing all minimal solutions for feedback problems.
Technical Report
, 10 p.