My research projects, and all theses that I supervise,
are in at least one of the following broad areas:
See my list of recent publications
for examples of my research interests.
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).
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.
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.
Among the international cooperations and third-party funded projects,
the following are most notable:
a long standing and close cooperation with
on "Combinatorial Optimization and Chip Design".
The algorithms and tools developed in this project
have been used for designing the most complex chips of many major technology companies,
including all recent IBM microprocessors.
a new cooperation with
Deutsche Post DHL
on "Combinatorial Optimization for Applications in Pickup and Delivery Services".
the research areas
"Optimization in Large and Complex Networks"
"Algorithms, combinatorics, and complexity"
"Combinatorial optimization, complexity, and chip design"
Hausdorff Center for Mathematics