Threshold Rules for Online Sample Selection. - Eric Bach 001; Shuchi Chawla 001; Seeun Umboh (Discret. Math. Algorithms Appl., 2010)

A Bicriteria Approximation for the Reordering Buffer Problem. - Siddharth Barman; Shuchi Chawla 001; Seeun Umboh (ESA, 2012)

Secretary Problems with Convex Costs. - Siddharth Barman; Seeun Umboh; Shuchi Chawla 001; David L. Malec (ICALP (1), 2012)

A 2-Approximation for Redundancy Aware Network Design with Laminar Demands - Siddharth Barman; Shuchi Chawla 001; Seeun Umboh (CoRR, 2013)

Network Design with Coverage Costs. - Siddharth Barman; Shuchi Chawla 001; Seeun Umboh (APPROX-RANDOM, 2014)

Online Network Design Algorithms via Hierarchical Decompositions. - Seeun Umboh (SODA, 2015)

Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. - Nikhil Bansal 001; Daniel Reichman 001; Seeun William Umboh (CoRR, 2016)

LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. - Nikhil Bansal 001; Daniel Reichman 001; Seeun William Umboh (SODA, 2017)

LAST but not Least: Online Spanners for Buy-at-Bulk. - Anupam Gupta 001; R. Ravi 001; Kunal Talwar; Seeun William Umboh (SODA, 2017)

Tight approximation bounds for dominating set on graphs of bounded arboricity. - Nikhil Bansal 001; Seeun William Umboh (Inf. Process. Lett., 2017)

Online Constrained Forest and Prize-Collecting Network Design. - Jiawei Qian; Seeun William Umboh; David P. Williamson (Algorithmica, 2018)

Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. - Yair Bartal; Nova Fandina; Seeun William Umboh (SODA, 2020)

Nested Convex Bodies are Chaseable. - Nikhil Bansal 001; Martin Böhm 001; Marek Eliás 001; Grigorios Koumoutsos; Seeun William Umboh (Algorithmica, 2020)

On the Extended TSP Problem. - Julián Mestre; Sergey Pupyrev; Seeun William Umboh (ISAAC, 2021)

Bounded-degree light approximate shortest-path trees in doubling metrics. - Joachim Gudmundsson; Julián Mestre; Seeun William Umboh (Discret. Appl. Math., 2021)

Timing Matters: Online Dynamics in Broadcast Games. - Shuchi Chawla 001; Joseph (Seffi) Naor; Debmalya Panigrahi; Mohit Singh; Seeun William Umboh (ACM Trans. Economics and Comput., 2021)

Online Weighted Cardinality Joint Replenishment Problem with Delay. - Ryder Chen; Jahanvi Khatkar; Seeun William Umboh (ICALP, 2022)

Nested Active-Time Scheduling. - Nairen Cao; Jeremy T. Fineman; Shi Li 001; Julián Mestre; Katina Russell; Seeun William Umboh (ISAAC, 2022)

Brief Announcement: Nested Active-Time Scheduling. - Nairen Cao; Jeremy T. Fineman; Shi Li 001; Julián Mestre; Katina Russell; Seeun William Umboh (SPAA, 2022)

Tight Bounds for Online Weighted Tree Augmentation. - Joseph (Seffi) Naor; Seeun William Umboh; David P. Williamson (Algorithmica, 2022)

Online Matching with Set Delay. - Lindsey Deryckere; Seeun William Umboh (CoRR, 2022)

Runtime and energy constrained work scheduling for heterogeneous systems. - Valon Raca; Seeun William Umboh; Eduard Mehofer; Bernhard Scholz (J. Supercomput., 2022)

Online Matching with Set and Concave Delays. - Lindsey Deryckere; Seeun William Umboh (APPROX/RANDOM, 2023)

The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay. - Ngoc Mai Le; Seeun William Umboh; Ningyuan Xie (SODA, 2023)

The Online Broadcast Range-Assignment Problem. - Mark de Berg; Aleksandar Markovic 001; Seeun William Umboh (Algorithmica, 2023)

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound. - Philip Cervenjak; Junhao Gan; Seeun William Umboh; Anthony Wirth (APPROX/RANDOM, 2024)

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. - Tomer Ezra; Stefano Leonardi 001; Michal Pawlowski; Matteo Russo 002; Seeun William Umboh (APPROX/RANDOM, 2024)

Online Computation of String Net Frequency. - Peaker Guo; Seeun William Umboh; Anthony Wirth; Justin Zobel (SPIRE, 2024)

Optimal bounds on a tree inference algorithm. - Jack Gardiner; Lachlan L. H. Andrew; Junhao Gan; Jean Honorio; Seeun William Umboh (CoRR, 2024)

Optimal Dynamic Parameterized Subset Sampling. - Junhao Gan; Seeun William Umboh; Hanzhi Wang 001; Anthony Wirth; Zhuo Zhang (Proc. ACM Manag. Data, 2024)

Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them. - Clément L. Canonne; Yun Li; Seeun William Umboh (PODC, 2025)

Colorful Vertex Recoloring of Bipartite Graphs. - Boaz Patt-Shamir; Adi Rosén; Seeun William Umboh (STACS, 2025)

Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them. - Clément L. Canonne; Yun Li; Seeun William Umboh (CoRR, 2025)