Seeun William Umboh

Department of Mathematics and Computer Science
Eindhoven University of Technology

Email: seeun DOT umboh AT gmail DOT com

About Me

I am a postdoc at the Eindhoven University of Technology hosted by Nikhil Bansal. I obtained my Ph.D. in Computer Science from the University of Wisconsin-Madison under the supervision of Shuchi Chawla and Eric Bach.

Research Interests

I am interested in approximation and online algorithms, especially for network design problems. Currently, I am working on metric embeddings, greedy algorithms, and submodular optimization.


  • Timing Matters: Online Dynamics in Broadcast Games
    Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh
    November 2016


    • Tight Approximation Bounds for Dominating Set on Graphs of Bounded Arboricity
      Nikhil Bansal, Seeun William Umboh
      Information Processing Letters 2017
    • LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs
      Nikhil Bansal, Daniel Reichman, Seeun William Umboh
      SODA 2017
    • LAST but not Least: Online Spanners for Buy-at-Bulk
      Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh
      SODA 2017
    • Online Network Design Algorithms via Hierarchical Decompositions
      Seeun Umboh
      SODA 2015
    • Network Design with Coverage Costs
      Siddharth Barman, Shuchi Chawla, Seeun Umboh
    • A Bicriteria Approximation for the Reordering Buffer Problem
      Siddharth Barman, Shuchi Chawla, Seeun Umboh
      ESA 2012
    • Secretary Problems with Convex Costs
      Siddharth Barman, Seeun Umboh, Shuchi Chawla, David Malec
      ICALP 2012
    • Threshold Rules for Sample Selection
      Eric Bach, Shuchi Chawla, Seeun Umboh
      COCOON 2010 / Invited to DMAA


  • Program Comittee, APPROX 2017