NP-completeness of Some Edge-disjoint Paths Problems. - Jens Vygen (Discret. Appl. Math., 1995)

Plazierung im VLSI-Design und ein zweidimensionales Zerlegungsproblem. - Jens Vygen (1996)

Algorithms for Large-Scale Flat Placement. - Jens Vygen (DAC, 1997)

Algorithms for Detailed Placement of Standard Cells. - Jens Vygen (DATE, 1998)

Cycle time and slack optimization for VLSI-chips. - Christoph Albrecht; Bernhard Korte; Jürgen Schietke; Jens Vygen (ICCAD, 1999)

Faster Optimal Single-Row Placement with Fixed Ordering. - Ulrich Brenner; Jens Vygen (DATE, 2000)

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

The edge-disjoint paths problem is NP-complete for series-parallel graphs. - Takao Nishizeki; Jens Vygen; Xiao Zhou 001 (Discret. Appl. Math., 2001)

Worst-case ratios of networks in the rectilinear plane. - Ulrich Brenner; Jens Vygen (Networks, 2001)

Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. - Christoph Albrecht; Bernhard Korte; Jürgen Schietke; Jens Vygen (Discret. Appl. Math., 2002)

On dual minimum cost flow algorithms. - Jens Vygen (Math. Methods Oper. Res., 2002)

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

A note on Schrijver's submodular function minimization algorithm. - Jens Vygen (J. Comb. Theory B, 2003)

Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption. - Jens Vygen (IPCO, 2004)

Almost optimum placement legalization by minimum cost flow and dynamic programming. - Ulrich Brenner; Anna Pauli; Jens Vygen (ISPD, 2004)

Legalizing a placement with minimum total movement. - Ulrich Brenner; Jens Vygen (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2004)

Approximation Algorithms for Network Design and Facility Location with Service Capacities. - Jens Maßberg; Jens Vygen (APPROX-RANDOM, 2005)

Geometric quadrisection in linear time, with application to VLSI placement. - Jens Vygen (Discret. Optim., 2005)

Efficient generation of short and fast repeater tree topologies. - Christoph Bartoschek; Stephan Held; Dieter Rautenbach; Jens Vygen (ISPD, 2006)

Slack in static timing analysis. - Jens Vygen (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2006)

New theoretical results on quadratic placement. - Jens Vygen (Integr., 2007)

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

BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip. - Bernhard Korte; Dieter Rautenbach; Jens Vygen (Proc. IEEE, 2007)

Approximation algorithms for a facility location problem with service capacities. - Jens Maßberg; Jens Vygen (ACM Trans. Algorithms, 2008)

BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms. - Ulrich Brenner; Markus Struzyna; Jens Vygen (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008)

Analytical Methods in Placement. - Ulrich Brenner; Jens Vygen (Handbook of Algorithms for Physical Design Automation, 2008)

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

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

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

Splitting trees at vertices. - Jens Vygen (Discret. Math., 2011)

Faster algorithm for optimum Steiner trees. - Jens Vygen (Inf. Process. Lett., 2011)

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

Combinatorial Optimization in VLSI Design. - Stephan Held; Bernhard Korte; Dieter Rautenbach; Jens Vygen (Combinatorial Optimization - Methods and Applications, 2011)

Algorithms and data structures for fast and good VLSI routing. - Michael Gester; Dirk Müller 003; Tim Nieberg; Christian Panten; Christian Schulte 002; Jens Vygen (DAC, 2012)

Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. - András Sebö; Jens Vygen (CoRR, 2012)

d-dimensional arrangement revisited. - Daniel Rotter; Jens Vygen (Inf. Process. Lett., 2013)

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

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. - András Sebö; Jens Vygen (Comb., 2014)

Global Routing with Inherent Static Timing Constraints. - Stephan Held; Dirk Müller 003; Daniel Rotter; Vera Traub; Jens Vygen (ICCAD, 2015)

Preface. - Jon Lee 001; Jens Vygen (Math. Program., 2015)

Two-connected spanning subgraphs with at most 10/7 OPT edges. - Klaus Heeger; Jens Vygen (CoRR, 2016)

Reassembling Trees for the Traveling Salesman. - Jens Vygen (SIAM J. Discret. Math., 2016)

On the Integrality Gap of the Prize-Collecting Steiner Forest LP. - Jochen Könemann; Neil Olver; Kanstantsin Pashkovich; R. Ravi 001; Chaitanya Swamy; Jens Vygen (APPROX-RANDOM, 2017)

Approaching $ frac{3}{2}$ for the $s$-$t$-path TSP. - Vera Traub; Jens Vygen (CoRR, 2017)

Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. - Stefan Hougardy; Jannik Silvanus; Jens Vygen (Math. Program. Comput., 2017)

Two-Connected Spanning Subgraphs with at Most $ frac{10}{7}{OPT}$ Edges. - Klaus Heeger; Jens Vygen (SIAM J. Discret. Math., 2017)

Approaching for the s-t-path TSP. - Vera Traub; Jens Vygen (SODA, 2018)

Better s-t-tours by Gao trees. - Corinna Gottschalk; Jens Vygen (Math. Program., 2018)

Global Routing With Timing Constraints. - Stephan Held; Dirk Müller 003; Daniel Rotter; Rudolf Scheifele; Vera Traub; Jens Vygen (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018)

An Approximation Algorithm for Threshold Voltage Optimization. - Siad Daboul; Stephan Held; Jens Vygen; Sonja Wittke (ACM Trans. Design Autom. Electr. Syst., 2018)

Vehicle routing with subtours. - Stephan Held; Jochen Könemann; Jens Vygen (Discret. Optim., 2019)

Approaching 3/2 for the s-t-path TSP. - Vera Traub; Jens Vygen (J. ACM, 2019)

An improved upper bound on the integrality ratio for the s-t-path TSP. - Vera Traub; Jens Vygen (Oper. Res. Lett., 2019)

An improved approximation algorithm for ATSP. - Vera Traub; Jens Vygen (STOC, 2020)

The asymmetric traveling salesman path LP has constant integrality ratio. - Anna Köhne; Vera Traub; Jens Vygen (Math. Program., 2020)

Few Sequence Pairs Suffice: Representing All Rectangle Placements. - Jannik Silvanus; Jens Vygen (SIAM J. Discret. Math., 2020)

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Kevin Schewior; Jens Vygen (SIAM J. Discret. Math., 2021)

An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem. - Vera Traub; Jens Vygen (SIAM J. Comput., 2022)

Reducing Path TSP to TSP. - Vera Traub; Jens Vygen; Rico Zenklusen (SIAM J. Comput., 2022)

Improved Guarantees for the a Priori TSP. - Jannis Blauth; Meike Neuwohner; Luise Puhlmann; Jens Vygen (ISAAC, 2023)

Improving the approximation ratio for capacitated vehicle routing. - Jannis Blauth; Vera Traub; Jens Vygen (Math. Program., 2023)

Approximating the discrete time-cost tradeoff problem with bounded depth. - Siad Daboul; Stephan Held; Jens Vygen (Math. Program., 2023)

Approximating Maximum Integral Multiflows on Bounded Genus Graphs. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Jens Vygen (Discret. Comput. Geom., 2023)

Beating the Integrality Ratio for $s$-$t$-Tours in Graphs. - Vera Traub; Jens Vygen (SIAM J. Comput., 2023)

Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. - Jannis Blauth; Stephan Held; Dirk Müller 003; Niklas Schlomberg; Vera Traub; Thorben Tröbst; Jens Vygen (Discret. Optim., 2024)

Cost allocation for set covering: The happy nucleolus. - Jannis Blauth; Antonia Ellerbrock; Vera Traub; Jens Vygen (Oper. Res. Lett., 2024)

Faster goal-oriented shortest path search for bulk and incremental detailed routing. - Markus Ahrens; Dorothee Henke; Stefan Rabenstein; Jens Vygen (Math. Program., 2024)

Packing Cycles in Planar and Bounded-Genus Graphs. - Niklas Schlomberg; Hanjo Thiele; Jens Vygen (SIAM J. Comput., 2025)