Here are some of his notable works:
Books:
* Combinatorial Optimization: Theory and Algorithms (with Bernhard Korte): This is a comprehensive textbook on combinatorial optimization that covers various topics like network flows, matchings, matroids, and approximation algorithms. It is considered a standard reference in the field.
* Approximation Algorithms: A Modern Approach (with Vijay Vazirani): This book provides a detailed treatment of approximation algorithms for NP-hard problems. It focuses on techniques like greedy algorithms, linear programming relaxation, and dynamic programming.
Research Papers:
Vygen has published numerous research papers in top academic journals and conferences. His research focuses on:
* Network flows and combinatorial optimization problems: He has worked on efficient algorithms for problems like minimum cost flows, shortest paths, and network design.
* Approximation algorithms: He has contributed to the design and analysis of approximation algorithms for various optimization problems, including facility location, set cover, and Steiner tree.
* Integer programming: He has investigated techniques for solving integer programming problems, including cutting plane methods and branch-and-bound algorithms.
You can find more information about Hendrik Vygen's publications on his website or by searching online databases like Google Scholar.