Seeun William Umboh
Lecturer in Computational Theory and ARC OPTIMA Associate Investigator
School of Computing and Information Systems
The University of Melbourne, Australia
700 Swanston St, Carlton, VIC 3010
I am interested in the design and analysis of algorithms for combinatorial optimization from the perspective of theoretical computer science. My goal is to build an algorithmic toolkit with provable guarantees that are applicable to broad classes of problems by discovering and leveraging the underlying mathematical structure of real-world problems.
In particular, I design
- online algorithms (aka optimization under uncertainty), where the algorithm has to make a sequence of decisions over time without precise knowledge of the future, and
- approximation algorithms, which are efficient algorithms that obtain near-optimal solutions for problems where exact computation of the optimal solution is intractable (i.e. NP-hard).
I enjoy working on problems involving graphs, distances (i.e. metric spaces), and economies-of-scale (e.g. submodularity aka diminishing returns). These include scheduling, resource allocation, clustering, and also problems from operations research (e.g. a recent focus is on variants of the joint replenishment problem).
Before joining University of Melbourne in 2023, I was a Lecturer in Algorithms and Honours Coordinator at the School of Computer Science, University of Sydney, and was a member of the wonderful Sydney Algorithms and Computing Theory group from 2018. From 2015 - 2018, I was fortunate to be a postdoc with Prof. Nikhil Bansal at TU Eindhoven. I was also a Visiting Professor at the Hebrew University of Jerusalem (hosted by Prof. Yair Bartal) from Oct 2017 - Jan 2018 and a Visiting Postdoc at the Simons Institute for the Theory of Computing, participating in the Algorithms and Uncertainty (Fall 2016) and Fine-Grained Complexity (Fall 2017) programs. I received my PhD in Computer Science at the University of Wisconsin-Madison, where I was blessed to be co-advised by Profs. Shuchi Chawla (Wikipedia) and Eric Bach (Wikipedia). I also have an MSc in Computer Science and a BSc majoring in Computer Science and Mathematics, all from UW-Madison.
Fun fact: I was advised by advisees of Manuel Blum (Eric) and Avrim Blum (Shuchi and Nikhil).
News
| 2026-Feb-10 | Excited to join the Editorial Board of Theoretical Computer Science! |
|---|---|
| 2026-Jan-15 | Giving a talk at Stanford Theory Lunch on 15 Jan on recent work Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines (joint work with awesome coauthors Michael Dinitz and Jeremy Fineman). Come by if you are around! Bluesky. |
| 2026-Jan-10 | Attending SODA26 and SOSA26. Will be presenting our paper Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, and More General (joint with David Shmoys and Varun Suriyanarayana, Cornell) Bluesky |
| 2025-Dec-20 | Paper accepted at AAMAS26: “A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization” with Philip Cervenjak, Junhao Gan, Naonori Kakimura and Tony Wirth. |
| 2025-Dec-19 | Co-organized 9 days of Theory Down Under: Celebration of TCS, FOCS 2025, Trends in Approximation and Online Algorithms (Organizer) |
| 2025-Dec-18 | Excited to join the ISAAC 2026 PC! |
| 2025-Dec-12 | COMP30026 Models of Computation student satisfaction score increased from 2.9/5 last year to 4.1/5 and scored at least 4/5 on every question |
| 2025-Nov-20 | New preprint on arxiv: Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines with Michael Dinitz and Jeremy Fineman. |
| 2025-Nov-16 | Presented Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines at Dagstuhl Seminar 25471 “Online Algorithms beyond Competitive Analysis”. |
| 2025-Oct-3 | Paper accepted at SODA26: Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General with David Shmoys and Varun Suriyanarayana, Cornell. |
| 2025-Sep-11 | I am excited to join the STOC 2026 PC! |
| 2025-Jul-24 | I am excited to join the ICALP 2026 PC! |
| 2025-Jul-11 | Paper accepted at ECAI25: “On the Computational Complexity of Partial Satisfaction Planning” with Jiajia Song, Nir Lipovetzky and Sebastian Sardina. |
| 2025-Jul-1 | Paper accepted at RANDOM25: “Local Computation Algorithms for Knapsack: Impossibility Results, and How to Avoid Them” with Clément Canonne and Yun Li. |
| 2025-Mar-26 | I am excited to join the STACS 2026 PC! |
| 2025-Mar-12 | I am excited to join the SOSA 2026 PC! |
| 2025-Mar-4 | I am excited to join the WAOA 2025 PC! |
| 2025-Feb-24 | I am excited to join the ISAAC 2025 PC! |
| 2025-Jan-17 | I am thrilled to accept an invitation to Dagstuhl Seminar 25471 on Online Algorithms beyond Competitive Analysis! |
| 2024-Dec-14 | Paper accepted at STACS 2025: Colorful Vertex Recoloring of Bipartite Graphs with Boaz Patt-Shamir and Adi Rosen. |
| 2024-Sep-12 | New paper in Transportation Research Part B: “Freelance drivers with a decline choice: dispatch menus in on-demand mobility services for assortment optimization” with Yue Yang (first author) and Mohsen Ramezani. I am excited by this paper as it’s my first paper with non-CS collaborators (coauthors are from Civil Engineering) and we were able to use theory to come up with practical algorithms. |
| 2024-Sep-12 | I am excited to join the ICALP 2025 PC! |
| 2024-Aug-13 | Paper accepted at PODS 2025: Optimal Dynamic Parameterized Subset Sampling with Junhao Gan, Hanzhi Wang, Anthony Wirth and Zhuo Zhang. |
| 2024-Jul-23 | Paper accepted to SPIRE 2024! Online Computation of String Net Frequency with Peaker Guo, Anthony Wirth and Justin Zobel. |
| 2024-Jul-3 | 2 papers accepted to APPROX 2024!
|
| 2024-Mar-1 | I am delighted to join the PhD supervision teams of Phil Cervenjak (supervised with Junhao Gan and Tony Wirth), Zhuo Zhang (supervised with Junhao Gan and Tony Wirth), and Peaker Guo (supervised with Tony Wirth and Justin Zobel) |
| 2024-Feb-5 | I am excited to join the ESA 2024 PC! |
| 2024-Jan-29 | I am excited to host Prof. Seffi Naor (ACM Fellow) from the Technion for a month-long visit as part of the FEIT Visiting Fellows Scheme. |
| 2024-Jan-29 | I am excited to join the FSTTCS24 PC! |
| 2024-Jan-10 | I am excited to join the SODA 2025 PC! |
| 2023-Oct-30 | Our DP24 project “Algorithms for Future-Proof Networks” with Joachim Gudmundsson, André van Renssen, and Mark de Berg has been funded by the Australian Research Council for $547,662! Grateful to be part of this amazing team! |
| 2023-Oct-25 | I will be on the TAMC 2024 PC. |
| 2023-Aug-11 | I am excited to be an Associate Investigator with OPTIMA |
| 2023-Aug-7 | New paper in Algorithmica: “The Online Broadcast Range-Assignment Problem” with Mark de Berg and Aleksandar Markovic. This is a journal version of our paper in ISAAC 2020. |
| 2023-Jun-23 | New paper in APPROX 2023: “Online Matching with Set and Concave Delays” with Lindsey Deryckere. This is based on Lindsey’s MPhil thesis, supervised by me, and her first academic paper. Congrats Lindsey |
| 2023-Apr-19 | I am excited to join the School of Computing and Information Systems at the University of Melbourne |