Jens Vygen

Homepage [deutsche Fassung]

Address: Research Institute for Discrete Mathematics University of Bonn Lennéstr. 2, D-53113 Bonn, Germany Phone: +49 - 228 - 73 87 70 E-Mail: vygen@or.uni-bonn.de Fields of work: Combinatorial optimization VLSI design Book: B. Korte, J. Vygen : Combinatorial Optimization: Theory and Algorithms. Algorithms and Combinatorics 21; Springer, Berlin Heidelberg New York 2000. Second edition 2002 More information from Springer-Verlag New York More Information from Springer-Verlag Germany

Selected Recent Papers:

• U. Brenner, J. Vygen : Faster Optimal Single-Row Placement with Fixed Ordering. Design, Automation and Test in Europe, Proceedings, IEEE 2000, 117-121
• T. Nishizeki, J. Vygen, X. Zhou : The Edge-Disjoint Paths Problem is NP-complete for Series-Parallel Graphs. Proceedings of the 1st Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 1999, 103-110; Discrete Applied Mathematics 115 (2001), 177-186
• U. Brenner, J. Vygen : Worst-Case Ratios of Networks in the Rectilinear Plane. Networks 38 (2001), 126-139
• J. Vygen : On Dual Minimum Cost Flow Algorithms. Mathematical Methods of Operations Research 56 (2002), 101-126 Extended abstract in the Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing (2000), 117-125
• C. Albrecht, B. Korte, J. Schietke, J. Vygen : Maximum Mean Weight Cycle in a Digraph and Minimizing Cycle Time of a Logic Chip. Discrete Applied Mathematics 123 (2002), 103-127
• J. Vygen : Theory of VLSI Layout. Habilitation thesis, University of Bonn, 2001
• J. Vygen : A Note on Schrijver's Submodular Function Minimization Algorithm. Report No. 02917-OR, Research Institute for Discrete Mathematics, University of Bonn, 2002. Accepted for publication in the Journal of Combinatorial Theory B
• J. Vygen : Four-way partitioning of two-dimensional sets. Report No. 00900-OR, Research Institute for Discrete Mathematics, University of Bonn
• J. Vygen : New Theoretical Results on Quadratic Placement. Report No. 02920-OR, Research Institute for Discrete Mathematics, University of Bonn, 2002
• U. Brenner, J. Vygen : Legalizing a Placement with Minimum Total Movement. Manuscript, 2002

Selected lectures and seminars:

• Seminar on randomized algorithms (winter 1997/98)
• Lecture on polyhedral combinatorics (winter 1997/98)
• Seminar on disjoint paths and Steiner trees (summer 1998)
• Lecture on approximation algorithms (summer 1998)
• Seminar on data structures for discrete optimization problems (summer 1999)
• Lecture on duality in combinatorial optimization (winter 1999/2000)
• Proseminar (winter 1999/2000)
• Seminar on greedoids (summer 2000)
• Lecture on submodular functions (winter 2000/01)
• Seminar on algorithms for planar graphs (winter 2000/01)
• Practical course on algorithms in VLSI-Design (winter 2000/01)
• Lecture on algorithms in VLSI-Design (summer 2001)
• Seminar on facility location problems (summer 2001)
• Practical course on visualization of algorithms (summer 2001)
• Seminar on graph drawing (winter 2001/02)
• Lecture on Steiner trees (winter 2001/02)
• Seminar on general flow problems (summer 2002)
• Lecture on methods of combinatorial optimization (summer 2002)
• Lecture on the traveling salesman problem (winter 2002/03)
• Practical programming course on graph algorithms (summer 2003)
• Proseminar on linear programming (summer 2003)
• Seminar on approximation algorithms (summer2003)
• Lecture on data structures for efficient algorithms (summer 2003)
• other courses at the Research Institute for Discrete Mathematics

Current editorial and program committee activities etc.:

• Associate Editor of Operations Research Letters
• Member of the program committee of the Ninth International Conference on Integer Programming and Combinatorial Optimization (IPCO 2002)
• Member of the program committee of the International Conference on Computer-Aided Design (ICCAD 2002)
• Organization of an invited full-day tutorial on: Placement - The Key Problem in Physical Design at the ICCAD on November 14, 2002
• Member od the program committee of the 11th European Symposium on Algorithms (ESA 2003)