| 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 | 39 | 2018 |
| Online network design algorithms via hierarchical decompositions S Umboh Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015 | 32 | 2015 |
| Secretary problems with convex costs S Barman, S Umboh, S Chawla, D Malec International Colloquium on Automata, Languages, and Programming, 75-87, 2012 | 30 | 2012 |
| Tight approximation bounds for dominating set on graphs of bounded arboricity N Bansal, SW Umboh Information Processing Letters 122, 21-24, 2017 | 26 | 2017 |
| 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 | 16 | 2017 |
| 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 | 14 | 2017 |
| Online Weighted Cardinality Joint Replenishment Problem with Delay R Chen, J Khatkar, SW Umboh 49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022 | 12 | 2022 |
| A bicriteria approximation for the reordering buffer problem S Barman, S Chawla, S Umboh European Symposium on Algorithms, 157-168, 2012 | 12 | 2012 |
| 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 | 11 | 2020 |
| 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 | 9 | 2023 |
| On the Extended TSP Problem J Mestre, S Pupyrev, SW Umboh 32nd International Symposium on Algorithms and Computation (ISAAC) 2021, 2021 | 7 | 2021 |
| Online Matching with Set and Concave Delays L Deryckere, SW Umboh Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2023 | 4 | 2023 |
| Online constrained forest and prize-collecting network design J Qian, SW Umboh, DP Williamson Algorithmica 80 (11), 3335-3364, 2018 | 4 | 2018 |
| The online broadcast range-assignment problem M de Berg, A Markovic, SW Umboh Algorithmica 85 (12), 3928-3956, 2023 | 3 | 2023 |
| Online Matching with Set Delay L Deryckere, SW Umboh arXiv preprint arXiv:2211.02394, 2022 | 3 | 2022 |
| 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 | 2 | 2022 |
| Tight bounds for online weighted tree augmentation JS Naor, SW Umboh, DP Williamson Algorithmica 84 (2), 304-324, 2022 | 1 | 2022 |
| Network Design with Coverage Costs S Barman, S Chawla, S Umboh Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | 1 | 2014 |
| 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 |
| 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 |
Shuchi ChawlaUniversity of Wisconsin - Madison在 cs.wisc.edu 的电子邮件经过验证
