Concepedia
Statistics
Publications
43
Citations
1.7K
H-Index
25
Active since
1995
Affiliations
University of Bonn(Current)
Center for Discrete Mathematics and Theoretical Computer Science
Jens Vygen is an author at University of Bonn specializing in computer science, optimization, and combinatorial optimization.
Publications per year
1995–2022
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 · COMBINATORICA · 2014 · 155 citations · Full text
Computing, Computer Science, Combinatorics +9
Algorithms for large-scale flat placement
Jens Vygen · 1997 · 108 citations
Engineering, Computer Engineering, Computer Science +13
NP-completeness of some edge-disjoint paths problems
Jens Vygen · Discrete Applied Mathematics · 1995 · 91 citations
Natural Sciences, Computer Science, Mathematics +9
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Sven Peyer, Dieter Rautenbach, Jens Vygen · Journal of Discrete Algorithms · 2009 · 90 citations
Computing, Computer Engineering, Computer Science +12
The edge-disjoint paths problem is NP-complete for series–parallel graphs
Takao Nishizeki, Jens Vygen, Xiao Zhou · Discrete Applied Mathematics · 2001 · 77 citations
Computing, Computer Science, Mathematics +10
1–5 of 43