Volgen
Seeun William Umboh
Seeun William Umboh
Lecturer in Computational Theory at Computing and Information Systems University of Melbourne
Geverifieerd e-mailadres voor unimelb.edu.au - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Nested convex bodies are chaseable
N Bansal, M Böhm, M Eliáš, G Koumoutsos, SW Umboh
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
362018
Online network design algorithms via hierarchical decompositions
S Umboh
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015
312015
Secretary problems with convex costs
S Barman, S Umboh, S Chawla, D Malec
International Colloquium on Automata, Languages, and Programming, 75-87, 2012
312012
Tight approximation bounds for dominating set on graphs of bounded arboricity
N Bansal, SW Umboh
Information Processing Letters 122, 21-24, 2017
252017
LAST but not Least: Online Spanners for Buy-at-Bulk
A Gupta, R Ravi, K Talwar, SW Umboh
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
152017
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs
N Bansal, D Reichman, SW Umboh
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
142017
A bicriteria approximation for the reordering buffer problem
S Barman, S Chawla, S Umboh
European Symposium on Algorithms, 157-168, 2012
122012
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
Y Barta, N Fandina, SW Umboh
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
102020
Online Weighted Cardinality Joint Replenishment Problem with Delay
R Chen, J Khatkar, SW Umboh
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
82022
The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay
NM Le, SW Umboh, N Xie
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023, 2023
62023
On the Extended TSP Problem
J Mestre, S Pupyrev, SW Umboh
32nd International Symposium on Algorithms and Computation (ISAAC) 2021, 2021
62021
Online constrained forest and prize-collecting network design
J Qian, SW Umboh, DP Williamson
Algorithmica 80 (11), 3335-3364, 2018
42018
Online Matching with Set and Concave Delays
L Deryckere, SW Umboh
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2023
22023
Online Matching with Set Delay
L Deryckere, SW Umboh
arXiv preprint arXiv:2211.02394, 2022
12022
Runtime and energy constrained work scheduling for heterogeneous systems
V Raca, SW Umboh, E Mehofer, B Scholz
The Journal of Supercomputing 78 (15), 17150-17177, 2022
12022
Network Design with Coverage Costs
S Barman, S Chawla, S Umboh
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
12014
Nested Active-Time Scheduling
N Cao, JT Fineman, S Li, J Mestre, K Russell, SW Umboh
International Symposium on Algorithms and Computation (ISAAC) 2022, 2022
2022
Tight bounds for online weighted tree augmentation
JS Naor, SW Umboh, DP Williamson
Algorithmica 84 (2), 304-324, 2022
2022
Brief Announcement: Nested Active-Time Scheduling
N Cao, JT Fineman, S Li, J Mestre, K Russell, SW Umboh
34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA …, 2022
2022
Bounded-degree light approximate shortest-path trees in doubling metrics
J Gudmundsson, J Mestre, SW Umboh
Discrete Applied Mathematics 305, 199-204, 2021
2021
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20