Recent Publications

  • Network Flow Algorithms

    David P. Williamson

    To be published by Cambridge University Press, Fall 2019.

  • Tight Bounds for Online Weighted Tree Augmentation

    Joseph (Seffi) Naor, Seeun William Umboh, and David P. Williamson

    In Christel Baier, Ioannis Chatzigiannakis, Paola Flochinni, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 88:1-88:14, 2019.

  • Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems

    Alice Paul, Daniel Freund, Aaron Ferber, David B. Shmoys, and David P. Williamson

    To appear in Mathematics of Operations Research.

Recent Talks

David P. Williamson is a Professor at Cornell University in the School of Operations Research and Information Engineering.

He received his Ph.D. in Computer Science from MIT under Professor Michel X. Goemans in 1993. After a postdoc at Cornell under Professor Éva Tardos, he was a Research Staff Member for IBM Research at the T.J. Watson Research Center in Yorktown Heights, New York. From 2000 to 2003, he was the Senior Manager of the Computer Science Principles and Methodologies group at IBM's Almaden Research Center in San Jose, California. He moved to Cornell University in 2004.

His research focuses on finding efficient algorithms for hard discrete optimization problems, with a focus on approximation algorithms for problems in network design, facility location, and scheduling. Other interests include algorithms for information networks.

His graduated Ph.D. students are:

His current Ph.D. students are:

His former postdocs are: