Dr. Jens Vygen

Biography

His research projects, and all theses that he supervise, are in at least one of the following broad areas: Combinatorial optimization. Theory and algorithms for classical combinatorial optimization problems, e.g., related to network flows, shortest paths, Steiner trees, network design, linear arrangement and generalizations, submodular functions, facility location, multicommodity flows, resource sharing, and the traveling salesman problem (TSP), Chip design. Theoretical foundations and the design of better algorithms for important tasks in chip design, e.g., floorplanning, global and detailed placement, global and detailed routing, timing analysis and optimization, design of repeater trees and clock networks, logic optimization, Vehicle routing. Theoretical foundations and design of better algorithms for variants of the traveling salesman problem, clustering, and various other aspects related to complex real-world pickup and delivery vehicle routing problems.

Research Interest

Combinatorial optimization, Chip design