Jens Vygen

Daniel Rotter, Jens Vygen: d-dimensional arrangement revisited. Inf. Process. Lett. 113(13): 498-505 (2013)

Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen: BonnRoute: Algorithms and data structures for fast and good VLSI routing. ACM Trans. Design Autom. Electr. Syst. 18(2): 32 (2013)

Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen: Algorithms and data structures for fast and good VLSI routing. DAC 2012: 459-464

András Sebö, Jens Vygen: Shorter Tours by Nicer Ears: . CoRR abs/1201.1870 (2012)

Jens Vygen: Splitting trees at vertices. Discrete Mathematics 311(1): 67-69 (2011)

Jens Vygen: Faster algorithm for optimum Steiner trees. Inf. Process. Lett. 111(21-22): 1075-1079 (2011)

Dirk Müller, Klaus Radke, Jens Vygen: Faster min-max resource sharing in theory and practice. Math. Program. Comput. 3(1): 1-35 (2011)

Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen: Combinatorial Optimization in VLSI Design. Combinatorial Optimization - Methods and Applications 2011: 33-96

Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen: The repeater tree construction problem. Inf. Process. Lett. 110(24): 1079-1083 (2010)

Sven Peyer, Dieter Rautenbach, Jens Vygen: A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. J. Discrete Algorithms 7(4): 377-390 (2009)

Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen: Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD 2009: 43-50

William Cook, László Lovász, Jens Vygen (Eds.): Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany. Springer 2009, isbn 978-3-540-76795-4

Jens Maßberg, Jens Vygen: Approximation algorithms for a facility location problem with service capacities. ACM Transactions on Algorithms 4(4) (2008)

Ulrich Brenner, Markus Struzyna, Jens Vygen: BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms. IEEE Trans. on CAD of Integrated Circuits and Systems 27(9): 1607-1620 (2008)

Jens Vygen: New theoretical results on quadratic placement. Integration 40(3): 305-314 (2007)

Jens Vygen: From stars to comets: Improved local search for universal facility location. Oper. Res. Lett. 35(4): 427-433 (2007)

Jens Vygen: Slack in static timing analysis. IEEE Trans. on CAD of Integrated Circuits and Systems 25(9): 1876-1885 (2006)

Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen: Efficient generation of short and fast repeater tree topologies. ISPD 2006: 120-127

Jens Vygen: Geometric quadrisection in linear time, with application to VLSI placement. Discrete Optimization 2(4): 362-390 (2005)

Jens Maßberg, Jens Vygen: Approximation Algorithms for Network Design and Facility Location with Service Capacities. APPROX-RANDOM 2005: 158-169

Ulrich Brenner, Jens Vygen: Legalizing a placement with minimum total movement. IEEE Trans. on CAD of Integrated Circuits and Systems 23(12): 1597-1613 (2004)

Jens Vygen: Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption. IPCO 2004: 308-324

Ulrich Brenner, Anna Pauli, Jens Vygen: Almost optimum placement legalization by minimum cost flow and dynamic programming. ISPD 2004: 2-9

Jens Vygen: A note on Schrijver's submodular function minimization algorithm. J. Comb. Theory, Ser. B 88(2): 399-402 (2003)

Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen: Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD 2003: 232-240

Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen: Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discrete Applied Mathematics 123(1-3): 103-127 (2002)

Jens Vygen: On dual minimum cost flow algorithms. Math. Meth. of OR 56(1): 101-126 (2002)

Takao Nishizeki, Jens Vygen, Xiao Zhou: The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Applied Mathematics 115(1-3): 177-186 (2001)

Ulrich Brenner, Jens Vygen: Worst-case ratios of networks in the rectilinear plane. Networks 38(3): 126-139 (2001)

Ulrich Brenner, Jens Vygen: Faster Optimal Single-Row Placement with Fixed Ordering. DATE 2000: 117-121

Jens Vygen: On dual minimum cost flow algorithms (extended abstract). STOC 2000: 117-125

Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen: Cycle time and slack optimization for VLSI-chips. ICCAD 1999: 232-238

Jens Vygen: Algorithms for Detailed Placement of Standard Cells. DATE 1998: 321-324

Jens Vygen: Algorithms for Large-Scale Flat Placement. DAC 1997: 746-751

Jens Vygen: NP-completeness of Some Edge-disjoint Paths Problems. Discrete Applied Mathematics 61(1): 83-90 (1995)