default search action
Seeun William Umboh
Person information
- affiliation: University of Melbourne, Parkville, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Junhao Gan, Seeun William Umboh, Hanzhi Wang, Anthony Wirth, Zhuo Zhang:
Optimal Dynamic Parameterized Subset Sampling. Proc. ACM Manag. Data 2(5): 209:1-209:26 (2024) - [c21]Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo, Seeun William Umboh:
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. APPROX/RANDOM 2024: 12:1-12:24 - [c20]Philip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth:
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound. APPROX/RANDOM 2024: 25:1-25:23 - [c19]Peaker Guo
, Seeun William Umboh
Online Computation of String Net Frequency. SPIRE 2024: 159-173 - [i19]Philip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth:
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound. CoRR abs/2407.09368 (2024) - [i18]Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. CoRR abs/2407.15809 (2024) - [i17]Peaker Guo, Seeun William Umboh, Anthony Wirth, Justin Zobel:
Online Computation of String Net Frequency. CoRR abs/2408.00308 (2024) - [i16]Yair Bartal, Ora Nova Fandina, Seeun William Umboh:
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. CoRR abs/2408.16298 (2024) - 2023
- [j9]Mark de Berg, Aleksandar Markovic, Seeun William Umboh
The Online Broadcast Range-Assignment Problem. Algorithmica 85(12): 3928-3956 (2023) - [c18]Lindsey Deryckere, Seeun William Umboh
Online Matching with Set and Concave Delays. APPROX/RANDOM 2023: 17:1-17:17 - [c17]Ngoc Mai Le, Seeun William Umboh
The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay. SODA 2023: 1594-1610 - 2022
- [j8]Joseph (Seffi) Naor, Seeun William Umboh
Tight Bounds for Online Weighted Tree Augmentation. Algorithmica 84(2): 304-324 (2022) - [j7]Valon Raca
Runtime and energy constrained work scheduling for heterogeneous systems. J. Supercomput. 78(15): 17150-17177 (2022) - [c16]Ryder Chen, Jahanvi Khatkar, Seeun William Umboh
Online Weighted Cardinality Joint Replenishment Problem with Delay. ICALP 2022: 40:1-40:18 - [c15]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Nested Active-Time Scheduling. ISAAC 2022: 36:1-36:16 - [c14]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Brief Announcement: Nested Active-Time Scheduling. SPAA 2022: 381-383 - [i15]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. CoRR abs/2207.12507 (2022) - [i14]Lindsey Deryckere, Seeun William Umboh:
Online Matching with Set Delay. CoRR abs/2211.02394 (2022) - 2021
- [j6]Joachim Gudmundsson, Julián Mestre, Seeun William Umboh
Bounded-degree light approximate shortest-path trees in doubling metrics. Discret. Appl. Math. 305: 199-204 (2021) - [j5]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): 11:1-11:22 (2021) - [c13]Julián Mestre, Sergey Pupyrev, Seeun William Umboh
On the Extended TSP Problem. ISAAC 2021: 42:1-42:14 - [i13]Julián Mestre, Sergey Pupyrev, Seeun William Umboh:
On the Extended TSP Problem. CoRR abs/2107.07815 (2021) - 2020
- [j4]Nikhil Bansal, Martin Böhm, Marek Eliás
Nested Convex Bodies are Chaseable. Algorithmica 82(6): 1640-1653 (2020) - [c12]Mark de Berg
The Online Broadcast Range-Assignment Problem. ISAAC 2020: 60:1-60:15 - [c11]Yair Bartal, Nova Fandina, Seeun William Umboh
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. SODA 2020: 1538-1557 - [i12]Mark de Berg, Aleksandar Markovic, Seeun William Umboh:
The Online Broadcast Range-Assignment Problem. CoRR abs/2009.14473 (2020)
2010 – 2019
- 2019
- [c10]Joseph (Seffi) Naor, Seeun William Umboh
Tight Bounds for Online Weighted Tree Augmentation. ICALP 2019: 88:1-88:14 - [i11]Joseph Naor, Seeun William Umboh, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. CoRR abs/1904.11777 (2019) - 2018
- [j3]Jiawei Qian, Seeun William Umboh
Online Constrained Forest and Prize-Collecting Network Design. Algorithmica 80(11): 3335-3364 (2018) - [c9]Nikhil Bansal, Martin Böhm, Marek Eliás
Nested Convex Bodies are Chaseable. SODA 2018: 1253-1260 - [c8]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. WINE 2018: 80-95 - 2017
- [j2]Nikhil Bansal, Seeun William Umboh
Tight approximation bounds for dominating set on graphs of bounded arboricity. Inf. Process. Lett. 122: 21-24 (2017) - [c7]Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh
LAST but not Least: Online Spanners for Buy-at-Bulk. SODA 2017: 589-599 - [c6]Nikhil Bansal, Daniel Reichman, Seeun William Umboh
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. SODA 2017: 1964-1979 - [i10]Jiawei Qian, Seeun William Umboh, David P. Williamson:
Online Constrained Forest and Prize-Collecting Network Design. CoRR abs/1702.04871 (2017) - [i9]Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. CoRR abs/1707.05527 (2017) - 2016
- [i8]Nikhil Bansal, Daniel Reichman, Seeun William Umboh:
Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. CoRR abs/1606.05198 (2016) - [i7]Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh:
LAST but not Least: Online Spanners for Buy-at-Bulk. CoRR abs/1611.00052 (2016) - [i6]Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. CoRR abs/1611.07745 (2016) - 2015
- [c5]Seeun Umboh
Online Network Design Algorithms via Hierarchical Decompositions. SODA 2015: 1373-1387 - 2014
- [c4]Siddharth Barman, Shuchi Chawla, Seeun Umboh
Network Design with Coverage Costs. APPROX-RANDOM 2014: 48-63 - [i5]Seeun Umboh:
Online Network Design Algorithms via Hierarchical Decompositions. CoRR abs/1410.4240 (2014) - 2013
- [i4]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
A 2-Approximation for Redundancy Aware Network Design with Laminar Demands. CoRR abs/1304.3868 (2013) - 2012
- [c3]Siddharth Barman, Shuchi Chawla, Seeun Umboh
A Bicriteria Approximation for the Reordering Buffer Problem. ESA 2012: 157-168 - [c2]Siddharth Barman, Seeun Umboh
Secretary Problems with Convex Costs. ICALP (1) 2012: 75-87 - [i3]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
A Bicriteria Approximation for the Reordering Buffer Problem. CoRR abs/1204.5823 (2012) - 2011
- [i2]Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec:
Secretary Problems with Convex Costs. CoRR abs/1112.1136 (2011) - 2010
- [j1]Eric Bach, Shuchi Chawla, Seeun Umboh
Threshold Rules for Online Sample Selection. Discret. Math. Algorithms Appl. 2(4): 625-642 (2010) - [c1]Eric Bach, Shuchi Chawla, Seeun Umboh
Threshold Rules for Online Sample Selection. COCOON 2010: 489-499 - [i1]Eric Bach, Shuchi Chawla, Seeun Umboh:
Threshold rules for online sample selection. CoRR abs/1002.5034 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-09 22:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: