| 2026 | ICALP | Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines. | Michael Dinitz, Jeremy T. Fineman, Seeun William Umboh |
| 2026 | SODA | Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General. | David B. Shmoys, Varun Suriyanarayana, Seeun William Umboh |
| 2025 | ECAI | On the Computational Complexity of Partial Satisfaction Planning. | Jiajia Song, Seeun William Umboh, Nir Lipovetzky, Sebastian Sardia |
| 2025 | PODC | Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them. | Clment L. Canonne, Yun Li, Seeun William Umboh |
| 2025 | STACS | Colorful Vertex Recoloring of Bipartite Graphs. | Boaz Patt-Shamir, Adi Rosn, Seeun William Umboh |
| 2024 | SPIRE | Online Computation of String Net Frequency. | Peaker Guo, Seeun William Umboh, Anthony Wirth, Justin Zobel |
| 2023 | SODA | The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay. | Ngoc Mai Le, Seeun William Umboh, Ningyuan Xie |
| 2022 | ICALP | Online Weighted Cardinality Joint Replenishment Problem with Delay. | Ryder Chen, Jahanvi Khatkar, Seeun William Umboh |
| 2022 | ISAAC | Nested Active-Time Scheduling. | Nairen Cao, Jeremy T. Fineman, Shi Li, Julin Mestre, Katina Russell, Seeun William Umboh |
| 2022 | SPAA | Brief Announcement: Nested Active-Time Scheduling. | Nairen Cao, Jeremy T. Fineman, Shi Li, Julin Mestre, Katina Russell, Seeun William Umboh |
| 2021 | ISAAC | On the Extended TSP Problem. | Julin Mestre, Sergey Pupyrev, Seeun William Umboh |
| 2020 | ISAAC | The Online Broadcast Range-Assignment Problem. | Mark de Berg, Aleksandar Markovic, Seeun William Umboh |
| 2020 | SODA | Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. | Yair Bartal, Nova Fandina, Seeun William Umboh |
| 2019 | ICALP | Tight Bounds for Online Weighted Tree Augmentation. | Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson |
| 2018 | SODA | Nested Convex Bodies are Chaseable. | Nikhil Bansal, Martin Bhm, Marek Elis, Grigorios Koumoutsos, Seeun William Umboh |
| 2017 | SODA | LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. | Nikhil Bansal, Daniel Reichman, Seeun William Umboh |
| 2017 | SODA | LAST but not Least: Online Spanners for Buy-at-Bulk. | Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh |