1. Foreword

   • T. Nishizeki
   • R. Tamassia
   • D. Wagner

   Pages: 1 - 2

2. Finding Edge-Disjoint Paths in Partial k -Trees

   • X. Zhou
   • S. Tamura
   • T. Nishizeki

   Pages: 3 - 30

3. Computing Mimicking Networks

   • S. Chaudhuri
   • K. V. Subrahmanyam
   • C. D. Zaroliagis

   Pages: 31 - 49

4. A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs

   • H. Nagamochi
   • S. Nakamura
   • T. Ibaraki

   Pages: 50 - 67

5. On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results

   • U. Föß{}meier
   • M. Kaufmann

   Pages: 68 - 99

6. Efficient Orthogonal Drawings of High Degree Graphs

   • A. Papakostas
   • I. G. Tollis

   Pages: 100 - 125

7. Reconstructing the Topology of a CAD Model—a Discrete Approach

   • K. Weihe
   • T. Willhalm

   Pages: 126 - 147

8. Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals

   • R. H. Möhring
   • M. Müller-Hannemann

   Pages: 148 - 171

9. Practical Performance of Efficient Minimum Cut Algorithms

   • M. Jünger
   • G. Rinaldi
   • S. Thienel

   Pages: 172 - 195