Seeun William Umboh
Department of Mathematics and Computer Science
Eindhoven University of Technology
Email: seeun DOT umboh AT gmail DOT com
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.
I am broadly interested in theoretical computer science and combinatorial optimization. Currently, I am working on approximation and online algorithms, graph optimization (e.g. network design, graph partitioning), and metric embeddings.
Nested Convex Sets Are ChaseableJuly 2017arXivOnline Constrained Forest and Prize-Collecting Network DesignFebruary 2017arXivTiming Matters: Online Dynamics in Broadcast GamesNovember 2016
Tight Approximation Bounds for Dominating Set on Graphs of Bounded ArboricityInformation Processing Letters 2017
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth GraphsSODA 2017
LAST but not Least: Online Spanners for Buy-at-BulkSODA 2017
Online Network Design Algorithms via Hierarchical DecompositionsSODA 2015
Network Design with Coverage Costs
A Bicriteria Approximation for the Reordering Buffer ProblemESA 2012
Secretary Problems with Convex Costs
Threshold Rules for Sample SelectionCOCOON 2010 / Invited to DMAA
- Program Comittee, APPROX 2017