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.
Combinatorial optimization and approximation algorithms.
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).
Algorithms for 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.
Traveling salesman problem and vehicle routing.
Theoretical foundations and design of better algorithms for variants of the
traveling salesman problem, and various 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: