Publications

publications by categories in reversed chronological order. generated by jekyll-scholar.

2024

  1. Transp. Res. B
    Freelance drivers with a decline choice: Dispatch menus in on-demand mobility services for assortment optimization
    Yue Yang, Seeun William Umboh, and Mohsen Ramezani
    Transportation Research Part B: Methodological, 2024
  2. PODS
    Optimal Dynamic Parameterized Subset Sampling
    Junhao Gan, Seeun William Umboh, Hanzhi Wang, Anthony Wirth, and Zhuo Zhang
    In ACM Principles of Database Systems, 2024
  3. SPIRE
    Online Computation of String Net Frequency
    Peaker Guo, Seeun William Umboh, Anthony Wirth, and Justin Zobel
    In International Symposium on String Processing and Information Retrieval, 2024
  4. APPROX
    Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
    Philip Cervenjak, Junhao Gan, Seeun William Umboh, and Anthony Wirth
    In International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 2024
  5. APPROX
    Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
    Tomer Ezra, Stefano Leonardi, Michał Pawłowski, Matteo Russo, and Seeun William Umboh
    In International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 2024

2023

  1. Algorithmica
    The Online Broadcast Range-Assignment Problem
    Mark Berg, Aleksandar Markovic, and Seeun William Umboh
    Algorithmica, 2023
  2. APPROX
    Online Matching with Set and Concave Delays
    Lindsey Deryckere, and Seeun William Umboh
    In International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 2023
  3. SODA
    The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay
    Ngoc Mai Le, Seeun William Umboh, and Ningyuan Xie
    In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023

2022

  1. ISAAC
    Nested Active-Time Scheduling
    Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, and Seeun William Umboh
    In International Symposium on Algorithms and Computation (ISAAC), 2022
  2. J. Supercomput.
    Runtime and Energy Constrained Work Scheduling for Heterogeneous Systems
    Valon Raca, Seeun William Umboh, Eduard Mehofer, and Bernhard Scholz
    Journal of Supercomputing, 2022
  3. Algorithmica
    Tight Bounds for Online Weighted Tree Augmentation
    Joseph Naor, Seeun William Umboh, and David P. Williamson
    Algorithmica, 2022
  4. ICALP
    Online Weighted Cardinality Joint Replenishment Problem with Delay
    Ryder Chen, Jahanvi Khatkar, and Seeun William Umboh
    In International Colloquium on Automata, Languages, and Programming (ICALP), 2022
  5. SPAA
    Brief Announcement: Nested Active-Time Scheduling
    Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, and Seeun William Umboh
    In Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022

2021

  1. DAM
    Bounded-degree light approximate shortest-path trees in doubling metrics
    Joachim Gudmundsson, Julián Mestre, and Seeun William Umboh
    Discret. Appl. Math., 2021
  2. TEAC
    Timing Matters: Online Dynamics in Broadcast Games
    Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, and Seeun William Umboh
    ACM Trans. Economics and Comput., 2021
  3. ISAAC
    On the Extended TSP Problem
    Julián Mestre, Sergey Pupyrev, and Seeun William Umboh
    In International Symposium on Algorithms and Computation (ISAAC), 2021

2020

  1. Algorithmica
    Nested Convex Bodies are Chaseable
    Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, and Seeun William Umboh
    Algorithmica, 2020
  2. ISAAC
    The Online Broadcast Range-Assignment Problem
    Mark Berg, Aleksandar Markovic, and Seeun William Umboh
    In International Symposium on Algorithms and Computation (ISAAC), 2020
  3. SODA
    Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
    Yair Bartal, Nova Fandina, and Seeun William Umboh
    In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020

2019

  1. ICALP
    Tight Bounds for Online Weighted Tree Augmentation
    Joseph (Seffi) Naor, Seeun William Umboh, and David P. Williamson
    In International Colloquium on Automata, Languages, and Programming, (ICALP), 2019

2018

  1. Algorithmica
    Online Constrained Forest and Prize-Collecting Network Design
    Jiawei Qian, Seeun William Umboh, and David P. Williamson
    Algorithmica, 2018
  2. SODA
    Nested Convex Bodies are Chaseable
    Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, and Seeun William Umboh
    In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2018
  3. WINE
    Timing Matters: Online Dynamics in Broadcast Games
    Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, and Seeun William Umboh
    In International Conference on Web and Internet Economics (WINE), 2018

2017

  1. IPL
    Tight approximation bounds for dominating set on graphs of bounded arboricity
    Nikhil Bansal, and Seeun William Umboh
    Inf. Process. Lett., 2017
  2. SODA
    LAST but not Least: Online Spanners for Buy-at-Bulk
    Anupam Gupta, R. Ravi, Kunal Talwar, and Seeun William Umboh
    In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017
  3. SODA
    LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs
    Nikhil Bansal, Daniel Reichman, and Seeun William Umboh
    In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017

2015

  1. SODA
    Online Network Design Algorithms via Hierarchical Decompositions
    Seeun Umboh
    In ACM-SIAM Symposium on Discrete Algorithms (SODA) 2015, 2015

2014

  1. APPROX
    Network Design with Coverage Costs
    Siddharth Barman, Shuchi Chawla, and Seeun Umboh
    In International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014

2012

  1. ESA
    A Bicriteria Approximation for the Reordering Buffer Problem
    Siddharth Barman, Shuchi Chawla, and Seeun Umboh
    In European Symposium on Algorithms (ESA), 2012
  2. ICALP
    Secretary Problems with Convex Costs
    Siddharth Barman, Seeun Umboh, Shuchi Chawla, and David L. Malec
    In International Colloquium on Automata, Languages, and Programming (ICALP), 2012

2010

  1. DMAA
    Threshold Rules for Online Sample Selection
    Eric Bach, Shuchi Chawla, and Seeun Umboh
    Discret. Math. Algorithms Appl., 2010
  2. COCOON
    Threshold Rules for Online Sample Selection
    Eric Bach, Shuchi Chawla, and Seeun Umboh
    In International Conference on Computing and Combinatorics (COCOON), 2010