Jens Vygen

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 55

Top Venues

CoRR

Math. Program.

IPCO

SIAM J. Discret. Math.

University of Bonn (PHD)

Education History

University of Bonn

PHD

Publications

Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
Faster goal-oriented shortest path search for bulk and incremental detailed routing. Math. Program. 206 (1) (2024)
Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen
Cost Allocation for Set Covering: the Happy Nucleolus. CoRR (2024)
Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. Discret. Optim. 53 (2024)
Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
Improved Guarantees for the a Priori TSP. ISAAC (2023)
Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
Improved guarantees for the a priori TSP. CoRR (2023)
Vera Traub, Jens Vygen
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs. SIAM J. Comput. 52 (6) (2023)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. Discret. Comput. Geom. 70 (4) (2023)
Niklas Schlomberg, Hanjo Thiele, Jens Vygen
Packing cycles in planar and bounded-genus graphs. SODA (2023)
Jannis Blauth, Vera Traub, Jens Vygen
Improving the approximation ratio for capacitated vehicle routing. Math. Program. 197 (2) (2023)
Siad Daboul, Stephan Held, Jens Vygen
Approximating the discrete time-cost tradeoff problem with bounded depth. Math. Program. 197 (2) (2023)
Niklas Schlomberg, Hanjo Thiele, Jens Vygen
Packing cycles in planar and bounded-genus graphs. CoRR (2022)
Vera Traub, Jens Vygen
An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem. SIAM J. Comput. 51 (1) (2022)
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. IPCO (2022)
Vera Traub, Jens Vygen, Rico Zenklusen
Reducing Path TSP to TSP. SIAM J. Comput. 51 (3) (2022)
Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks. CoRR (2022)
Jannis Blauth, Vera Traub, Jens Vygen
Improving the Approximation Ratio for Capacitated Vehicle Routing. IPCO (2021)
Siad Daboul, Stephan Held, Jens Vygen
Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. IPCO (2021)
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. CoRR (2021)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. SIAM J. Discret. Math. 35 (2) (2021)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. ICALP (2021)
Jannis Blauth, Vera Traub, Jens Vygen
Improving the Approximation Ratio for Capacitated Vehicle Routing. CoRR (2020)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. CoRR (2020)
Jannik Silvanus, Jens Vygen
Few Sequence Pairs Suffice: Representing All Rectangle Placements. SIAM J. Discret. Math. 34 (4) (2020)
Siad Daboul, Stephan Held, Jens Vygen
Approximating the discrete time-cost tradeoff problem with bounded depth. CoRR (2020)
Vera Traub, Jens Vygen, Rico Zenklusen
Reducing path TSP to TSP. STOC (2020)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
Approximating maximum integral multiflows on bounded genus graphs. CoRR (2020)
Anna Köhne, Vera Traub, Jens Vygen
The asymmetric traveling salesman path LP has constant integrality ratio. Math. Program. 183 (1) (2020)
Vera Traub, Jens Vygen
An improved approximation algorithm for ATSP. STOC (2020)
Vera Traub, Jens Vygen
-path TSP. J. ACM 66 (2) (2019)
Vera Traub, Jens Vygen
An improved upper bound on the integrality ratio for the s-t-path TSP. Oper. Res. Lett. 47 (3) (2019)
Vera Traub, Jens Vygen
An improved approximation algorithm for ATSP. CoRR (2019)
Vera Traub, Jens Vygen, Rico Zenklusen
Reducing Path TSP to TSP. CoRR (2019)
Anna Köhne, Vera Traub, Jens Vygen
The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio. IPCO (2019)
Stephan Held, Jochen Könemann, Jens Vygen
Vehicle routing with subtours. Discret. Optim. 33 (2019)
Siad Daboul, Stephan Held, Jens Vygen, Sonja Wittke
An Approximation Algorithm for Threshold Voltage Optimization. ACM Trans. Design Autom. Electr. Syst. 23 (6) (2018)
Vera Traub, Jens Vygen
Beating the Integrality Ratio for s-t-Tours in Graphs. FOCS (2018)
Stephan Held, Jochen Könemann, Jens Vygen
Vehicle Routing with Subtours. CoRR (2018)
Vera Traub, Jens Vygen
Beating the integrality ratio for s-t-tours in graphs. CoRR (2018)
Vera Traub, Jens Vygen
-path TSP. SODA (2018)
Corinna Gottschalk, Jens Vygen
Better s-t-tours by Gao trees. Math. Program. 172 (1-2) (2018)
Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, Jens Vygen
Global Routing With Timing Constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37 (2) (2018)
Vera Traub, Jens Vygen
An improved upper bound on the integrality ratio for the s-t-path TSP. CoRR (2018)
Anna Köhne, Vera Traub, Jens Vygen
The asymmetric traveling salesman path LP has constant integrality ratio. CoRR (2018)
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM (2017)
Vera Traub, Jens Vygen
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP. CoRR (2017)
Klaus Heeger, Jens Vygen
Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges. SIAM J. Discret. Math. 31 (3) (2017)
Stefan Hougardy, Jannik Silvanus, Jens Vygen
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. Math. Program. Comput. 9 (2) (2017)
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR (2017)
Corinna Gottschalk, Jens Vygen
Better s-t-Tours by Gao Trees. IPCO (2016)
Klaus Heeger, Jens Vygen
Two-connected spanning subgraphs with at most 10/7 OPT edges. CoRR (2016)
Jens Vygen
Reassembling Trees for the Traveling Salesman. SIAM J. Discret. Math. 30 (2) (2016)
Corinna Gottschalk, Jens Vygen
Better $s$-$t$-Tours by Gao Trees. CoRR (2015)
Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen
Global Routing with Inherent Static Timing Constraints. ICCAD (2015)
Jon Lee, Jens Vygen
Preface. Math. Program. 154 (1-2) (2015)
Jens Vygen
Reassembling trees for the traveling salesman. CoRR (2015)
Stefan Hougardy, Jannik Silvanus, Jens Vygen
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. CoRR (2014)
András Sebö, Jens Vygen
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. Comb. 34 (5) (2014)
Daniel Rotter, Jens Vygen
d-dimensional arrangement revisited. Inf. Process. Lett. 113 (13) (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) (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)
András Sebö, Jens Vygen
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. CoRR (2012)
Jens Vygen
Splitting trees at vertices. Discret. Math. 311 (1) (2011)
Jens Vygen
Faster algorithm for optimum Steiner trees. Inf. Process. Lett. 111 (21-22) (2011)
Dirk Müller, Klaus Radke, Jens Vygen
Faster min-max resource sharing in theory and practice. Math. Program. Comput. 3 (1) (2011)
Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen
The repeater tree construction problem. Inf. Process. Lett. 110 (24) (2010)
Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD (2009)
Sven Peyer, Dieter Rautenbach, Jens Vygen
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. J. Discrete Algorithms 7 (4) (2009)
Ulrich Brenner, Markus Struzyna, Jens Vygen
BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27 (9) (2008)
Jens Maßberg, Jens Vygen
Approximation algorithms for a facility location problem with service capacities. ACM Trans. Algorithms 4 (4) (2008)
Jens Vygen
New theoretical results on quadratic placement. Integr. 40 (3) (2007)
Jens Vygen
From stars to comets: Improved local search for universal facility location. Oper. Res. Lett. 35 (4) (2007)
Bernhard Korte, Dieter Rautenbach, Jens Vygen
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip. Proc. IEEE 95 (3) (2007)
Jens Vygen
Slack in static timing analysis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25 (9) (2006)
Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
Efficient generation of short and fast repeater tree topologies. ISPD (2006)
Jens Maßberg, Jens Vygen
Approximation Algorithms for Network Design and Facility Location with Service Capacities. APPROX-RANDOM (2005)
Jens Vygen
Geometric quadrisection in linear time, with application to VLSI placement. Discret. Optim. 2 (4) (2005)
Ulrich Brenner, Anna Pauli, Jens Vygen
Almost optimum placement legalization by minimum cost flow and dynamic programming. ISPD (2004)
Ulrich Brenner, Jens Vygen
Legalizing a placement with minimum total movement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23 (12) (2004)
Jens Vygen
Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption. IPCO (2004)
Jens Vygen
A note on Schrijver's submodular function minimization algorithm. J. Comb. Theory, Ser. B 88 (2) (2003)
Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen
Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD (2003)
Jens Vygen
On dual minimum cost flow algorithms. Math. Methods Oper. Res. 56 (1) (2002)
Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discret. Appl. Math. 123 (1-3) (2002)
Ulrich Brenner, Jens Vygen
Worst-case ratios of networks in the rectilinear plane. Networks 38 (3) (2001)
Takao Nishizeki, Jens Vygen, Xiao Zhou
The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discret. Appl. Math. 115 (1-3) (2001)
Ulrich Brenner, Jens Vygen
Faster Optimal Single-Row Placement with Fixed Ordering. DATE (2000)
Jens Vygen
On dual minimum cost flow algorithms (extended abstract). STOC (2000)
Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen
Cycle time and slack optimization for VLSI-chips. ICCAD (1999)
Jens Vygen
Algorithms for Detailed Placement of Standard Cells. DATE (1998)
Jens Vygen
Algorithms for Large-Scale Flat Placement. DAC (1997)
Jens Vygen
NP-completeness of Some Edge-disjoint Paths Problems. Discret. Appl. Math. 61 (1) (1995)

Jens Vygen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jens Vygen