Seeun William Umboh

According to our database, Seeun William Umboh authored at least 39 papers between 2010 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment.

Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo, Seeun William Umboh

Algorithmica, June, 2026

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization.

Philip Cervenjak, Junhao Gan, Naonori Kakimura, Seeun William Umboh, Anthony Wirth

CoRR, May, 2026

Online TCP Acknowledgment under General Delays.

Sujoy Bhore, Michal Pawlowski, Seeun William Umboh

CoRR, April, 2026

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

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines.

Michael Dinitz, Jeremy T. Fineman, Seeun William Umboh

CoRR, November, 2025

Colorful Vertex Recoloring of Bipartite Graphs.

Boaz Patt-Shamir, Adi Rosén, Seeun William Umboh

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them.

Clément L. Canonne, Yun Li, Seeun William Umboh

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

On the Computational Complexity of Partial Satisfaction Planning.

Jiajia Song, Seeun William Umboh, Nir Lipovetzky, Sebastian Sardiña

Proceedings of the ECAI 2025 - 28th European Conference on Artificial Intelligence, 25-30 October 2025, Bologna, Italy, 2025

Local Computation Algorithms for Knapsack: Impossibility Results, and How to Avoid Them.

Clément L. Canonne, Yun Li, Seeun William Umboh

Proceedings of the Approximation, 2025

2024

Optimal Dynamic Parameterized Subset Sampling.

Junhao Gan, Seeun William Umboh, Hanzhi Wang, Anthony Wirth, Zhuo Zhang

Proc. ACM Manag. Data, November, 2024

Optimal bounds on a tree inference algorithm.

Jack Gardiner, Lachlan L. H. Andrew, Junhao Gan, Jean Honorio, Seeun William Umboh

CoRR, 2024

Online Computation of String Net Frequency.

Peaker Guo, Seeun William Umboh, Anthony Wirth, Justin Zobel

Proceedings of the String Processing and Information Retrieval, 2024

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment.

Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo, Seeun William Umboh

Proceedings of the Approximation, 2024

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound.

Philip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth

Proceedings of the Approximation, 2024

2023

The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay.

Ngoc Mai Le, Seeun William Umboh, Ningyuan Xie

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Online Matching with Set and Concave Delays.

Lindsey Deryckere, Seeun William Umboh

Proceedings of the Approximation, 2023

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 Delay.

Lindsey Deryckere, Seeun William Umboh

CoRR, 2022

Brief Announcement: Nested Active-Time Scheduling.

Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Nested Active-Time Scheduling.

Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Online Weighted Cardinality Joint Replenishment Problem with Delay.

Ryder Chen, Jahanvi Khatkar, Seeun William Umboh

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Bounded-degree light approximate shortest-path trees in doubling metrics.

Joachim Gudmundsson, Julián Mestre, Seeun William Umboh

Discret. Appl. Math., 2021

On the Extended TSP Problem.

Julián Mestre, Sergey Pupyrev, Seeun William Umboh

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds.

Yair Bartal, Nova Fandina, Seeun William Umboh

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

The Online Broadcast Range-Assignment Problem.

Mark de Berg, Aleksandar Markovic, Seeun William Umboh

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Tight Bounds for Online Weighted Tree Augmentation.

Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Online Constrained Forest and Prize-Collecting Network Design.

Jiawei Qian, Seeun William Umboh, David P. Williamson

Algorithmica, 2018

Timing Matters: Online Dynamics in Broadcast Games.

Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Nested Convex Bodies are Chaseable.

Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Tight approximation bounds for dominating set on graphs of bounded arboricity.

Nikhil Bansal, Seeun William Umboh

Inf. Process. Lett., 2017

LAST but not Least: Online Spanners for Buy-at-Bulk.

Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs.

Nikhil Bansal, Daniel Reichman, Seeun William Umboh

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs.

Nikhil Bansal, Daniel Reichman, Seeun William Umboh

CoRR, 2016

2015

Online Network Design Algorithms via Hierarchical Decompositions.

Seeun Umboh

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Network Design with Coverage Costs.

Siddharth Barman, Shuchi Chawla, Seeun Umboh

Proceedings of the Approximation, 2014

2013

A 2-Approximation for Redundancy Aware Network Design with Laminar Demands

Siddharth Barman, Shuchi Chawla, Seeun Umboh

CoRR, 2013

2012

Secretary Problems with Convex Costs.

Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

A Bicriteria Approximation for the Reordering Buffer Problem.

Siddharth Barman, Shuchi Chawla, Seeun Umboh

Proceedings of the Algorithms - ESA 2012, 2012

2010

Threshold Rules for Online Sample Selection.

Eric Bach, Shuchi Chawla, Seeun Umboh

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010