Jens Vygen

5.6k total citations · 1 hit paper
74 papers, 2.3k citations indexed

About

Jens Vygen is a scholar working on Electrical and Electronic Engineering, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Jens Vygen has authored 74 papers receiving a total of 2.3k indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Electrical and Electronic Engineering, 29 papers in Computational Theory and Mathematics and 23 papers in Computer Networks and Communications. Recurrent topics in Jens Vygen's work include VLSI and FPGA Design Techniques (29 papers), Complexity and Algorithms in Graphs (24 papers) and Advanced Graph Theory Research (22 papers). Jens Vygen is often cited by papers focused on VLSI and FPGA Design Techniques (29 papers), Complexity and Algorithms in Graphs (24 papers) and Advanced Graph Theory Research (22 papers). Jens Vygen collaborates with scholars based in Germany, United States and France. Jens Vygen's co-authors include Bernhard Körte, Ulrich Brenner, B. Korte, András Sebö, William J. Cook, Dieter Rautenbach, Stephan Held, Christoph Albrecht, Dirk Müller and Xiao Zhou and has published in prestigious journals such as Proceedings of the IEEE, Journal of the ACM and Mathematical Programming.

In The Last Decade

Jens Vygen

70 papers receiving 2.2k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Combinatorial Optimization: Theory and Algorithms

2012 463 citations Bernhard Körte, Jens Vygen profile →

Peers

Countries citing papers authored by Jens Vygen

Since Specialization

Citations

This map shows the geographic impact of Jens Vygen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jens Vygen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jens Vygen more than expected).

Fields of papers citing papers by Jens Vygen

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jens Vygen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jens Vygen. The network helps show where Jens Vygen may publish in the future.

Co-authorship network of co-authors of Jens Vygen

This figure shows the co-authorship network connecting the top 25 collaborators of Jens Vygen. A scholar is included among the top collaborators of Jens Vygen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jens Vygen. Jens Vygen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks 2024 ·Discrete Optimization ·(unknown), Stephan Held, Dirk Müller, (unknown), (unknown), (unknown), Jens Vygen	1
2	Faster goal-oriented shortest path search for bulk and incremental detailed routing 2023 ·Mathematical Programming ·Markus Ahrens, (unknown), (unknown), Jens Vygen	1
3	Approximating Maximum Integral Multiflows on Bounded Genus Graphs 2023 ·Discrete & Computational Geometry ·Chien‐Chung Huang, (unknown), Claire Mathieu, Jens Vygen	0
4	Improving the approximation ratio for capacitated vehicle routing 2022 ·Mathematical Programming ·(unknown), (unknown), Jens Vygen	3
5	Kombinatorische Optimierung 2018 ·Bernhard Körte, Jens Vygen	3
6	Global Routing With Timing Constraints 2017 ·IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ·Stephan Held, Dirk Müller, (unknown), (unknown), (unknown), Jens Vygen	21
7	Integer programming and combinatorial optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014, proceedings 2014 ·DIAL (Catholic University of Leuven) ·Jon Lee, Jens Vygen	1
8	Optimisation combinatoire : théorie et algorithmes 2010 ·CERN Bulletin ·Bernhard Körte, Jens Vygen, Jean Fonlupt, (unknown)	2
9	Splitting trees at vertices 2010 ·Discrete Mathematics ·Jens Vygen	2
10	The repeater tree construction problem 2010 ·Information Processing Letters ·(unknown), Stephan Held, (unknown), Dieter Rautenbach, Jens Vygen	5
11	A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing 2009 ·Journal of Discrete Algorithms ·(unknown), Dieter Rautenbach, Jens Vygen	57
12	Geometric quadrisection in linear time, with application to VLSI placement 2005 ·Discrete Optimization ·Jens Vygen	4
13	Algorithm For Large-scale Flat Placement 2005 ·Jens Vygen	27
14	Clock Scheduling and Clocktree Construction for High Performance ASICS 2003 ·International Conference on Computer Aided Design ·Stephan Held, B. Korte, (unknown), (unknown), Jens Vygen	34
15	A note on Schrijver's submodular function minimization algorithm 2002 ·Journal of Combinatorial Theory Series B ·Jens Vygen	9
16	Combinatorial Optimization 2002 ·Bernhard Körte, Jens Vygen	186
17	The edge-disjoint paths problem is NP-complete for series–parallel graphs 2001 ·Discrete Applied Mathematics ·Takao Nishizeki, Jens Vygen, Xiao Zhou	29
18	Cycle time and slack optimization for VLSI-chips 1999 ·International Conference on Computer Aided Design ·Christoph Albrecht, B. Korte, (unknown), Jens Vygen	41
19	Algorithms for detailed placement of standard cells 1998 ·Design, Automation, and Test in Europe ·Jens Vygen	26
20	NP-completeness of some edge-disjoint paths problems 1995 ·Discrete Applied Mathematics ·Jens Vygen	43

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact