default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJens Vygen
Person information
- affiliation: University of Bonn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]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: 100848 (2024)- [j43]Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen:
Faster goal-oriented shortest path search for bulk and incremental detailed routing. Math. Program. 206(1): 3-32 (2024) - [j42]Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen:
Cost allocation for set covering: The happy nucleolus. Oper. Res. Lett. 57: 107158 (2024) - [e3]Jens Vygen, Jaroslaw Byrka:
Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024, Proceedings. Lecture Notes in Computer Science 14679, Springer 2024, ISBN 978-3-031-59834-0 [contents] - [i22]Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen:
Cost Allocation for Set Covering: the Happy Nucleolus. CoRR abs/2401.04040 (2024) - 2023
- [j41]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. Discret. Comput. Geom. 70(4): 1266-1291 (2023) - [j40]Jannis Blauth, Vera Traub, Jens Vygen:
Improving the approximation ratio for capacitated vehicle routing. Math. Program. 197(2): 451-497 (2023) - [j39]Siad Daboul, Stephan Held, Jens Vygen:
Approximating the discrete time-cost tradeoff problem with bounded depth. Math. Program. 197(2): 529-547 (2023) - [j38]Vera Traub, Jens Vygen:
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs. SIAM J. Comput. 52(6): S18-37 (2023) - [c26]Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen:
Improved Guarantees for the a Priori TSP. ISAAC 2023: 14:1-14:16 - [c25]Niklas Schlomberg, Hanjo Thiele, Jens Vygen:
Packing cycles in planar and bounded-genus graphs. SODA 2023: 2069-2086 - [i21]Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen:
Improved guarantees for the a priori TSP. CoRR abs/2309.10663 (2023) - 2022
- [j37]Vera Traub, Jens Vygen:
An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem. SIAM J. Comput. 51(1): 139-173 (2022) - [j36]Vera Traub, Jens Vygen, Rico Zenklusen:
Reducing Path TSP to TSP. SIAM J. Comput. 51(3): 20-24 (2022) - [c24]Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen:
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. IPCO 2022: 15-28 - [i20]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 abs/2205.00889 (2022) - [i19]Niklas Schlomberg, Hanjo Thiele, Jens Vygen:
Packing cycles in planar and bounded-genus graphs. CoRR abs/2207.00450 (2022) - 2021
- [j35]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): 752-769 (2021) - [c23]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. ICALP 2021: 80:1-80:18 - [c22]Jannis Blauth, Vera Traub, Jens Vygen:
Improving the Approximation Ratio for Capacitated Vehicle Routing. IPCO 2021: 1-14 - [c21]Siad Daboul, Stephan Held, Jens Vygen:
Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. IPCO 2021: 30-42 - [i18]Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen:
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. CoRR abs/2111.06169 (2021) - 2020
- [j34]Anna Köhne, Vera Traub, Jens Vygen:
The asymmetric traveling salesman path LP has constant integrality ratio. Math. Program. 183(1): 379-395 (2020) - [j33]Jannik Silvanus, Jens Vygen:
Few Sequence Pairs Suffice: Representing All Rectangle Placements. SIAM J. Discret. Math. 34(4): 2017-2032 (2020) - [c20]Vera Traub, Jens Vygen:
An improved approximation algorithm for ATSP. STOC 2020: 1-13 - [c19]Vera Traub, Jens Vygen, Rico Zenklusen:
Reducing path TSP to TSP. STOC 2020: 14-27 - [i17]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. CoRR abs/2001.01715 (2020) - [i16]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating maximum integral multiflows on bounded genus graphs. CoRR abs/2005.00575 (2020) - [i15]Siad Daboul, Stephan Held, Jens Vygen:
Approximating the discrete time-cost tradeoff problem with bounded depth. CoRR abs/2011.02446 (2020) - [i14]Jannis Blauth, Vera Traub, Jens Vygen:
Improving the Approximation Ratio for Capacitated Vehicle Routing. CoRR abs/2011.05235 (2020)
2010 – 2019
- 2019
- [j32]Stephan Held, Jochen Könemann, Jens Vygen:
Vehicle routing with subtours. Discret. Optim. 33: 87-100 (2019) - [j31]Vera Traub, Jens Vygen:
Approaching 3/2 for the s-t-path TSP. J. ACM 66(2): 14:1-14:17 (2019) - [j30]Vera Traub, Jens Vygen:
An improved upper bound on the integrality ratio for the s-t-path TSP. Oper. Res. Lett. 47(3): 225-228 (2019) - [c18]Anna Köhne, Vera Traub, Jens Vygen:
The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio. IPCO 2019: 288-298 - [i13]Vera Traub, Jens Vygen, Rico Zenklusen:
Reducing Path TSP to TSP. CoRR abs/1907.10376 (2019) - [i12]Vera Traub, Jens Vygen:
An improved approximation algorithm for ATSP. CoRR abs/1912.00670 (2019) - 2018
- [j29]Corinna Gottschalk, Jens Vygen:
Better s-t-tours by Gao trees. Math. Program. 172(1-2): 191-207 (2018) - [j28]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): 406-419 (2018) - [j27]Siad Daboul, Stephan Held, Jens Vygen, Sonja Wittke:
An Approximation Algorithm for Threshold Voltage Optimization. ACM Trans. Design Autom. Electr. Syst. 23(6): 68:1-68:16 (2018) - [c17]Vera Traub, Jens Vygen:
Beating the Integrality Ratio for s-t-Tours in Graphs. FOCS 2018: 766-777 - [c16]Vera Traub, Jens Vygen:
Approaching for the s-t-path TSP. SODA 2018: 1854-1864 - [i11]Stephan Held, Jochen Könemann, Jens Vygen:
Vehicle Routing with Subtours. CoRR abs/1801.04991 (2018) - [i10]Vera Traub, Jens Vygen:
Beating the integrality ratio for s-t-tours in graphs. CoRR abs/1804.03112 (2018) - [i9]Anna Köhne, Vera Traub, Jens Vygen:
The asymmetric traveling salesman path LP has constant integrality ratio. CoRR abs/1808.06542 (2018) - [i8]Vera Traub, Jens Vygen:
An improved upper bound on the integrality ratio for the s-t-path TSP. CoRR abs/1808.10734 (2018) - 2017
- [j26]Stefan Hougardy, Jannik Silvanus, Jens Vygen:
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. Math. Program. Comput. 9(2): 135-202 (2017) - [j25]Klaus Heeger, Jens Vygen:
Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges. SIAM J. Discret. Math. 31(3): 1820-1835 (2017) - [c15]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: 17:1-17:13 - [i7]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 abs/1706.06565 (2017) - [i6]Vera Traub, Jens Vygen:
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP. CoRR abs/1707.03992 (2017) - 2016
- [j24]Jens Vygen:
Reassembling Trees for the Traveling Salesman. SIAM J. Discret. Math. 30(2): 875-894 (2016) - [c14]Corinna Gottschalk, Jens Vygen:
Better s-t-Tours by Gao Trees. IPCO 2016: 126-137 - [i5]Klaus Heeger, Jens Vygen:
Two-connected spanning subgraphs with at most 10/7 OPT edges. CoRR abs/1609.00147 (2016) - 2015
- [j23]Jon Lee, Jens Vygen:
Preface. Math. Program. 154(1-2): 1-2 (2015) - [c13]Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen:
Global Routing with Inherent Static Timing Constraints. ICCAD 2015: 102-109 - [i4]Jens Vygen:
Reassembling trees for the traveling salesman. CoRR abs/1502.03715 (2015) - [i3]Corinna Gottschalk, Jens Vygen:
Better $s$-$t$-Tours by Gao Trees. CoRR abs/1511.05514 (2015) - 2014
- [j22]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): 597-629 (2014) - [e2]Jon Lee, Jens Vygen:
Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings. Lecture Notes in Computer Science 8494, Springer 2014, ISBN 978-3-319-07556-3 [contents] - [i2]Stefan Hougardy, Jannik Silvanus, Jens Vygen:
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. CoRR abs/1406.0492 (2014) - 2013
- [j21]Daniel Rotter, Jens Vygen:
d-dimensional arrangement revisited. Inf. Process. Lett. 113(13): 498-505 (2013) - [j20]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:1-32:24 (2013) - 2012
- [c12]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 - [i1]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 abs/1201.1870 (2012) - 2011
- [j19]Jens Vygen:
Splitting trees at vertices. Discret. Math. 311(1): 67-69 (2011) - [j18]Jens Vygen:
Faster algorithm for optimum Steiner trees. Inf. Process. Lett. 111(21-22): 1075-1079 (2011) - [j17]Dirk Müller, Klaus Radke, Jens Vygen:
Faster min-max resource sharing in theory and practice. Math. Program. Comput. 3(1): 1-35 (2011) - [p1]Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen:
Combinatorial Optimization in VLSI Design. Combinatorial Optimization - Methods and Applications 2011: 33-96 - 2010
- [j16]Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen:
The repeater tree construction problem. Inf. Process. Lett. 110(24): 1079-1083 (2010)
2000 – 2009
- 2009
- [j15]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) - [c11]Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen:
Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD 2009: 43-50 - [e1]William J. Cook, László Lovász, Jens Vygen:
Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany. Springer 2009, ISBN 978-3-540-76795-4 [contents] - 2008
- [j14]Jens Maßberg, Jens Vygen:
Approximation algorithms for a facility location problem with service capacities. ACM Trans. Algorithms 4(4): 50:1-50:15 (2008) - [j13]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): 1607-1620 (2008) - [r1]Ulrich Brenner, Jens Vygen:
Analytical Methods in Placement. Handbook of Algorithms for Physical Design Automation 2008 - 2007
- [j12]Jens Vygen:
New theoretical results on quadratic placement. Integr. 40(3): 305-314 (2007) - [j11]Jens Vygen:
From stars to comets: Improved local search for universal facility location. Oper. Res. Lett. 35(4): 427-433 (2007) - [j10]Bernhard Korte, Dieter Rautenbach, Jens Vygen:
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip. Proc. IEEE 95(3): 555-572 (2007) - 2006
- [j9]Jens Vygen:
Slack in static timing analysis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(9): 1876-1885 (2006) - [c10]Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen:
Efficient generation of short and fast repeater tree topologies. ISPD 2006: 120-127 - 2005
- [j8]Jens Vygen:
Geometric quadrisection in linear time, with application to VLSI placement. Discret. Optim. 2(4): 362-390 (2005) - [c9]Jens Maßberg, Jens Vygen:
Approximation Algorithms for Network Design and Facility Location with Service Capacities. APPROX-RANDOM 2005: 158-169 - 2004
- [j7]Ulrich Brenner, Jens Vygen:
Legalizing a placement with minimum total movement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(12): 1597-1613 (2004) - [c8]Jens Vygen:
Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption. IPCO 2004: 308-324 - [c7]Ulrich Brenner, Anna Pauli, Jens Vygen:
Almost optimum placement legalization by minimum cost flow and dynamic programming. ISPD 2004: 2-9 - 2003
- [j6]Jens Vygen:
A note on Schrijver's submodular function minimization algorithm. J. Comb. Theory B 88(2): 399-402 (2003) - [c6]Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen:
Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD 2003: 232-240 - 2002
- [j5]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): 103-127 (2002) - [j4]Jens Vygen:
On dual minimum cost flow algorithms. Math. Methods Oper. Res. 56(1): 101-126 (2002) - 2001
- [j3]Takao Nishizeki, Jens Vygen, Xiao Zhou:
The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discret. Appl. Math. 115(1-3): 177-186 (2001) - [j2]Ulrich Brenner, Jens Vygen:
Worst-case ratios of networks in the rectilinear plane. Networks 38(3): 126-139 (2001) - 2000
- [c5]Ulrich Brenner, Jens Vygen:
Faster Optimal Single-Row Placement with Fixed Ordering. DATE 2000: 117-121 - [c4]Jens Vygen:
On dual minimum cost flow algorithms (extended abstract). STOC 2000: 117-125
1990 – 1999
- 1999
- [c3]Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen:
Cycle time and slack optimization for VLSI-chips. ICCAD 1999: 232-238 - 1998
- [c2]Jens Vygen:
Algorithms for Detailed Placement of Standard Cells. DATE 1998: 321-324 - 1997
- [c1]Jens Vygen:
Algorithms for Large-Scale Flat Placement. DAC 1997: 746-751 - 1996
- [b1]Jens Vygen:
Plazierung im VLSI-Design und ein zweidimensionales Zerlegungsproblem. University of Bonn, 1996, pp. 1-109 - 1995
- [j1]Jens Vygen:
NP-completeness of Some Edge-disjoint Paths Problems. Discret. Appl. Math. 61(1): 83-90 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
