Jens Vygen
Cited by
Cited by
Combinatorial Optimization: Theory and Algorithms
B Korte, J Vygen
Springer, 2000
Algorithms for large-scale flat placement
J Vygen
Proceedings of the 34th Annual Design Automation Conference, 746-751, 1997
Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
A Sebő, J Vygen
Combinatorica 34, 597-629, 2014
Approximation Algorithms for Facility Location Problems
J Vygen
Forschungsinstitut für Diskrete Mathematik, 2005
Kombinatorische Optimierung
B Korte, J Vygen
Springer-Verlag, 2008
NP-completeness of some edge-disjoint paths problems
J Vygen
Discrete Applied Mathematics 61 (1), 83-90, 1995
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
S Peyer, D Rautenbach, J Vygen
Journal of Discrete Algorithms 7 (4), 377-390, 2009
The edge-disjoint paths problem is NP-complete for series–parallel graphs
T Nishizeki, J Vygen, X Zhou
Discrete Applied Mathematics 115 (1-3), 177-186, 2001
Cycle time and slack optimization for VLSI-chips
C Albrecht, B Korte, J Schietke, J Vygen
1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of …, 1999
Almost optimum placement legalization by minimum cost flow and dynamic programming
U Brenner, A Pauli, J Vygen
Proceedings of the 2004 international symposium on Physical design, 2-9, 2004
Faster optimal single-row placement with fixed ordering
U Brenner, J Vygen
Proceedings Design, Automation and Test in Europe Conference and Exhibition …, 2000
Clock scheduling and clocktree construction for high performance ASICs
S Held, B Korte, J Maßberg, M Ringe, J Vygen
ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No …, 2003
Legalizing a placement with minimum total movement
U Brenner, J Vygen
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2004
Algorithms for detailed placement of standard cells
J Vygen
Proceedings Design, Automation and Test in Europe, 321-324, 1998
BonnRoute: Algorithms and data structures for fast and good VLSI routing
M Gester, D Müller, T Nieberg, C Panten, C Schulte, J Vygen
ACM Transactions on Design Automation of Electronic Systems (TODAES) 18 (2 …, 2013
On dual minimum cost flow algorithms
J Vygen
Mathematical Methods of Operations Research 56 (1), 101-126, 2002
BonnPlace: Placement of leading-edge chips by advanced combinatorial algorithms
U Brenner, M Struzyna, J Vygen
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2008
Near-optimum global routing with coupling, delay bounds, and power consumption
J Vygen
International Conference on Integer Programming and Combinatorial …, 2004
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
C Albrecht, B Korte, J Schietke, J Vygen
Discrete Applied Mathematics 123 (1-3), 103-127, 2002
Disjoint Paths
J Vygen
Research Institute for Discrete Mathematics, University of Bonn, 1994
The system can't perform the operation now. Try again later.
Articles 1–20