Jens Vygen

About Jens Vygen

Jens Vygen, With an exceptional h-index of 32 and a recent h-index of 18 (since 2020), a distinguished researcher at Rheinische Friedrich-Wilhelms-Universität Bonn, specializes in the field of Combinatorial Optimization, Approximation Algorithms, Algorithms for Chip Design, Traveling Salesman Problem.

His recent articles reflect a diverse array of research interests and contributions to the field:

Cost Allocation for Set Covering: the Happy Nucleolus

Improving the approximation ratio for capacitated vehicle routing

Approximating the discrete time-cost tradeoff problem with bounded depth

Packing cycles in planar and bounded-genus graphs

Approximating maximum integral multiflows on bounded genus graphs

Improved guarantees for the a priori TSP

Faster goal-oriented shortest path search for bulk and incremental detailed routing

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks

Jens Vygen Information

University

Position

Professor of Discrete Mathematics

Citations(all)

6838

Citations(since 2020)

2425

Cited By

5425

hIndex(all)

32

hIndex(since 2020)

18

i10Index(all)

65

i10Index(since 2020)

29

Email

University Profile Page

Rheinische Friedrich-Wilhelms-Universität Bonn

Google Scholar

View Google Scholar Profile

Jens Vygen Skills & Research Interests

Combinatorial Optimization

Approximation Algorithms

Algorithms for Chip Design

Traveling Salesman Problem

Top articles of Jens Vygen

Title

Journal

Author(s)

Publication Date

Cost Allocation for Set Covering: the Happy Nucleolus

arXiv preprint arXiv:2401.04040

Jannis Blauth

Antonia Ellerbrock

Vera Traub

Jens Vygen

2024/1/8

Improving the approximation ratio for capacitated vehicle routing

Mathematical Programming

Jannis Blauth

Vera Traub

Jens Vygen

2023/2

Approximating the discrete time-cost tradeoff problem with bounded depth

Mathematical Programming

Siad Daboul

Stephan Held

Jens Vygen

2023/2

Packing cycles in planar and bounded-genus graphs

Niklas Schlomberg

Hanjo Thiele

Jens Vygen

2023

Approximating maximum integral multiflows on bounded genus graphs

Discrete & Computational Geometry

Chien-Chung Huang

Mathieu Mari

Claire Mathieu

Jens Vygen

2023/12

Improved guarantees for the a priori TSP

arXiv preprint arXiv:2309.10663

Jannis Blauth

Meike Neuwohner

Luise Puhlmann

Jens Vygen

2023/9/19

Faster goal-oriented shortest path search for bulk and incremental detailed routing

Mathematical Programming

Markus Ahrens

Dorothee Henke

Stefan Rabenstein

Jens Vygen

2023/5/24

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks

arXiv preprint arXiv:2205.00889

Jannis Blauth

Stephan Held

Dirk Müller

Niklas Schlomberg

Vera Traub

...

2022/5/2

An improved approximation algorithm for the asymmetric traveling salesman problem

Journal of discrete algorithms

Markus Bläser

Bodo Manthey

Jiří Sgall

2006/12/1

An approximation algorithm for fully planar edge-disjoint paths

SIAM Journal on Discrete Mathematics

Chien-Chung Huang

Mathieu Mari

Claire Mathieu

Kevin Schewior

Jens Vygen

2021

The asymmetric traveling salesman path LP has constant integrality ratio

Mathematical Programming

Anna Köhne

Vera Traub

Jens Vygen

2020/9

Reducing path TSP to TSP

Vera Traub

Jens Vygen

Rico Zenklusen

2020/6/22

Beating the Integrality Ratio for --Tours in Graphs

SIAM Journal on Computing

Vera Traub

Jens Vygen

2020

Few sequence pairs suffice: representing all rectangle placements

SIAM Journal on Discrete Mathematics

Jannik Silvanus

Jens Vygen

2020

See List of Professors in Jens Vygen University(Rheinische Friedrich-Wilhelms-Universität Bonn)

Co-Authors

H-index: 110
Laszlo Lovasz

Laszlo Lovasz

Eötvös Loránd Tudományegyetem

H-index: 57
R Ravi

R Ravi

Carnegie Mellon University

H-index: 42
András Frank

András Frank

Eötvös Loránd Tudományegyetem

H-index: 38
Takao Nishizeki

Takao Nishizeki

Tohoku University

H-index: 36
Jon Lee

Jon Lee

University of Michigan-Dearborn

academic-engine