Seeun William Umboh
Lecturer in Algorithms
School of Information Technologies
University of Sydney
Email: william DOT umboh AT sydney DOT edu DOT au
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.
Timing Matters: Online Dynamics in Broadcast GamesNovember 2016
Online Constrained Forest and Prize-Collecting Network DesignAlgorithmica (accepted for publication)arXivNested Convex Bodies Are ChaseableSODA 2018arXivTight Approximation Bounds for Dominating Set on Graphs of Bounded ArboricityInformation Processing Letters, Feb 2017LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth GraphsSODA 2017LAST but not Least: Online Spanners for Buy-at-BulkSODA 2017Online Network Design Algorithms via Hierarchical DecompositionsNetwork Design with Coverage CostsA Bicriteria Approximation for the Reordering Buffer ProblemESA 2012Secretary Problems with Convex CostsThreshold Rules for Sample SelectionCOCOON 2010 / Invited to special issue of Discrete Mathematics, Algorithms and Applications
- Program Comittee Member: FSTTCS 2018, APPROX 2017
Previously, I was 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.