| 2008 |
|---|
| 22 | EE | Jens Maßberg,
Jens Vygen:
Approximation algorithms for a facility location problem with service capacities.
ACM Transactions on Algorithms 4(4): (2008) |
| 21 | EE | 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) |
| 2007 |
|---|
| 20 | EE | Jens Vygen:
New theoretical results on quadratic placement.
Integration 40(3): 305-314 (2007) |
| 19 | EE | Jens Vygen:
From stars to comets: Improved local search for universal facility location.
Oper. Res. Lett. 35(4): 427-433 (2007) |
| 2006 |
|---|
| 18 | EE | Christoph Bartoschek,
Stephan Held,
Dieter Rautenbach,
Jens Vygen:
Efficient generation of short and fast repeater tree topologies.
ISPD 2006: 120-127 |
| 17 | EE | Jens Vygen:
Slack in static timing analysis.
IEEE Trans. on CAD of Integrated Circuits and Systems 25(9): 1876-1885 (2006) |
| 2005 |
|---|
| 16 | EE | Jens Maßberg,
Jens Vygen:
Approximation Algorithms for Network Design and Facility Location with Service Capacities.
APPROX-RANDOM 2005: 158-169 |
| 15 | EE | Jens Vygen:
Geometric quadrisection in linear time, with application to VLSI placement.
Discrete Optimization 2(4): 362-390 (2005) |
| 2004 |
|---|
| 14 | EE | Jens Vygen:
Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption.
IPCO 2004: 308-324 |
| 13 | EE | Ulrich Brenner,
Anna Pauli,
Jens Vygen:
Almost optimum placement legalization by minimum cost flow and dynamic programming.
ISPD 2004: 2-9 |
| 12 | EE | 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) |
| 2003 |
|---|
| 11 | EE | Stephan Held,
Bernhard Korte,
Jens Maßberg,
Matthias Ringe,
Jens Vygen:
Clock Scheduling and Clocktree Construction for High Performance ASICS.
ICCAD 2003: 232-240 |
| 10 | EE | Jens Vygen:
A note on Schrijver's submodular function minimization algorithm.
J. Comb. Theory, Ser. B 88(2): 399-402 (2003) |
| 2002 |
|---|
| 9 | | 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) |
| 2001 |
|---|
| 8 | | 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) |
| 7 | EE | Ulrich Brenner,
Jens Vygen:
Worst-case ratios of networks in the rectilinear plane.
Networks 38(3): 126-139 (2001) |
| 2000 |
|---|
| 6 | EE | Ulrich Brenner,
Jens Vygen:
Faster Optimal Single-Row Placement with Fixed Ordering.
DATE 2000: 117-121 |
| 5 | EE | Jens Vygen:
On dual minimum cost flow algorithms (extended abstract).
STOC 2000: 117-125 |
| 1999 |
|---|
| 4 | EE | Christoph Albrecht,
Bernhard Korte,
Jürgen Schietke,
Jens Vygen:
Cycle time and slack optimization for VLSI-chips.
ICCAD 1999: 232-238 |
| 1998 |
|---|
| 3 | EE | Jens Vygen:
Algorithms for Detailed Placement of Standard Cells.
DATE 1998: 321-324 |
| 1997 |
|---|
| 2 | EE | Jens Vygen:
Algorithms for Large-Scale Flat Placement.
DAC 1997: 746-751 |
| 1995 |
|---|
| 1 | EE | Jens Vygen:
NP-completeness of Some Edge-disjoint Paths Problems.
Discrete Applied Mathematics 61(1): 83-90 (1995) |
