Seeun William Umboh
Lecturer in Algorithms and CS Honours Director
School of Computer Science
The University of Sydney
Email: william DOT umboh AT sydney DOT edu DOT au
Office: Room 410, Building J12, School of Computer Science
Phone: +61 2 8627 7122
Research Interests
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.
Advising
PhD: Sampson Wong, (current, co-supervised with Joachim Gudmundsson)
Honours: Ive Zhang (S2 2020), Jahanvi Khatkar (S1 2020)
Interns: Finn Waugh (Winter 2020), TJ Kojima (Summer 2020), Qiang Qu (Summer 2019)
SSP: Ryder Chen (S2 2020), Cameron Eggins (S2 2020), Ive Zhang (S2 2019), Max Davy (S1 2019)
Teaching
COMP3027/3927 Algorithm Design (S1 2020, S1 2019)
Program Committees
SOSA 2021, FSTTCS 2018, APPROX 2017
Publications
-
The Online Broadcast Range-Assignment ProblemISAAC 2020
-
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent BoundsSODA 2020
-
Tight Bounds for Online Weighted Tree AugmentationICALP 2019
-
Timing Matters: Online Dynamics in Broadcast Games
-
Online Constrained Forest and Prize-Collecting Network Design
-
Nested Convex Bodies Are ChaseableSODA 2018
-
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 CostsAPPROX 2014
-
A Bicriteria Approximation for the Reordering Buffer ProblemESA 2012
-
Secretary Problems with Convex Costs
-
Threshold Rules for Sample Selection