Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Seeun William Umboh
@article{DBLP:journals/algorithmica/BergMU23, author = {Mark de Berg and Aleksandar Markovic and Seeun William Umboh}, title = {The Online Broadcast Range-Assignment Problem}, journal = {Algorithmica}, volume = {85}, number = {12}, pages = {3928--3956}, year = {2023}, url = {https://doi.org/10.1007/s00453-023-01166-4}, doi = {10.1007/S00453-023-01166-4}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/BergMU23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DeryckereU23, author = {Lindsey Deryckere and Seeun William Umboh}, editor = {Nicole Megow and Adam D. Smith}, title = {Online Matching with Set and Concave Delays}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta, Georgia, {USA}}, series = {LIPIcs}, volume = {275}, pages = {17:1--17:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.17}, doi = {10.4230/LIPICS.APPROX/RANDOM.2023.17}, timestamp = {Sat, 09 Sep 2023 00:04:38 +0200}, biburl = {https://dblp.org/rec/conf/approx/DeryckereU23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LeUX23, author = {Ngoc Mai Le and Seeun William Umboh and Ningyuan Xie}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {1594--1610}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch59}, doi = {10.1137/1.9781611977554.CH59}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/LeUX23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/NaorUW22, author = {Joseph (Seffi) Naor and Seeun William Umboh and David P. Williamson}, title = {Tight Bounds for Online Weighted Tree Augmentation}, journal = {Algorithmica}, volume = {84}, number = {2}, pages = {304--324}, year = {2022}, url = {https://doi.org/10.1007/s00453-021-00888-7}, doi = {10.1007/S00453-021-00888-7}, timestamp = {Wed, 23 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/NaorUW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tjs/RacaUMS22, author = {Valon Raca and Seeun William Umboh and Eduard Mehofer and Bernhard Scholz}, title = {Runtime and energy constrained work scheduling for heterogeneous systems}, journal = {J. Supercomput.}, volume = {78}, number = {15}, pages = {17150--17177}, year = {2022}, url = {https://doi.org/10.1007/s11227-022-04556-7}, doi = {10.1007/S11227-022-04556-7}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tjs/RacaUMS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ChenKU22, author = {Ryder Chen and Jahanvi Khatkar and Seeun William Umboh}, editor = {Mikolaj Bojanczyk and Emanuela Merelli and David P. Woodruff}, title = {Online Weighted Cardinality Joint Replenishment Problem with Delay}, booktitle = {49th International Colloquium on Automata, Languages, and Programming, {ICALP} 2022, July 4-8, 2022, Paris, France}, series = {LIPIcs}, volume = {229}, pages = {40:1--40:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.40}, doi = {10.4230/LIPICS.ICALP.2022.40}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChenKU22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CaoFLMRU22, author = {Nairen Cao and Jeremy T. Fineman and Shi Li and Juli{\'{a}}n Mestre and Katina Russell and Seeun William Umboh}, editor = {Sang Won Bae and Heejin Park}, title = {Nested Active-Time Scheduling}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {36:1--36:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.36}, doi = {10.4230/LIPICS.ISAAC.2022.36}, timestamp = {Thu, 24 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CaoFLMRU22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/CaoFLMRU22, author = {Nairen Cao and Jeremy T. Fineman and Shi Li and Juli{\'{a}}n Mestre and Katina Russell and Seeun William Umboh}, editor = {Kunal Agrawal and I{-}Ting Angelina Lee}, title = {Brief Announcement: Nested Active-Time Scheduling}, booktitle = {{SPAA} '22: 34th {ACM} Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}, pages = {381--383}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3490148.3538554}, doi = {10.1145/3490148.3538554}, timestamp = {Thu, 24 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spaa/CaoFLMRU22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-12507, author = {Nairen Cao and Jeremy T. Fineman and Shi Li and Juli{\'{a}}n Mestre and Katina Russell and Seeun William Umboh}, title = {Nested Active-Time Scheduling}, journal = {CoRR}, volume = {abs/2207.12507}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.12507}, doi = {10.48550/ARXIV.2207.12507}, eprinttype = {arXiv}, eprint = {2207.12507}, timestamp = {Thu, 24 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-12507.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-02394, author = {Lindsey Deryckere and Seeun William Umboh}, title = {Online Matching with Set Delay}, journal = {CoRR}, volume = {abs/2211.02394}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.02394}, doi = {10.48550/ARXIV.2211.02394}, eprinttype = {arXiv}, eprint = {2211.02394}, timestamp = {Wed, 09 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-02394.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GudmundssonMU21, author = {Joachim Gudmundsson and Juli{\'{a}}n Mestre and Seeun William Umboh}, title = {Bounded-degree light approximate shortest-path trees in doubling metrics}, journal = {Discret. Appl. Math.}, volume = {305}, pages = {199--204}, year = {2021}, url = {https://doi.org/10.1016/j.dam.2021.08.039}, doi = {10.1016/J.DAM.2021.08.039}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GudmundssonMU21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/ChawlaNPSU21, author = {Shuchi Chawla and Joseph (Seffi) Naor and Debmalya Panigrahi and Mohit Singh and Seeun William Umboh}, title = {Timing Matters: Online Dynamics in Broadcast Games}, journal = {{ACM} Trans. Economics and Comput.}, volume = {9}, number = {2}, pages = {11:1--11:22}, year = {2021}, url = {https://doi.org/10.1145/3434425}, doi = {10.1145/3434425}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/teco/ChawlaNPSU21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MestrePU21, author = {Juli{\'{a}}n Mestre and Sergey Pupyrev and Seeun William Umboh}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {On the Extended {TSP} Problem}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {42:1--42:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.42}, doi = {10.4230/LIPICS.ISAAC.2021.42}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MestrePU21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-07815, author = {Juli{\'{a}}n Mestre and Sergey Pupyrev and Seeun William Umboh}, title = {On the Extended {TSP} Problem}, journal = {CoRR}, volume = {abs/2107.07815}, year = {2021}, url = {https://arxiv.org/abs/2107.07815}, eprinttype = {arXiv}, eprint = {2107.07815}, timestamp = {Wed, 21 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-07815.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BansalBEKU20, author = {Nikhil Bansal and Martin B{\"{o}}hm and Marek Eli{\'{a}}s and Grigorios Koumoutsos and Seeun William Umboh}, title = {Nested Convex Bodies are Chaseable}, journal = {Algorithmica}, volume = {82}, number = {6}, pages = {1640--1653}, year = {2020}, url = {https://doi.org/10.1007/s00453-019-00661-x}, doi = {10.1007/S00453-019-00661-X}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BansalBEKU20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Berg0U20, author = {Mark de Berg and Aleksandar Markovic and Seeun William Umboh}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {The Online Broadcast Range-Assignment Problem}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {60:1--60:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.60}, doi = {10.4230/LIPICS.ISAAC.2020.60}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Berg0U20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BartalFU20, author = {Yair Bartal and Nova Fandina and Seeun William Umboh}, editor = {Shuchi Chawla}, title = {Online Probabilistic Metric Embedding: {A} General Framework for Bypassing Inherent Bounds}, booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020}, pages = {1538--1557}, publisher = {{SIAM}}, year = {2020}, url = {https://doi.org/10.1137/1.9781611975994.95}, doi = {10.1137/1.9781611975994.95}, timestamp = {Thu, 15 Jul 2021 13:48:53 +0200}, biburl = {https://dblp.org/rec/conf/soda/BartalFU20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2009-14473, author = {Mark de Berg and Aleksandar Markovic and Seeun William Umboh}, title = {The Online Broadcast Range-Assignment Problem}, journal = {CoRR}, volume = {abs/2009.14473}, year = {2020}, url = {https://arxiv.org/abs/2009.14473}, eprinttype = {arXiv}, eprint = {2009.14473}, timestamp = {Wed, 07 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2009-14473.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/NaorUW19, author = {Joseph (Seffi) Naor and Seeun William Umboh and David P. Williamson}, editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi}, title = {Tight Bounds for Online Weighted Tree Augmentation}, booktitle = {46th International Colloquium on Automata, Languages, and Programming, {ICALP} 2019, July 9-12, 2019, Patras, Greece}, series = {LIPIcs}, volume = {132}, pages = {88:1--88:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.88}, doi = {10.4230/LIPICS.ICALP.2019.88}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/icalp/NaorUW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1904-11777, author = {Joseph Naor and Seeun William Umboh and David P. Williamson}, title = {Tight Bounds for Online Weighted Tree Augmentation}, journal = {CoRR}, volume = {abs/1904.11777}, year = {2019}, url = {http://arxiv.org/abs/1904.11777}, eprinttype = {arXiv}, eprint = {1904.11777}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1904-11777.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/QianUW18, author = {Jiawei Qian and Seeun William Umboh and David P. Williamson}, title = {Online Constrained Forest and Prize-Collecting Network Design}, journal = {Algorithmica}, volume = {80}, number = {11}, pages = {3335--3364}, year = {2018}, url = {https://doi.org/10.1007/s00453-017-0391-4}, doi = {10.1007/S00453-017-0391-4}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/QianUW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BansalB0KU18, author = {Nikhil Bansal and Martin B{\"{o}}hm and Marek Eli{\'{a}}s and Grigorios Koumoutsos and Seeun William Umboh}, editor = {Artur Czumaj}, title = {Nested Convex Bodies are Chaseable}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {1253--1260}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.81}, doi = {10.1137/1.9781611975031.81}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/BansalB0KU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/0001NPSU18, author = {Shuchi Chawla and Joseph (Seffi) Naor and Debmalya Panigrahi and Mohit Singh and Seeun William Umboh}, editor = {George Christodoulou and Tobias Harks}, title = {Timing Matters: Online Dynamics in Broadcast Games}, booktitle = {Web and Internet Economics - 14th International Conference, {WINE} 2018, Oxford, UK, December 15-17, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11316}, pages = {80--95}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-04612-5\_6}, doi = {10.1007/978-3-030-04612-5\_6}, timestamp = {Tue, 14 May 2019 10:00:36 +0200}, biburl = {https://dblp.org/rec/conf/wine/0001NPSU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BansalU17, author = {Nikhil Bansal and Seeun William Umboh}, title = {Tight approximation bounds for dominating set on graphs of bounded arboricity}, journal = {Inf. Process. Lett.}, volume = {122}, pages = {21--24}, year = {2017}, url = {https://doi.org/10.1016/j.ipl.2017.01.011}, doi = {10.1016/J.IPL.2017.01.011}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/BansalU17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Gupta0TU17, author = {Anupam Gupta and R. Ravi and Kunal Talwar and Seeun William Umboh}, editor = {Philip N. Klein}, title = {{LAST} but not Least: Online Spanners for Buy-at-Bulk}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {589--599}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.38}, doi = {10.1137/1.9781611974782.38}, timestamp = {Wed, 18 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/Gupta0TU17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Bansal0U17, author = {Nikhil Bansal and Daniel Reichman and Seeun William Umboh}, editor = {Philip N. Klein}, title = {LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {1964--1979}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.128}, doi = {10.1137/1.9781611974782.128}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Bansal0U17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/QianUW17, author = {Jiawei Qian and Seeun William Umboh and David P. Williamson}, title = {Online Constrained Forest and Prize-Collecting Network Design}, journal = {CoRR}, volume = {abs/1702.04871}, year = {2017}, url = {http://arxiv.org/abs/1702.04871}, eprinttype = {arXiv}, eprint = {1702.04871}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/QianUW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BansalBEKU17, author = {Nikhil Bansal and Martin B{\"{o}}hm and Marek Eli{\'{a}}s and Grigorios Koumoutsos and Seeun William Umboh}, title = {Nested Convex Bodies are Chaseable}, journal = {CoRR}, volume = {abs/1707.05527}, year = {2017}, url = {http://arxiv.org/abs/1707.05527}, eprinttype = {arXiv}, eprint = {1707.05527}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BansalBEKU17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BansalRU16, author = {Nikhil Bansal and Daniel Reichman and Seeun William Umboh}, title = {Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs}, journal = {CoRR}, volume = {abs/1606.05198}, year = {2016}, url = {http://arxiv.org/abs/1606.05198}, eprinttype = {arXiv}, eprint = {1606.05198}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BansalRU16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Gupta0TU16, author = {Anupam Gupta and R. Ravi and Kunal Talwar and Seeun William Umboh}, title = {{LAST} but not Least: Online Spanners for Buy-at-Bulk}, journal = {CoRR}, volume = {abs/1611.00052}, year = {2016}, url = {http://arxiv.org/abs/1611.00052}, eprinttype = {arXiv}, eprint = {1611.00052}, timestamp = {Wed, 18 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Gupta0TU16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChawlaNPSU16, author = {Shuchi Chawla and Joseph Naor and Debmalya Panigrahi and Mohit Singh and Seeun William Umboh}, title = {Timing Matters: Online Dynamics in Broadcast Games}, journal = {CoRR}, volume = {abs/1611.07745}, year = {2016}, url = {http://arxiv.org/abs/1611.07745}, eprinttype = {arXiv}, eprint = {1611.07745}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChawlaNPSU16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Umboh15, author = {Seeun Umboh}, editor = {Piotr Indyk}, title = {Online Network Design Algorithms via Hierarchical Decompositions}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015}, pages = {1373--1387}, publisher = {{SIAM}}, year = {2015}, url = {https://doi.org/10.1137/1.9781611973730.91}, doi = {10.1137/1.9781611973730.91}, timestamp = {Tue, 02 Feb 2021 17:07:30 +0100}, biburl = {https://dblp.org/rec/conf/soda/Umboh15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BarmanCU14, author = {Siddharth Barman and Shuchi Chawla and Seeun Umboh}, editor = {Klaus Jansen and Jos{\'{e}} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, title = {Network Design with Coverage Costs}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona, Spain}, series = {LIPIcs}, volume = {28}, pages = {48--63}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.48}, doi = {10.4230/LIPICS.APPROX-RANDOM.2014.48}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/BarmanCU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Umboh14, author = {Seeun Umboh}, title = {Online Network Design Algorithms via Hierarchical Decompositions}, journal = {CoRR}, volume = {abs/1410.4240}, year = {2014}, url = {http://arxiv.org/abs/1410.4240}, eprinttype = {arXiv}, eprint = {1410.4240}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Umboh14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-3868, author = {Siddharth Barman and Shuchi Chawla and Seeun Umboh}, title = {A 2-Approximation for Redundancy Aware Network Design with Laminar Demands}, journal = {CoRR}, volume = {abs/1304.3868}, year = {2013}, url = {http://arxiv.org/abs/1304.3868}, eprinttype = {arXiv}, eprint = {1304.3868}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-3868.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BarmanCU12, author = {Siddharth Barman and Shuchi Chawla and Seeun Umboh}, editor = {Leah Epstein and Paolo Ferragina}, title = {A Bicriteria Approximation for the Reordering Buffer Problem}, booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7501}, pages = {157--168}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33090-2\_15}, doi = {10.1007/978-3-642-33090-2\_15}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/BarmanCU12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BarmanUCM12, author = {Siddharth Barman and Seeun Umboh and Shuchi Chawla and David L. Malec}, editor = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer}, title = {Secretary Problems with Convex Costs}, booktitle = {Automata, Languages, and Programming - 39th International Colloquium, {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {7391}, pages = {75--87}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31594-7\_7}, doi = {10.1007/978-3-642-31594-7\_7}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BarmanUCM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-5823, author = {Siddharth Barman and Shuchi Chawla and Seeun Umboh}, title = {A Bicriteria Approximation for the Reordering Buffer Problem}, journal = {CoRR}, volume = {abs/1204.5823}, year = {2012}, url = {http://arxiv.org/abs/1204.5823}, eprinttype = {arXiv}, eprint = {1204.5823}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-5823.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1112-1136, author = {Siddharth Barman and Seeun Umboh and Shuchi Chawla and David L. Malec}, title = {Secretary Problems with Convex Costs}, journal = {CoRR}, volume = {abs/1112.1136}, year = {2011}, url = {http://arxiv.org/abs/1112.1136}, eprinttype = {arXiv}, eprint = {1112.1136}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1112-1136.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmaa/BachCU10, author = {Eric Bach and Shuchi Chawla and Seeun Umboh}, title = {Threshold Rules for Online Sample Selection}, journal = {Discret. Math. Algorithms Appl.}, volume = {2}, number = {4}, pages = {625--642}, year = {2010}, url = {https://doi.org/10.1142/S1793830910000929}, doi = {10.1142/S1793830910000929}, timestamp = {Wed, 01 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmaa/BachCU10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/BachCU10, author = {Eric Bach and Shuchi Chawla and Seeun Umboh}, editor = {My T. Thai and Sartaj Sahni}, title = {Threshold Rules for Online Sample Selection}, booktitle = {Computing and Combinatorics, 16th Annual International Conference, {COCOON} 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6196}, pages = {489--499}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14031-0\_52}, doi = {10.1007/978-3-642-14031-0\_52}, timestamp = {Wed, 01 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cocoon/BachCU10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1002-5034, author = {Eric Bach and Shuchi Chawla and Seeun Umboh}, title = {Threshold rules for online sample selection}, journal = {CoRR}, volume = {abs/1002.5034}, year = {2010}, url = {http://arxiv.org/abs/1002.5034}, eprinttype = {arXiv}, eprint = {1002.5034}, timestamp = {Wed, 01 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1002-5034.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.