Dr William Umboh
Senior Lecturer in Computational Theory
School of Computing and Information Systems
44 Scholarly works
2 Projects
HIGHLIGHTS
2026
Research grants (other domestic)
New Frontiers in Learning-Augmented Algorithms
2024
Research grants (ARC, NHMRC, MRFF)
Algorithms for Future-Proof Networks
2023
Conference Proceedings
The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay
DOI: 10.1137/1.9781611977554.ch592022
Conference Proceedings
Online Weighted Cardinality Joint Replenishment Problem with Delay
DOI: 10.4230/LIPIcs.ICALP.2022.402020
Journal article
Nested Convex Bodies are Chaseable
DOI: 10.1007/s00453-019-00661-x2020
Conference Proceedings
Online probabilistic metric embedding: A general framework for bypassing inherent bounds
DOI: 10.1137/1.9781611975994.952018
Conference Proceedings
Nested convex bodies are chaseable
DOI: 10.1137/1.9781611975031.81
RECENT SCHOLARLY WORKS
2026
Conference Proceedings
Improved Algorithms and Lower Bounds for Parametrized Metrical Service Systems
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2026.112026
Conference Proceedings
Online TCP Acknowledgment Under General Delays
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2026.262026
Conference Proceedings
Online Matching with Size-Based and Convex Delays
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2026.252026
Conference Proceedings
Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
DOI: 10.4230/LIPIcs.ICALP.2026.772026
Journal article
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
DOI: 10.1007/s00453-026-01389-12026
Journal article
Computing Planning Width: How Hard Is It, Really?
DOI: 10.1609/icaps.v36i1.428402026
Conference Proceedings
A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
DOI: 10.65109/IPZQ73202026
Conference Proceedings
Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
DOI: 10.1137/1.9781611978971.100