Seeun William Umboh

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 33

Top Topics

Bounded Treewidth

Heterogeneous Systems

Online Learning

Top Venues

Publications

Philip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound. CoRR (2024)
Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo, Seeun William Umboh
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. CoRR (2024)
Mark de Berg, Aleksandar Markovic, Seeun William Umboh
The Online Broadcast Range-Assignment Problem. Algorithmica 85 (12) (2023)
Ngoc Mai Le, Seeun William Umboh, Ningyuan Xie
The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay. SODA (2023)
Lindsey Deryckere, Seeun William Umboh
Online Matching with Set and Concave Delays. APPROX/RANDOM (2023)
Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Nested Active-Time Scheduling. CoRR (2022)
Valon Raca, Seeun William Umboh, Eduard Mehofer, Bernhard Scholz
Runtime and energy constrained work scheduling for heterogeneous systems. J. Supercomput. 78 (15) (2022)
Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Brief Announcement: Nested Active-Time Scheduling. SPAA (2022)
Lindsey Deryckere, Seeun William Umboh
Online Matching with Set Delay. CoRR (2022)
Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson
Tight Bounds for Online Weighted Tree Augmentation. Algorithmica 84 (2) (2022)
Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Nested Active-Time Scheduling. ISAAC (2022)
Ryder Chen, Jahanvi Khatkar, Seeun William Umboh
Online Weighted Cardinality Joint Replenishment Problem with Delay. ICALP (2022)
Julián Mestre, Sergey Pupyrev, Seeun William Umboh
On the Extended TSP Problem. ISAAC (2021)
Joachim Gudmundsson, Julián Mestre, Seeun William Umboh
Bounded-degree light approximate shortest-path trees in doubling metrics. Discret. Appl. Math. 305 (2021)
Julián Mestre, Sergey Pupyrev, Seeun William Umboh
On the Extended TSP Problem. CoRR (2021)
Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh
Timing Matters: Online Dynamics in Broadcast Games. ACM Trans. Economics and Comput. 9 (2) (2021)
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
Nested Convex Bodies are Chaseable. Algorithmica 82 (6) (2020)
Yair Bartal, Nova Fandina, Seeun William Umboh
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. SODA (2020)
Mark de Berg, Aleksandar Markovic, Seeun William Umboh
The Online Broadcast Range-Assignment Problem. ISAAC (2020)
Mark de Berg, Aleksandar Markovic, Seeun William Umboh
The Online Broadcast Range-Assignment Problem. CoRR (2020)
Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson
Tight Bounds for Online Weighted Tree Augmentation. ICALP (2019)
Joseph Naor, Seeun William Umboh, David P. Williamson
Tight Bounds for Online Weighted Tree Augmentation. CoRR (2019)
Jiawei Qian, Seeun William Umboh, David P. Williamson
Online Constrained Forest and Prize-Collecting Network Design. Algorithmica 80 (11) (2018)
Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh
Timing Matters: Online Dynamics in Broadcast Games. WINE (2018)
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
Nested Convex Bodies are Chaseable. SODA (2018)
Jiawei Qian, Seeun William Umboh, David P. Williamson
Online Constrained Forest and Prize-Collecting Network Design. CoRR (2017)
Nikhil Bansal, Seeun William Umboh
Tight approximation bounds for dominating set on graphs of bounded arboricity. Inf. Process. Lett. 122 (2017)
Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh
LAST but not Least: Online Spanners for Buy-at-Bulk. SODA (2017)
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
Nested Convex Bodies are Chaseable. CoRR (2017)
Nikhil Bansal, Daniel Reichman, Seeun William Umboh
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. SODA (2017)
Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh
LAST but not Least: Online Spanners for Buy-at-Bulk. CoRR (2016)
Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh
Timing Matters: Online Dynamics in Broadcast Games. CoRR (2016)
Nikhil Bansal, Daniel Reichman, Seeun William Umboh
Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. CoRR (2016)