var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://bibbase.org/network/files/qyK8KPx6JHiBjGaRs\",\"jsonp\":\"1\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Ngoc\",\"Mai\"],\"propositions\":[],\"lastnames\":[\"Le\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]},{\"firstnames\":[\"Ningyuanp\"],\"propositions\":[],\"lastnames\":[\"Xie\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"Nikhil\"],\"propositions\":[],\"lastnames\":[\"Bansal\"],\"suffixes\":[]},{\"firstnames\":[\"Viswanath\"],\"propositions\":[],\"lastnames\":[\"Nagarajan\"],\"suffixes\":[]}],\"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 20:51:37 +0100\",\"biburl\":\"https://dblp.org/rec/conf/soda/LeUX23.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@inproceedings{LeUX23,\\n  author       = {Ngoc Mai Le and\\n                  Seeun William Umboh and\\n                  Ningyuanp Xie},\\n  editor       = {Nikhil Bansal and\\n                  Viswanath Nagarajan},\\n  title        = {The Power of Clairvoyance for Multi-Level Aggregation and Set Cover\\n                  with Delay},\\n  booktitle    = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,\\n                  {SODA} 2023, Florence, Italy, January 22-25, 2023},\\n  pages        = {1594--1610},\\n  publisher    = {{SIAM}},\\n  year         = {2023},\\n  url          = {https://doi.org/10.1137/1.9781611977554.ch59},\\n  doi          = {10.1137/1.9781611977554.ch59},\\n  timestamp    = {Tue, 21 Mar 2023 20:51:37 +0100},\\n  biburl       = {https://dblp.org/rec/conf/soda/LeUX23.bib},\\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Le, N. M.\",\"Umboh, S. W.\",\"Xie, N.\"],\"editor_short\":[\"Bansal, N.\",\"Nagarajan, V.\"],\"key\":\"LeUX23\",\"id\":\"LeUX23\",\"bibbaseid\":\"le-umboh-xie-thepowerofclairvoyanceformultilevelaggregationandsetcoverwithdelay-2023\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1137/1.9781611977554.ch59\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Nairen\"],\"propositions\":[],\"lastnames\":[\"Cao\"],\"suffixes\":[]},{\"firstnames\":[\"Jeremy\",\"T.\"],\"propositions\":[],\"lastnames\":[\"Fineman\"],\"suffixes\":[]},{\"firstnames\":[\"Shi\"],\"propositions\":[],\"lastnames\":[\"Li\"],\"suffixes\":[]},{\"firstnames\":[\"Julián\"],\"propositions\":[],\"lastnames\":[\"Mestre\"],\"suffixes\":[]},{\"firstnames\":[\"Katina\"],\"propositions\":[],\"lastnames\":[\"Russell\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"Sang\",\"Won\"],\"propositions\":[],\"lastnames\":[\"Bae\"],\"suffixes\":[]},{\"firstnames\":[\"Heejin\"],\"propositions\":[],\"lastnames\":[\"Park\"],\"suffixes\":[]}],\"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ür Informatik\",\"year\":\"2022\",\"url\":\"https://doi.org/10.4230/LIPIcs.ISAAC.2022.36\",\"doi\":\"10.4230/LIPIcs.ISAAC.2022.36\",\"timestamp\":\"Tue, 21 Mar 2023 20:56:18 +0100\",\"biburl\":\"https://dblp.org/rec/conf/isaac/CaoFLMRU22.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@inproceedings{CaoFLMRU22,\\n  author       = {Nairen Cao and\\n                  Jeremy T. Fineman and\\n                  Shi Li and\\n                  Juli{\\\\'{a}}n Mestre and\\n                  Katina Russell and\\n                  Seeun William Umboh},\\n  editor       = {Sang Won Bae and\\n                  Heejin Park},\\n  title        = {Nested Active-Time Scheduling},\\n  booktitle    = {33rd International Symposium on Algorithms and Computation, {ISAAC}\\n                  2022, December 19-21, 2022, Seoul, Korea},\\n  series       = {LIPIcs},\\n  volume       = {248},\\n  pages        = {36:1--36:16},\\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\\\\\\"{u}}r Informatik},\\n  year         = {2022},\\n  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.36},\\n  doi          = {10.4230/LIPIcs.ISAAC.2022.36},\\n  timestamp    = {Tue, 21 Mar 2023 20:56:18 +0100},\\n  biburl       = {https://dblp.org/rec/conf/isaac/CaoFLMRU22.bib},\\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\\n}\\n\",\"author_short\":[\"Cao, N.\",\"Fineman, J. T.\",\"Li, S.\",\"Mestre, J.\",\"Russell, K.\",\"Umboh, S. W.\"],\"editor_short\":[\"Bae, S. W.\",\"Park, H.\"],\"key\":\"CaoFLMRU22\",\"id\":\"CaoFLMRU22\",\"bibbaseid\":\"cao-fineman-li-mestre-russell-umboh-nestedactivetimescheduling-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.4230/LIPIcs.ISAAC.2022.36\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Valon\"],\"propositions\":[],\"lastnames\":[\"Raca\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]},{\"firstnames\":[\"Eduard\"],\"propositions\":[],\"lastnames\":[\"Mehofer\"],\"suffixes\":[]},{\"firstnames\":[\"Bernhard\"],\"propositions\":[],\"lastnames\":[\"Scholz\"],\"suffixes\":[]}],\"title\":\"Runtime and Energy Constrained Work Scheduling for Heterogeneous Systems\",\"journal\":\"Journal of Supercomputing\",\"year\":\"2022\",\"url\":\"https://doi.org/10.1007/s11227-022-04556-7\",\"bibtex\":\"@article{supercomputing,\\n  author    = {Valon Raca and\\n               Seeun William Umboh and\\n               Eduard Mehofer and\\n\\t       Bernhard Scholz},\\n  title     = {Runtime and Energy Constrained Work Scheduling for Heterogeneous Systems},\\n  journal   = {Journal of Supercomputing},\\n  year      = {2022},\\n  url       = {https://doi.org/10.1007/s11227-022-04556-7}\\n}\\n\\n\",\"author_short\":[\"Raca, V.\",\"Umboh, S. W.\",\"Mehofer, E.\",\"Scholz, B.\"],\"key\":\"supercomputing\",\"id\":\"supercomputing\",\"bibbaseid\":\"raca-umboh-mehofer-scholz-runtimeandenergyconstrainedworkschedulingforheterogeneoussystems-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1007/s11227-022-04556-7\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Joseph\"],\"propositions\":[],\"lastnames\":[\"Naor\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]},{\"firstnames\":[\"David\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Williamson\"],\"suffixes\":[]}],\"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\",\"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\",\"bibtex\":\"@article{DBLP:journals/algorithmica/NaorUW22,\\n  author    = {Joseph Naor and\\n               Seeun William Umboh and\\n               David P. Williamson},\\n  title     = {Tight Bounds for Online Weighted Tree Augmentation},\\n  journal   = {Algorithmica},\\n  volume    = {84},\\n  number    = {2},\\n  pages     = {304--324},\\n  year      = {2022},\\n  url       = {https://doi.org/10.1007/s00453-021-00888-7},\\n  timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},\\n  biburl    = {https://dblp.org/rec/journals/algorithmica/NaorUW22.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Naor, J.\",\"Umboh, S. W.\",\"Williamson, D. P.\"],\"key\":\"DBLP:journals/algorithmica/NaorUW22\",\"id\":\"DBLP:journals/algorithmica/NaorUW22\",\"bibbaseid\":\"naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1007/s00453-021-00888-7\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Ryder\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"firstnames\":[\"Jahanvi\"],\"propositions\":[],\"lastnames\":[\"Khatkar\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"Online Weighted Cardinality Joint Replenishment Problem with Delay\",\"booktitle\":\"International Colloquium on Automata, Languages, and Programming (ICALP)\",\"year\":\"2022\",\"url\":\"https://doi.org/10.4230/LIPIcs.ICALP.2022.40\",\"timestamp\":\"Tue, 28 Jun 2022 15:52:51 +0200\",\"biburl\":\"https://dblp.org/rec/conf/icalp/ChenKU22.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@inproceedings{DBLP:conf/icalp/ChenKU22,\\n  author    = {Ryder Chen and\\n               Jahanvi Khatkar and\\n               Seeun William Umboh},\\n  title     = {Online Weighted Cardinality Joint Replenishment Problem with Delay},\\n  booktitle = {International Colloquium on Automata, Languages, and Programming\\n               {(ICALP)}},\\n  year      = {2022},\\n  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2022.40},\\n  timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},\\n  biburl    = {https://dblp.org/rec/conf/icalp/ChenKU22.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Chen, R.\",\"Khatkar, J.\",\"Umboh, S. W.\"],\"key\":\"DBLP:conf/icalp/ChenKU22\",\"id\":\"DBLP:conf/icalp/ChenKU22\",\"bibbaseid\":\"chen-khatkar-umboh-onlineweightedcardinalityjointreplenishmentproblemwithdelay-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.4230/LIPIcs.ICALP.2022.40\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":6,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Nairen\"],\"propositions\":[],\"lastnames\":[\"Cao\"],\"suffixes\":[]},{\"firstnames\":[\"Jeremy\",\"T.\"],\"propositions\":[],\"lastnames\":[\"Fineman\"],\"suffixes\":[]},{\"firstnames\":[\"Shi\"],\"propositions\":[],\"lastnames\":[\"Li\"],\"suffixes\":[]},{\"firstnames\":[\"Julián\"],\"propositions\":[],\"lastnames\":[\"Mestre\"],\"suffixes\":[]},{\"firstnames\":[\"Katina\"],\"propositions\":[],\"lastnames\":[\"Russell\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"Brief Announcement: Nested Active-Time Scheduling\",\"booktitle\":\"Symposium on Parallelism in Algorithms and Architectures (SPAA)\",\"year\":\"2022\",\"url\":\"https://doi.org/10.1145/3490148.3538554\",\"timestamp\":\"Tue, 12 Jul 2022 14:22:25 +0200\",\"biburl\":\"https://dblp.org/rec/conf/spaa/CaoFLMRU22.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@inproceedings{DBLP:conf/spaa/CaoFLMRU22,\\n  author    = {Nairen Cao and\\n               Jeremy T. Fineman and\\n               Shi Li and\\n               Juli{\\\\'{a}}n Mestre and\\n               Katina Russell and\\n               Seeun William Umboh},\\n  title     = {Brief Announcement: Nested Active-Time Scheduling},\\n  booktitle = {Symposium on Parallelism in Algorithms and\\n               Architectures {(SPAA)}},\\n  year      = {2022},\\n  url       = {https://doi.org/10.1145/3490148.3538554},\\n  timestamp = {Tue, 12 Jul 2022 14:22:25 +0200},\\n  biburl    = {https://dblp.org/rec/conf/spaa/CaoFLMRU22.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\\n\",\"author_short\":[\"Cao, N.\",\"Fineman, J. T.\",\"Li, S.\",\"Mestre, J.\",\"Russell, K.\",\"Umboh, S. W.\"],\"key\":\"DBLP:conf/spaa/CaoFLMRU22\",\"id\":\"DBLP:conf/spaa/CaoFLMRU22\",\"bibbaseid\":\"cao-fineman-li-mestre-russell-umboh-briefannouncementnestedactivetimescheduling-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1145/3490148.3538554\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Joachim\"],\"propositions\":[],\"lastnames\":[\"Gudmundsson\"],\"suffixes\":[]},{\"firstnames\":[\"Julián\"],\"propositions\":[],\"lastnames\":[\"Mestre\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"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\",\"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\",\"bibtex\":\"@article{DBLP:journals/dam/GudmundssonMU21,\\n  author    = {Joachim Gudmundsson and\\n               Juli{\\\\'{a}}n Mestre and\\n               Seeun William Umboh},\\n  title     = {Bounded-degree light approximate shortest-path trees in doubling metrics},\\n  journal   = {Discret. Appl. Math.},\\n  volume    = {305},\\n  pages     = {199--204},\\n  year      = {2021},\\n  url       = {https://doi.org/10.1016/j.dam.2021.08.039},\\n  timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},\\n  biburl    = {https://dblp.org/rec/journals/dam/GudmundssonMU21.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Gudmundsson, J.\",\"Mestre, J.\",\"Umboh, S. W.\"],\"key\":\"DBLP:journals/dam/GudmundssonMU21\",\"id\":\"DBLP:journals/dam/GudmundssonMU21\",\"bibbaseid\":\"gudmundsson-mestre-umboh-boundeddegreelightapproximateshortestpathtreesindoublingmetrics-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1016/j.dam.2021.08.039\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Shuchi\"],\"propositions\":[],\"lastnames\":[\"Chawla\"],\"suffixes\":[]},{\"firstnames\":[\"Joseph\"],\"propositions\":[],\"lastnames\":[\"Naor\"],\"suffixes\":[]},{\"firstnames\":[\"Debmalya\"],\"propositions\":[],\"lastnames\":[\"Panigrahi\"],\"suffixes\":[]},{\"firstnames\":[\"Mohit\"],\"propositions\":[],\"lastnames\":[\"Singh\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"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\",\"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\",\"bibtex\":\"@article{DBLP:journals/teco/ChawlaNPSU21,\\n  author    = {Shuchi Chawla and\\n               Joseph Naor and\\n               Debmalya Panigrahi and\\n               Mohit Singh and\\n               Seeun William Umboh},\\n  title     = {Timing Matters: Online Dynamics in Broadcast Games},\\n  journal   = {{ACM} Trans. Economics and Comput.},\\n  volume    = {9},\\n  number    = {2},\\n  pages     = {11:1--11:22},\\n  year      = {2021},\\n  url       = {https://doi.org/10.1145/3434425},\\n  timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},\\n  biburl    = {https://dblp.org/rec/journals/teco/ChawlaNPSU21.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Chawla, S.\",\"Naor, J.\",\"Panigrahi, D.\",\"Singh, M.\",\"Umboh, S. W.\"],\"key\":\"DBLP:journals/teco/ChawlaNPSU21\",\"id\":\"DBLP:journals/teco/ChawlaNPSU21\",\"bibbaseid\":\"chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1145/3434425\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Julián\"],\"propositions\":[],\"lastnames\":[\"Mestre\"],\"suffixes\":[]},{\"firstnames\":[\"Sergey\"],\"propositions\":[],\"lastnames\":[\"Pupyrev\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"On the Extended TSP Problem\",\"booktitle\":\"International Symposium on Algorithms and Computation (ISAAC)\",\"year\":\"2021\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/isaac/MestrePU21,\\n  author    = {Juli{\\\\'{a}}n Mestre and\\n               Sergey Pupyrev and\\n               Seeun William Umboh},\\n  title     = {On the Extended {TSP} Problem},\\n  booktitle = {International Symposium on Algorithms and Computation {(ISAAC)}},\\n  year      = {2021},\\n  url       = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.42},\\n  timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},\\n  biburl    = {https://dblp.org/rec/conf/isaac/MestrePU21.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Mestre, J.\",\"Pupyrev, S.\",\"Umboh, S. W.\"],\"key\":\"DBLP:conf/isaac/MestrePU21\",\"id\":\"DBLP:conf/isaac/MestrePU21\",\"bibbaseid\":\"mestre-pupyrev-umboh-ontheextendedtspproblem-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.4230/LIPIcs.ISAAC.2021.42\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Nikhil\"],\"propositions\":[],\"lastnames\":[\"Bansal\"],\"suffixes\":[]},{\"firstnames\":[\"Martin\"],\"propositions\":[],\"lastnames\":[\"Böhm\"],\"suffixes\":[]},{\"firstnames\":[\"Marek\"],\"propositions\":[],\"lastnames\":[\"Eliás\"],\"suffixes\":[]},{\"firstnames\":[\"Grigorios\"],\"propositions\":[],\"lastnames\":[\"Koumoutsos\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"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\",\"timestamp\":\"Tue, 15 Feb 2022 00:00:00 +0100\",\"biburl\":\"https://dblp.org/rec/journals/algorithmica/BansalBEKU20.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@article{DBLP:journals/algorithmica/BansalBEKU20,\\n  author    = {Nikhil Bansal and\\n               Martin B{\\\\\\\"{o}}hm and\\n               Marek Eli{\\\\'{a}}s and\\n               Grigorios Koumoutsos and\\n               Seeun William Umboh},\\n  title     = {Nested Convex Bodies are Chaseable},\\n  journal   = {Algorithmica},\\n  volume    = {82},\\n  number    = {6},\\n  pages     = {1640--1653},\\n  year      = {2020},\\n  url       = {https://doi.org/10.1007/s00453-019-00661-x},\\n  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\\n  biburl    = {https://dblp.org/rec/journals/algorithmica/BansalBEKU20.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Bansal, N.\",\"Böhm, M.\",\"Eliás, M.\",\"Koumoutsos, G.\",\"Umboh, S. W.\"],\"key\":\"DBLP:journals/algorithmica/BansalBEKU20\",\"id\":\"DBLP:journals/algorithmica/BansalBEKU20\",\"bibbaseid\":\"bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1007/s00453-019-00661-x\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Mark\"],\"propositions\":[\"de\"],\"lastnames\":[\"Berg\"],\"suffixes\":[]},{\"firstnames\":[\"Aleksandar\"],\"propositions\":[],\"lastnames\":[\"Markovic\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"The Online Broadcast Range-Assignment Problem\",\"booktitle\":\"International Symposium on Algorithms and Computation (ISAAC)\",\"year\":\"2020\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/isaac/Berg0U20,\\n  author    = {Mark de Berg and\\n               Aleksandar Markovic and\\n               Seeun William Umboh},\\n  title     = {The Online Broadcast Range-Assignment Problem},\\n  booktitle = {International Symposium on Algorithms and Computation {(ISAAC)}},\\n  year      = {2020},\\n  url       = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.60},\\n  timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},\\n  biburl    = {https://dblp.org/rec/conf/isaac/Berg0U20.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"de Berg, M.\",\"Markovic, A.\",\"Umboh, S. W.\"],\"key\":\"DBLP:conf/isaac/Berg0U20\",\"id\":\"DBLP:conf/isaac/Berg0U20\",\"bibbaseid\":\"deberg-markovic-umboh-theonlinebroadcastrangeassignmentproblem-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.4230/LIPIcs.ISAAC.2020.60\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Yair\"],\"propositions\":[],\"lastnames\":[\"Bartal\"],\"suffixes\":[]},{\"firstnames\":[\"Nova\"],\"propositions\":[],\"lastnames\":[\"Fandina\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds\",\"booktitle\":\"ACM-SIAM Symposium on Discrete Algorithms (SODA)\",\"year\":\"2020\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/soda/BartalFU20,\\n  author    = {Yair Bartal and\\n               Nova Fandina and\\n               Seeun William Umboh},\\n  title     = {Online Probabilistic Metric Embedding: {A} General Framework for Bypassing\\n               Inherent Bounds},\\n  booktitle = {{ACM-SIAM} Symposium on Discrete Algorithms\\n               {(SODA)}},\\n  year      = {2020},\\n  url       = {https://doi.org/10.1137/1.9781611975994.95},\\n  timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},\\n  biburl    = {https://dblp.org/rec/conf/soda/BartalFU20.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\\n\",\"author_short\":[\"Bartal, Y.\",\"Fandina, N.\",\"Umboh, S. W.\"],\"key\":\"DBLP:conf/soda/BartalFU20\",\"id\":\"DBLP:conf/soda/BartalFU20\",\"bibbaseid\":\"bartal-fandina-umboh-onlineprobabilisticmetricembeddingageneralframeworkforbypassinginherentbounds-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1137/1.9781611975994.95\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Joseph\",\"(Seffi)\"],\"propositions\":[],\"lastnames\":[\"Naor\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]},{\"firstnames\":[\"David\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Williamson\"],\"suffixes\":[]}],\"title\":\"Tight Bounds for Online Weighted Tree Augmentation\",\"booktitle\":\"International Colloquium on Automata, Languages, and Programming, (ICALP)\",\"year\":\"2019\",\"url\":\"https://doi.org/10.4230/LIPIcs.ICALP.2019.88\",\"timestamp\":\"Tue, 11 Feb 2020 15:52:14 +0100\",\"biburl\":\"https://dblp.org/rec/conf/icalp/NaorUW19.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@inproceedings{DBLP:conf/icalp/NaorUW19,\\n  author    = {Joseph (Seffi) Naor and\\n               Seeun William Umboh and\\n               David P. Williamson},\\n  title     = {Tight Bounds for Online Weighted Tree Augmentation},\\n  booktitle = {International Colloquium on Automata, Languages, and Programming,\\n               {(ICALP)}},\\n  year      = {2019},\\n  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2019.88},\\n  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},\\n  biburl    = {https://dblp.org/rec/conf/icalp/NaorUW19.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Naor, J. (.\",\"Umboh, S. W.\",\"Williamson, D. P.\"],\"key\":\"DBLP:conf/icalp/NaorUW19\",\"id\":\"DBLP:conf/icalp/NaorUW19\",\"bibbaseid\":\"naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.4230/LIPIcs.ICALP.2019.88\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Jiawei\"],\"propositions\":[],\"lastnames\":[\"Qian\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]},{\"firstnames\":[\"David\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Williamson\"],\"suffixes\":[]}],\"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\",\"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\",\"bibtex\":\"@article{DBLP:journals/algorithmica/QianUW18,\\n  author    = {Jiawei Qian and\\n               Seeun William Umboh and\\n               David P. Williamson},\\n  title     = {Online Constrained Forest and Prize-Collecting Network Design},\\n  journal   = {Algorithmica},\\n  volume    = {80},\\n  number    = {11},\\n  pages     = {3335--3364},\\n  year      = {2018},\\n  url       = {https://doi.org/10.1007/s00453-017-0391-4},\\n  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},\\n  biburl    = {https://dblp.org/rec/journals/algorithmica/QianUW18.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Qian, J.\",\"Umboh, S. W.\",\"Williamson, D. P.\"],\"key\":\"DBLP:journals/algorithmica/QianUW18\",\"id\":\"DBLP:journals/algorithmica/QianUW18\",\"bibbaseid\":\"qian-umboh-williamson-onlineconstrainedforestandprizecollectingnetworkdesign-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1007/s00453-017-0391-4\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Nikhil\"],\"propositions\":[],\"lastnames\":[\"Bansal\"],\"suffixes\":[]},{\"firstnames\":[\"Martin\"],\"propositions\":[],\"lastnames\":[\"Böhm\"],\"suffixes\":[]},{\"firstnames\":[\"Marek\"],\"propositions\":[],\"lastnames\":[\"Eliás\"],\"suffixes\":[]},{\"firstnames\":[\"Grigorios\"],\"propositions\":[],\"lastnames\":[\"Koumoutsos\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"Nested Convex Bodies are Chaseable\",\"booktitle\":\"ACM-SIAM Symposium on Discrete Algorithms (SODA)\",\"year\":\"2018\",\"url\":\"https://doi.org/10.1137/1.9781611975031.81\",\"timestamp\":\"Tue, 15 Feb 2022 00:00:00 +0100\",\"biburl\":\"https://dblp.org/rec/conf/soda/BansalB0KU18.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@inproceedings{DBLP:conf/soda/BansalB0KU18,\\n  author    = {Nikhil Bansal and\\n               Martin B{\\\\\\\"{o}}hm and\\n               Marek Eli{\\\\'{a}}s and\\n               Grigorios Koumoutsos and\\n               Seeun William Umboh},\\n  title     = {Nested Convex Bodies are Chaseable},\\n  booktitle = {{ACM-SIAM} Symposium on Discrete\\n               Algorithms {(SODA)}},\\n  year      = {2018},\\n  url       = {https://doi.org/10.1137/1.9781611975031.81},\\n  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\\n  biburl    = {https://dblp.org/rec/conf/soda/BansalB0KU18.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Bansal, N.\",\"Böhm, M.\",\"Eliás, M.\",\"Koumoutsos, G.\",\"Umboh, S. W.\"],\"key\":\"DBLP:conf/soda/BansalB0KU18\",\"id\":\"DBLP:conf/soda/BansalB0KU18\",\"bibbaseid\":\"bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1137/1.9781611975031.81\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Shuchi\"],\"propositions\":[],\"lastnames\":[\"Chawla\"],\"suffixes\":[]},{\"firstnames\":[\"Joseph\",\"(Seffi)\"],\"propositions\":[],\"lastnames\":[\"Naor\"],\"suffixes\":[]},{\"firstnames\":[\"Debmalya\"],\"propositions\":[],\"lastnames\":[\"Panigrahi\"],\"suffixes\":[]},{\"firstnames\":[\"Mohit\"],\"propositions\":[],\"lastnames\":[\"Singh\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"Timing Matters: Online Dynamics in Broadcast Games\",\"booktitle\":\"International Conference on Web and Internet Economics (WINE)\",\"year\":\"2018\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/wine/0001NPSU18,\\n  author    = {Shuchi Chawla and\\n               Joseph (Seffi) Naor and\\n               Debmalya Panigrahi and\\n               Mohit Singh and\\n               Seeun William Umboh},\\n  title     = {Timing Matters: Online Dynamics in Broadcast Games},\\n  booktitle = {International Conference on Web and Internet Economics {(WINE)}},\\n  year      = {2018},\\n  url       = {https://doi.org/10.1007/978-3-030-04612-5\\\\_6},\\n  timestamp = {Tue, 14 May 2019 10:00:36 +0200},\\n  biburl    = {https://dblp.org/rec/conf/wine/0001NPSU18.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Chawla, S.\",\"Naor, J. (.\",\"Panigrahi, D.\",\"Singh, M.\",\"Umboh, S. W.\"],\"key\":\"DBLP:conf/wine/0001NPSU18\",\"id\":\"DBLP:conf/wine/0001NPSU18\",\"bibbaseid\":\"chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1007/978-3-030-04612-5\\\\_6\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Nikhil\"],\"propositions\":[],\"lastnames\":[\"Bansal\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"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\",\"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\",\"bibtex\":\"@article{DBLP:journals/ipl/BansalU17,\\n  author    = {Nikhil Bansal and\\n               Seeun William Umboh},\\n  title     = {Tight approximation bounds for dominating set on graphs of bounded\\n               arboricity},\\n  journal   = {Inf. Process. Lett.},\\n  volume    = {122},\\n  pages     = {21--24},\\n  year      = {2017},\\n  url       = {https://doi.org/10.1016/j.ipl.2017.01.011},\\n  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\\n  biburl    = {https://dblp.org/rec/journals/ipl/BansalU17.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Bansal, N.\",\"Umboh, S. W.\"],\"key\":\"DBLP:journals/ipl/BansalU17\",\"id\":\"DBLP:journals/ipl/BansalU17\",\"bibbaseid\":\"bansal-umboh-tightapproximationboundsfordominatingsetongraphsofboundedarboricity-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1016/j.ipl.2017.01.011\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Anupam\"],\"propositions\":[],\"lastnames\":[\"Gupta\"],\"suffixes\":[]},{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Ravi\"],\"suffixes\":[]},{\"firstnames\":[\"Kunal\"],\"propositions\":[],\"lastnames\":[\"Talwar\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"LAST but not Least: Online Spanners for Buy-at-Bulk\",\"booktitle\":\"ACM-SIAM Symposium on Discrete Algorithms (SODA)\",\"year\":\"2017\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/soda/Gupta0TU17,\\n  author    = {Anupam Gupta and\\n               R. Ravi and\\n               Kunal Talwar and\\n               Seeun William Umboh},\\n  title     = {{LAST} but not Least: Online Spanners for Buy-at-Bulk},\\n  booktitle = {{ACM-SIAM} Symposium on Discrete\\n               Algorithms {(SODA)}},\\n  year      = {2017},\\n  url       = {https://doi.org/10.1137/1.9781611974782.38},\\n  timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},\\n  biburl    = {https://dblp.org/rec/conf/soda/Gupta0TU17.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Gupta, A.\",\"Ravi, R.\",\"Talwar, K.\",\"Umboh, S. W.\"],\"key\":\"DBLP:conf/soda/Gupta0TU17\",\"id\":\"DBLP:conf/soda/Gupta0TU17\",\"bibbaseid\":\"gupta-ravi-talwar-umboh-lastbutnotleastonlinespannersforbuyatbulk-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1137/1.9781611974782.38\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Nikhil\"],\"propositions\":[],\"lastnames\":[\"Bansal\"],\"suffixes\":[]},{\"firstnames\":[\"Daniel\"],\"propositions\":[],\"lastnames\":[\"Reichman\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\",\"William\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs\",\"booktitle\":\"ACM-SIAM Symposium on Discrete Algorithms (SODA)\",\"year\":\"2017\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/soda/Bansal0U17,\\n  author    = {Nikhil Bansal and\\n               Daniel Reichman and\\n               Seeun William Umboh},\\n  title     = {LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth\\n               Graphs},\\n  booktitle = {{ACM-SIAM} Symposium on Discrete\\n               Algorithms {(SODA)}},\\n  year      = {2017},\\n  url       = {https://doi.org/10.1137/1.9781611974782.128},\\n  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\\n  biburl    = {https://dblp.org/rec/conf/soda/Bansal0U17.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Bansal, N.\",\"Reichman, D.\",\"Umboh, S. W.\"],\"key\":\"DBLP:conf/soda/Bansal0U17\",\"id\":\"DBLP:conf/soda/Bansal0U17\",\"bibbaseid\":\"bansal-reichman-umboh-lpbasedrobustalgorithmsfornoisyminorfreeandboundedtreewidthgraphs-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1137/1.9781611974782.128\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Seeun\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"Online Network Design Algorithms via Hierarchical Decompositions\",\"booktitle\":\"ACM-SIAM Symposium on Discrete Algorithms (SODA) 2015\",\"year\":\"2015\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/soda/Umboh15,\\n  author    = {Seeun Umboh},\\n  title     = {Online Network Design Algorithms via Hierarchical Decompositions},\\n  booktitle = {{ACM-SIAM} Symposium on Discrete\\n               Algorithms {(SODA)} 2015},\\n  year      = {2015},\\n  url       = {https://doi.org/10.1137/1.9781611973730.91},\\n  timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},\\n  biburl    = {https://dblp.org/rec/conf/soda/Umboh15.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Umboh, S.\"],\"key\":\"DBLP:conf/soda/Umboh15\",\"id\":\"DBLP:conf/soda/Umboh15\",\"bibbaseid\":\"umboh-onlinenetworkdesignalgorithmsviahierarchicaldecompositions-2015\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1137/1.9781611973730.91\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Siddharth\"],\"propositions\":[],\"lastnames\":[\"Barman\"],\"suffixes\":[]},{\"firstnames\":[\"Shuchi\"],\"propositions\":[],\"lastnames\":[\"Chawla\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"Network Design with Coverage Costs\",\"booktitle\":\"International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)\",\"year\":\"2014\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/approx/BarmanCU14,\\n  author    = {Siddharth Barman and\\n               Shuchi Chawla and\\n               Seeun Umboh},\\n  title     = {Network Design with Coverage Costs},\\n  booktitle = {International Conference on Approximation Algorithms for Combinatorial Optimization Problems {(APPROX)}},\\n  year      = {2014},\\n  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.48},\\n  timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},\\n  biburl    = {https://dblp.org/rec/conf/approx/BarmanCU14.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Barman, S.\",\"Chawla, S.\",\"Umboh, S.\"],\"key\":\"DBLP:conf/approx/BarmanCU14\",\"id\":\"DBLP:conf/approx/BarmanCU14\",\"bibbaseid\":\"barman-chawla-umboh-networkdesignwithcoveragecosts-2014\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.48\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Siddharth\"],\"propositions\":[],\"lastnames\":[\"Barman\"],\"suffixes\":[]},{\"firstnames\":[\"Shuchi\"],\"propositions\":[],\"lastnames\":[\"Chawla\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"A Bicriteria Approximation for the Reordering Buffer Problem\",\"booktitle\":\"European Symposium on Algorithms (ESA)\",\"year\":\"2012\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/esa/BarmanCU12,\\n  author    = {Siddharth Barman and\\n               Shuchi Chawla and\\n               Seeun Umboh},\\n  title     = {A Bicriteria Approximation for the Reordering Buffer Problem},\\n  booktitle = {European Symposium on Algorithms {(ESA)}},\\n  year      = {2012},\\n  url       = {https://doi.org/10.1007/978-3-642-33090-2\\\\_15},\\n  timestamp = {Tue, 14 May 2019 10:00:54 +0200},\\n  biburl    = {https://dblp.org/rec/conf/esa/BarmanCU12.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Barman, S.\",\"Chawla, S.\",\"Umboh, S.\"],\"key\":\"DBLP:conf/esa/BarmanCU12\",\"id\":\"DBLP:conf/esa/BarmanCU12\",\"bibbaseid\":\"barman-chawla-umboh-abicriteriaapproximationforthereorderingbufferproblem-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1007/978-3-642-33090-2\\\\_15\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Siddharth\"],\"propositions\":[],\"lastnames\":[\"Barman\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]},{\"firstnames\":[\"Shuchi\"],\"propositions\":[],\"lastnames\":[\"Chawla\"],\"suffixes\":[]},{\"firstnames\":[\"David\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Malec\"],\"suffixes\":[]}],\"title\":\"Secretary Problems with Convex Costs\",\"booktitle\":\"International Colloquium on Automata, Languages, and Programming (ICALP)\",\"year\":\"2012\",\"url\":\"https://doi.org/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\",\"bibtex\":\"@inproceedings{DBLP:conf/icalp/BarmanUCM12,\\n  author    = {Siddharth Barman and\\n               Seeun Umboh and\\n               Shuchi Chawla and\\n               David L. Malec},\\n  title     = {Secretary Problems with Convex Costs},\\n  booktitle = {International Colloquium on Automata, Languages, and Programming {(ICALP)}},\\n  year      = {2012},\\n  url       = {https://doi.org/10.1007/978-3-642-31594-7\\\\_7},\\n  timestamp = {Tue, 14 May 2019 10:00:44 +0200},\\n  biburl    = {https://dblp.org/rec/conf/icalp/BarmanUCM12.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Barman, S.\",\"Umboh, S.\",\"Chawla, S.\",\"Malec, D. L.\"],\"key\":\"DBLP:conf/icalp/BarmanUCM12\",\"id\":\"DBLP:conf/icalp/BarmanUCM12\",\"bibbaseid\":\"barman-umboh-chawla-malec-secretaryproblemswithconvexcosts-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1007/978-3-642-31594-7\\\\_7\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Eric\"],\"propositions\":[],\"lastnames\":[\"Bach\"],\"suffixes\":[]},{\"firstnames\":[\"Shuchi\"],\"propositions\":[],\"lastnames\":[\"Chawla\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"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\",\"timestamp\":\"Wed, 12 Aug 2020 01:00:00 +0200\",\"biburl\":\"https://dblp.org/rec/journals/dmaa/BachCU10.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@article{DBLP:journals/dmaa/BachCU10,\\n  author    = {Eric Bach and\\n               Shuchi Chawla and\\n               Seeun Umboh},\\n  title     = {Threshold Rules for Online Sample Selection},\\n  journal   = {Discret. Math. Algorithms Appl.},\\n  volume    = 2,\\n  number    = 4,\\n  pages     = {625--642},\\n  year      = 2010,\\n  url       = {https://doi.org/10.1142/S1793830910000929},\\n  timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},\\n  biburl    = {https://dblp.org/rec/journals/dmaa/BachCU10.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Bach, E.\",\"Chawla, S.\",\"Umboh, S.\"],\"key\":\"DBLP:journals/dmaa/BachCU10\",\"id\":\"DBLP:journals/dmaa/BachCU10\",\"bibbaseid\":\"bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1142/S1793830910000929\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Eric\"],\"propositions\":[],\"lastnames\":[\"Bach\"],\"suffixes\":[]},{\"firstnames\":[\"Shuchi\"],\"propositions\":[],\"lastnames\":[\"Chawla\"],\"suffixes\":[]},{\"firstnames\":[\"Seeun\"],\"propositions\":[],\"lastnames\":[\"Umboh\"],\"suffixes\":[]}],\"title\":\"Threshold Rules for Online Sample Selection\",\"booktitle\":\"International Conference on Computing and Combinatorics (COCOON)\",\"year\":\"2010\",\"url\":\"https://doi.org/10.1007/978-3-642-14031-0\\\\_52\",\"timestamp\":\"Tue, 14 May 2019 10:00:35 +0200\",\"biburl\":\"https://dblp.org/rec/conf/cocoon/BachCU10.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@inproceedings{DBLP:conf/cocoon/BachCU10,\\n  author    = {Eric Bach and\\n               Shuchi Chawla and\\n               Seeun Umboh},\\n  title     = {Threshold Rules for Online Sample Selection},\\n  booktitle = {International Conference on Computing and Combinatorics {(COCOON)}},\\n  year      = {2010},\\n  url       = {https://doi.org/10.1007/978-3-642-14031-0\\\\_52},\\n  timestamp = {Tue, 14 May 2019 10:00:35 +0200},\\n  biburl    = {https://dblp.org/rec/conf/cocoon/BachCU10.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\\n\",\"author_short\":[\"Bach, E.\",\"Chawla, S.\",\"Umboh, S.\"],\"key\":\"DBLP:conf/cocoon/BachCU10\",\"id\":\"DBLP:conf/cocoon/BachCU10\",\"bibbaseid\":\"bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1007/978-3-642-14031-0\\\\_52\"},\"metadata\":{\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\"downloads\":2,\"html\":\"\"}],\n      metadata: {\"owner\":\"umboh, s\",\"authorlinks\":{\"umboh, s\":\"https://williamumboh.com/williamumboh.github.io-old/\"}},\n      ownerID: \"53S57KLCxi6WLZTon\"\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"qyK8KPx6JHiBjGaRs\" href=\"data:text/bibtex;base64,@inproceedings{LeUX23,
  author       = {Ngoc Mai Le and
                  Seeun William Umboh and
                  Ningyuanp 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 20:51:37 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/LeUX23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}



@inproceedings{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    = {Tue, 21 Mar 2023 20:56:18 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/CaoFLMRU22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}


@article{supercomputing,
  author    = {Valon Raca and
               Seeun William Umboh and
               Eduard Mehofer and
	       Bernhard Scholz},
  title     = {Runtime and Energy Constrained Work Scheduling for Heterogeneous Systems},
  journal   = {Journal of Supercomputing},
  year      = {2022},
  url       = {https://doi.org/10.1007/s11227-022-04556-7}
}



@article{DBLP:journals/algorithmica/NaorUW22,
  author    = {Joseph 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},
  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}
}



@inproceedings{DBLP:conf/icalp/ChenKU22,
  author    = {Ryder Chen and
               Jahanvi Khatkar and
               Seeun William Umboh},
  title     = {Online Weighted Cardinality Joint Replenishment Problem with Delay},
  booktitle = {International Colloquium on Automata, Languages, and Programming
               {(ICALP)}},
  year      = {2022},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2022.40},
  timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/ChenKU22.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},
  title     = {Brief Announcement: Nested Active-Time Scheduling},
  booktitle = {Symposium on Parallelism in Algorithms and
               Architectures {(SPAA)}},
  year      = {2022},
  url       = {https://doi.org/10.1145/3490148.3538554},
  timestamp = {Tue, 12 Jul 2022 14:22:25 +0200},
  biburl    = {https://dblp.org/rec/conf/spaa/CaoFLMRU22.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},
  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 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},
  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},
  title     = {On the Extended {TSP} Problem},
  booktitle = {International Symposium on Algorithms and Computation {(ISAAC)}},
  year      = {2021},
  url       = {https://doi.org/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/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},
  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
  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},
  title     = {The Online Broadcast Range-Assignment Problem},
  booktitle = {International Symposium on Algorithms and Computation {(ISAAC)}},
  year      = {2020},
  url       = {https://doi.org/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},
  title     = {Online Probabilistic Metric Embedding: {A} General Framework for Bypassing
               Inherent Bounds},
  booktitle = {{ACM-SIAM} Symposium on Discrete Algorithms
               {(SODA)}},
  year      = {2020},
  url       = {https://doi.org/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}
}




@inproceedings{DBLP:conf/icalp/NaorUW19,
  author    = {Joseph (Seffi) Naor and
               Seeun William Umboh and
               David P. Williamson},
  title     = {Tight Bounds for Online Weighted Tree Augmentation},
  booktitle = {International Colloquium on Automata, Languages, and Programming,
               {(ICALP)}},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2019.88},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/NaorUW19.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},
  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},
  title     = {Nested Convex Bodies are Chaseable},
  booktitle = {{ACM-SIAM} Symposium on Discrete
               Algorithms {(SODA)}},
  year      = {2018},
  url       = {https://doi.org/10.1137/1.9781611975031.81},
  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
  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},
  title     = {Timing Matters: Online Dynamics in Broadcast Games},
  booktitle = {International Conference on Web and Internet Economics {(WINE)}},
  year      = {2018},
  url       = {https://doi.org/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},
  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},
  title     = {{LAST} but not Least: Online Spanners for Buy-at-Bulk},
  booktitle = {{ACM-SIAM} Symposium on Discrete
               Algorithms {(SODA)}},
  year      = {2017},
  url       = {https://doi.org/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},
  title     = {LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth
               Graphs},
  booktitle = {{ACM-SIAM} Symposium on Discrete
               Algorithms {(SODA)}},
  year      = {2017},
  url       = {https://doi.org/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}
}



@inproceedings{DBLP:conf/soda/Umboh15,
  author    = {Seeun Umboh},
  title     = {Online Network Design Algorithms via Hierarchical Decompositions},
  booktitle = {{ACM-SIAM} Symposium on Discrete
               Algorithms {(SODA)} 2015},
  year      = {2015},
  url       = {https://doi.org/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},
  title     = {Network Design with Coverage Costs},
  booktitle = {International Conference on Approximation Algorithms for Combinatorial Optimization Problems {(APPROX)}},
  year      = {2014},
  url       = {https://doi.org/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}
}



@inproceedings{DBLP:conf/esa/BarmanCU12,
  author    = {Siddharth Barman and
               Shuchi Chawla and
               Seeun Umboh},
  title     = {A Bicriteria Approximation for the Reordering Buffer Problem},
  booktitle = {European Symposium on Algorithms {(ESA)}},
  year      = {2012},
  url       = {https://doi.org/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},
  title     = {Secretary Problems with Convex Costs},
  booktitle = {International Colloquium on Automata, Languages, and Programming {(ICALP)}},
  year      = {2012},
  url       = {https://doi.org/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/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},
  timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
  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},
  title     = {Threshold Rules for Online Sample Selection},
  booktitle = {International Conference on Computing and Combinatorics {(COCOON)}},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14031-0\_52},
  timestamp = {Tue, 14 May 2019 10:00:35 +0200},
  biburl    = {https://dblp.org/rec/conf/cocoon/BachCU10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://bibbase.org/network/files/qyK8KPx6JHiBjGaRs\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://bibbase.org/network/files/qyK8KPx6JHiBjGaRs\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FqyK8KPx6JHiBjGaRs&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FqyK8KPx6JHiBjGaRs&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FqyK8KPx6JHiBjGaRs&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"le-umboh-xie-thepowerofclairvoyanceformultilevelaggregationandsetcoverwithdelay-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1137/1.9781611977554.ch59\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'le-umboh-xie-thepowerofclairvoyanceformultilevelaggregationandsetcoverwithdelay-2023', 'https://doi.org/10.1137/1.9781611977554.ch59', event);\">\n    The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Le, N. M.; <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>;  and Xie, N.\n</span>\n\n  \n\n</span>\n\n  In Bansal, N.;  and Nagarajan, V., editor(s), <i>Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023</i>, pages 1594–1610,  2023. SIAM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1137/1.9781611977554.ch59\"\n     onclick=\"log_download('le-umboh-xie-thepowerofclairvoyanceformultilevelaggregationandsetcoverwithdelay-2023', 'https://doi.org/10.1137/1.9781611977554.ch59', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1137/1.9781611977554.ch59\"\n     onclick=\"log_download('le-umboh-xie-thepowerofclairvoyanceformultilevelaggregationandsetcoverwithdelay-2023', 'http://doi.org/10.1137/1.9781611977554.ch59', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/le-umboh-xie-thepowerofclairvoyanceformultilevelaggregationandsetcoverwithdelay-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('le-umboh-xie-thepowerofclairvoyanceformultilevelaggregationandsetcoverwithdelay-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{LeUX23,\n  author       = {Ngoc Mai Le and\n                  Seeun William Umboh and\n                  Ningyuanp Xie},\n  editor       = {Nikhil Bansal and\n                  Viswanath Nagarajan},\n  title        = {The Power of Clairvoyance for Multi-Level Aggregation and Set Cover\n                  with Delay},\n  booktitle    = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,\n                  {SODA} 2023, Florence, Italy, January 22-25, 2023},\n  pages        = {1594--1610},\n  publisher    = {{SIAM}},\n  year         = {2023},\n  url          = {https://doi.org/10.1137/1.9781611977554.ch59},\n  doi          = {10.1137/1.9781611977554.ch59},\n  timestamp    = {Tue, 21 Mar 2023 20:51:37 +0100},\n  biburl       = {https://dblp.org/rec/conf/soda/LeUX23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cao-fineman-li-mestre-russell-umboh-nestedactivetimescheduling-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2022.36\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cao-fineman-li-mestre-russell-umboh-nestedactivetimescheduling-2022', 'https://doi.org/10.4230/LIPIcs.ISAAC.2022.36', event);\">\n    Nested Active-Time Scheduling.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Cao, N.; Fineman, J. T.; Li, S.; Mestre, J.; Russell, K.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In Bae, S. W.;  and Park, H., editor(s), <i>33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea</i>, volume 248, of <i>LIPIcs</i>, pages 36:1–36:16,  2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2022.36\"\n     onclick=\"log_download('cao-fineman-li-mestre-russell-umboh-nestedactivetimescheduling-2022', 'https://doi.org/10.4230/LIPIcs.ISAAC.2022.36', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Nested Active-Time Scheduling [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4230/LIPIcs.ISAAC.2022.36\"\n     onclick=\"log_download('cao-fineman-li-mestre-russell-umboh-nestedactivetimescheduling-2022', 'http://doi.org/10.4230/LIPIcs.ISAAC.2022.36', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cao-fineman-li-mestre-russell-umboh-nestedactivetimescheduling-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cao-fineman-li-mestre-russell-umboh-nestedactivetimescheduling-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{CaoFLMRU22,\n  author       = {Nairen Cao and\n                  Jeremy T. Fineman and\n                  Shi Li and\n                  Juli{\\&#x27;{a}}n Mestre and\n                  Katina Russell and\n                  Seeun William Umboh},\n  editor       = {Sang Won Bae and\n                  Heejin Park},\n  title        = {Nested Active-Time Scheduling},\n  booktitle    = {33rd International Symposium on Algorithms and Computation, {ISAAC}\n                  2022, December 19-21, 2022, Seoul, Korea},\n  series       = {LIPIcs},\n  volume       = {248},\n  pages        = {36:1--36:16},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\&quot;{u}}r Informatik},\n  year         = {2022},\n  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.36},\n  doi          = {10.4230/LIPIcs.ISAAC.2022.36},\n  timestamp    = {Tue, 21 Mar 2023 20:56:18 +0100},\n  biburl       = {https://dblp.org/rec/conf/isaac/CaoFLMRU22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"raca-umboh-mehofer-scholz-runtimeandenergyconstrainedworkschedulingforheterogeneoussystems-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1007/s11227-022-04556-7\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'raca-umboh-mehofer-scholz-runtimeandenergyconstrainedworkschedulingforheterogeneoussystems-2022', 'https://doi.org/10.1007/s11227-022-04556-7', event);\">\n    Runtime and Energy Constrained Work Scheduling for Heterogeneous Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Raca, V.; <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>; Mehofer, E.;  and Scholz, B.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Supercomputing</i>.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1007/s11227-022-04556-7\"\n     onclick=\"log_download('raca-umboh-mehofer-scholz-runtimeandenergyconstrainedworkschedulingforheterogeneoussystems-2022', 'https://doi.org/10.1007/s11227-022-04556-7', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Runtime and Energy Constrained Work Scheduling for Heterogeneous Systems [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/raca-umboh-mehofer-scholz-runtimeandenergyconstrainedworkschedulingforheterogeneoussystems-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('raca-umboh-mehofer-scholz-runtimeandenergyconstrainedworkschedulingforheterogeneoussystems-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{supercomputing,\n  author    = {Valon Raca and\n               Seeun William Umboh and\n               Eduard Mehofer and\n\t       Bernhard Scholz},\n  title     = {Runtime and Energy Constrained Work Scheduling for Heterogeneous Systems},\n  journal   = {Journal of Supercomputing},\n  year      = {2022},\n  url       = {https://doi.org/10.1007/s11227-022-04556-7}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1007/s00453-021-00888-7\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2022', 'https://doi.org/10.1007/s00453-021-00888-7', event);\">\n    Tight Bounds for Online Weighted Tree Augmentation.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Naor, J.; <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>;  and Williamson, D. P.\n</span>\n\n  \n\n</span>\n\n  <i>Algorithmica</i>, 84(2): 304–324.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1007/s00453-021-00888-7\"\n     onclick=\"log_download('naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2022', 'https://doi.org/10.1007/s00453-021-00888-7', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Tight Bounds for Online Weighted Tree Augmentation [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/algorithmica/NaorUW22,\n  author    = {Joseph Naor and\n               Seeun William Umboh and\n               David P. Williamson},\n  title     = {Tight Bounds for Online Weighted Tree Augmentation},\n  journal   = {Algorithmica},\n  volume    = {84},\n  number    = {2},\n  pages     = {304--324},\n  year      = {2022},\n  url       = {https://doi.org/10.1007/s00453-021-00888-7},\n  timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},\n  biburl    = {https://dblp.org/rec/journals/algorithmica/NaorUW22.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"chen-khatkar-umboh-onlineweightedcardinalityjointreplenishmentproblemwithdelay-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2022.40\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'chen-khatkar-umboh-onlineweightedcardinalityjointreplenishmentproblemwithdelay-2022', 'https://doi.org/10.4230/LIPIcs.ICALP.2022.40', event);\">\n    Online Weighted Cardinality Joint Replenishment Problem with Delay.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Chen, R.; Khatkar, J.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>International Colloquium on Automata, Languages, and Programming (ICALP)</i>,  2022. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2022.40\"\n     onclick=\"log_download('chen-khatkar-umboh-onlineweightedcardinalityjointreplenishmentproblemwithdelay-2022', 'https://doi.org/10.4230/LIPIcs.ICALP.2022.40', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Online Weighted Cardinality Joint Replenishment Problem with Delay [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chen-khatkar-umboh-onlineweightedcardinalityjointreplenishmentproblemwithdelay-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>6 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chen-khatkar-umboh-onlineweightedcardinalityjointreplenishmentproblemwithdelay-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/icalp/ChenKU22,\n  author    = {Ryder Chen and\n               Jahanvi Khatkar and\n               Seeun William Umboh},\n  title     = {Online Weighted Cardinality Joint Replenishment Problem with Delay},\n  booktitle = {International Colloquium on Automata, Languages, and Programming\n               {(ICALP)}},\n  year      = {2022},\n  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2022.40},\n  timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},\n  biburl    = {https://dblp.org/rec/conf/icalp/ChenKU22.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cao-fineman-li-mestre-russell-umboh-briefannouncementnestedactivetimescheduling-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1145/3490148.3538554\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cao-fineman-li-mestre-russell-umboh-briefannouncementnestedactivetimescheduling-2022', 'https://doi.org/10.1145/3490148.3538554', event);\">\n    Brief Announcement: Nested Active-Time Scheduling.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Cao, N.; Fineman, J. T.; Li, S.; Mestre, J.; Russell, K.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,  2022. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1145/3490148.3538554\"\n     onclick=\"log_download('cao-fineman-li-mestre-russell-umboh-briefannouncementnestedactivetimescheduling-2022', 'https://doi.org/10.1145/3490148.3538554', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Brief Announcement: Nested Active-Time Scheduling [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cao-fineman-li-mestre-russell-umboh-briefannouncementnestedactivetimescheduling-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cao-fineman-li-mestre-russell-umboh-briefannouncementnestedactivetimescheduling-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/spaa/CaoFLMRU22,\n  author    = {Nairen Cao and\n               Jeremy T. Fineman and\n               Shi Li and\n               Juli{\\&#x27;{a}}n Mestre and\n               Katina Russell and\n               Seeun William Umboh},\n  title     = {Brief Announcement: Nested Active-Time Scheduling},\n  booktitle = {Symposium on Parallelism in Algorithms and\n               Architectures {(SPAA)}},\n  year      = {2022},\n  url       = {https://doi.org/10.1145/3490148.3538554},\n  timestamp = {Tue, 12 Jul 2022 14:22:25 +0200},\n  biburl    = {https://dblp.org/rec/conf/spaa/CaoFLMRU22.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"gudmundsson-mestre-umboh-boundeddegreelightapproximateshortestpathtreesindoublingmetrics-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1016/j.dam.2021.08.039\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'gudmundsson-mestre-umboh-boundeddegreelightapproximateshortestpathtreesindoublingmetrics-2021', 'https://doi.org/10.1016/j.dam.2021.08.039', event);\">\n    Bounded-degree light approximate shortest-path trees in doubling metrics.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gudmundsson, J.; Mestre, J.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Discret. Appl. Math.</i>, 305: 199–204.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1016/j.dam.2021.08.039\"\n     onclick=\"log_download('gudmundsson-mestre-umboh-boundeddegreelightapproximateshortestpathtreesindoublingmetrics-2021', 'https://doi.org/10.1016/j.dam.2021.08.039', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Bounded-degree light approximate shortest-path trees in doubling metrics [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gudmundsson-mestre-umboh-boundeddegreelightapproximateshortestpathtreesindoublingmetrics-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gudmundsson-mestre-umboh-boundeddegreelightapproximateshortestpathtreesindoublingmetrics-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/dam/GudmundssonMU21,\n  author    = {Joachim Gudmundsson and\n               Juli{\\&#x27;{a}}n Mestre and\n               Seeun William Umboh},\n  title     = {Bounded-degree light approximate shortest-path trees in doubling metrics},\n  journal   = {Discret. Appl. Math.},\n  volume    = {305},\n  pages     = {199--204},\n  year      = {2021},\n  url       = {https://doi.org/10.1016/j.dam.2021.08.039},\n  timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},\n  biburl    = {https://dblp.org/rec/journals/dam/GudmundssonMU21.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1145/3434425\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2021', 'https://doi.org/10.1145/3434425', event);\">\n    Timing Matters: Online Dynamics in Broadcast Games.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Chawla, S.; Naor, J.; Panigrahi, D.; Singh, M.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  <i>ACM Trans. Economics and Comput.</i>, 9(2): 11:1–11:22.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1145/3434425\"\n     onclick=\"log_download('chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2021', 'https://doi.org/10.1145/3434425', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Timing Matters: Online Dynamics in Broadcast Games [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/teco/ChawlaNPSU21,\n  author    = {Shuchi Chawla and\n               Joseph Naor and\n               Debmalya Panigrahi and\n               Mohit Singh and\n               Seeun William Umboh},\n  title     = {Timing Matters: Online Dynamics in Broadcast Games},\n  journal   = {{ACM} Trans. Economics and Comput.},\n  volume    = {9},\n  number    = {2},\n  pages     = {11:1--11:22},\n  year      = {2021},\n  url       = {https://doi.org/10.1145/3434425},\n  timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},\n  biburl    = {https://dblp.org/rec/journals/teco/ChawlaNPSU21.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mestre-pupyrev-umboh-ontheextendedtspproblem-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2021.42\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'mestre-pupyrev-umboh-ontheextendedtspproblem-2021', 'https://doi.org/10.4230/LIPIcs.ISAAC.2021.42', event);\">\n    On the Extended TSP Problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Mestre, J.; Pupyrev, S.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>International Symposium on Algorithms and Computation (ISAAC)</i>,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2021.42\"\n     onclick=\"log_download('mestre-pupyrev-umboh-ontheextendedtspproblem-2021', 'https://doi.org/10.4230/LIPIcs.ISAAC.2021.42', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"On the Extended TSP Problem [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mestre-pupyrev-umboh-ontheextendedtspproblem-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mestre-pupyrev-umboh-ontheextendedtspproblem-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/isaac/MestrePU21,\n  author    = {Juli{\\&#x27;{a}}n Mestre and\n               Sergey Pupyrev and\n               Seeun William Umboh},\n  title     = {On the Extended {TSP} Problem},\n  booktitle = {International Symposium on Algorithms and Computation {(ISAAC)}},\n  year      = {2021},\n  url       = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.42},\n  timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},\n  biburl    = {https://dblp.org/rec/conf/isaac/MestrePU21.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1007/s00453-019-00661-x\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2020', 'https://doi.org/10.1007/s00453-019-00661-x', event);\">\n    Nested Convex Bodies are Chaseable.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bansal, N.; Böhm, M.; Eliás, M.; Koumoutsos, G.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Algorithmica</i>, 82(6): 1640–1653.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1007/s00453-019-00661-x\"\n     onclick=\"log_download('bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2020', 'https://doi.org/10.1007/s00453-019-00661-x', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Nested Convex Bodies are Chaseable [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/algorithmica/BansalBEKU20,\n  author    = {Nikhil Bansal and\n               Martin B{\\&quot;{o}}hm and\n               Marek Eli{\\&#x27;{a}}s and\n               Grigorios Koumoutsos and\n               Seeun William Umboh},\n  title     = {Nested Convex Bodies are Chaseable},\n  journal   = {Algorithmica},\n  volume    = {82},\n  number    = {6},\n  pages     = {1640--1653},\n  year      = {2020},\n  url       = {https://doi.org/10.1007/s00453-019-00661-x},\n  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\n  biburl    = {https://dblp.org/rec/journals/algorithmica/BansalBEKU20.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"deberg-markovic-umboh-theonlinebroadcastrangeassignmentproblem-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2020.60\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'deberg-markovic-umboh-theonlinebroadcastrangeassignmentproblem-2020', 'https://doi.org/10.4230/LIPIcs.ISAAC.2020.60', event);\">\n    The Online Broadcast Range-Assignment Problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  de Berg, M.; Markovic, A.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>International Symposium on Algorithms and Computation (ISAAC)</i>,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2020.60\"\n     onclick=\"log_download('deberg-markovic-umboh-theonlinebroadcastrangeassignmentproblem-2020', 'https://doi.org/10.4230/LIPIcs.ISAAC.2020.60', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Online Broadcast Range-Assignment Problem [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/deberg-markovic-umboh-theonlinebroadcastrangeassignmentproblem-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('deberg-markovic-umboh-theonlinebroadcastrangeassignmentproblem-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/isaac/Berg0U20,\n  author    = {Mark de Berg and\n               Aleksandar Markovic and\n               Seeun William Umboh},\n  title     = {The Online Broadcast Range-Assignment Problem},\n  booktitle = {International Symposium on Algorithms and Computation {(ISAAC)}},\n  year      = {2020},\n  url       = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.60},\n  timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},\n  biburl    = {https://dblp.org/rec/conf/isaac/Berg0U20.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bartal-fandina-umboh-onlineprobabilisticmetricembeddingageneralframeworkforbypassinginherentbounds-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1137/1.9781611975994.95\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bartal-fandina-umboh-onlineprobabilisticmetricembeddingageneralframeworkforbypassinginherentbounds-2020', 'https://doi.org/10.1137/1.9781611975994.95', event);\">\n    Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bartal, Y.; Fandina, N.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1137/1.9781611975994.95\"\n     onclick=\"log_download('bartal-fandina-umboh-onlineprobabilisticmetricembeddingageneralframeworkforbypassinginherentbounds-2020', 'https://doi.org/10.1137/1.9781611975994.95', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bartal-fandina-umboh-onlineprobabilisticmetricembeddingageneralframeworkforbypassinginherentbounds-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bartal-fandina-umboh-onlineprobabilisticmetricembeddingageneralframeworkforbypassinginherentbounds-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/soda/BartalFU20,\n  author    = {Yair Bartal and\n               Nova Fandina and\n               Seeun William Umboh},\n  title     = {Online Probabilistic Metric Embedding: {A} General Framework for Bypassing\n               Inherent Bounds},\n  booktitle = {{ACM-SIAM} Symposium on Discrete Algorithms\n               {(SODA)}},\n  year      = {2020},\n  url       = {https://doi.org/10.1137/1.9781611975994.95},\n  timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},\n  biburl    = {https://dblp.org/rec/conf/soda/BartalFU20.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2019.88\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2019', 'https://doi.org/10.4230/LIPIcs.ICALP.2019.88', event);\">\n    Tight Bounds for Online Weighted Tree Augmentation.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Naor, J. (.; <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>;  and Williamson, D. P.\n</span>\n\n  \n\n</span>\n\n  In <i>International Colloquium on Automata, Languages, and Programming, (ICALP)</i>,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2019.88\"\n     onclick=\"log_download('naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2019', 'https://doi.org/10.4230/LIPIcs.ICALP.2019.88', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Tight Bounds for Online Weighted Tree Augmentation [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('naor-umboh-williamson-tightboundsforonlineweightedtreeaugmentation-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/icalp/NaorUW19,\n  author    = {Joseph (Seffi) Naor and\n               Seeun William Umboh and\n               David P. Williamson},\n  title     = {Tight Bounds for Online Weighted Tree Augmentation},\n  booktitle = {International Colloquium on Automata, Languages, and Programming,\n               {(ICALP)}},\n  year      = {2019},\n  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2019.88},\n  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},\n  biburl    = {https://dblp.org/rec/conf/icalp/NaorUW19.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"qian-umboh-williamson-onlineconstrainedforestandprizecollectingnetworkdesign-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1007/s00453-017-0391-4\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'qian-umboh-williamson-onlineconstrainedforestandprizecollectingnetworkdesign-2018', 'https://doi.org/10.1007/s00453-017-0391-4', event);\">\n    Online Constrained Forest and Prize-Collecting Network Design.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Qian, J.; <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>;  and Williamson, D. P.\n</span>\n\n  \n\n</span>\n\n  <i>Algorithmica</i>, 80(11): 3335–3364.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1007/s00453-017-0391-4\"\n     onclick=\"log_download('qian-umboh-williamson-onlineconstrainedforestandprizecollectingnetworkdesign-2018', 'https://doi.org/10.1007/s00453-017-0391-4', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Online Constrained Forest and Prize-Collecting Network Design [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/qian-umboh-williamson-onlineconstrainedforestandprizecollectingnetworkdesign-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('qian-umboh-williamson-onlineconstrainedforestandprizecollectingnetworkdesign-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/algorithmica/QianUW18,\n  author    = {Jiawei Qian and\n               Seeun William Umboh and\n               David P. Williamson},\n  title     = {Online Constrained Forest and Prize-Collecting Network Design},\n  journal   = {Algorithmica},\n  volume    = {80},\n  number    = {11},\n  pages     = {3335--3364},\n  year      = {2018},\n  url       = {https://doi.org/10.1007/s00453-017-0391-4},\n  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},\n  biburl    = {https://dblp.org/rec/journals/algorithmica/QianUW18.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1137/1.9781611975031.81\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2018', 'https://doi.org/10.1137/1.9781611975031.81', event);\">\n    Nested Convex Bodies are Chaseable.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bansal, N.; Böhm, M.; Eliás, M.; Koumoutsos, G.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1137/1.9781611975031.81\"\n     onclick=\"log_download('bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2018', 'https://doi.org/10.1137/1.9781611975031.81', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Nested Convex Bodies are Chaseable [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bansal-bhm-elis-koumoutsos-umboh-nestedconvexbodiesarechaseable-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/soda/BansalB0KU18,\n  author    = {Nikhil Bansal and\n               Martin B{\\&quot;{o}}hm and\n               Marek Eli{\\&#x27;{a}}s and\n               Grigorios Koumoutsos and\n               Seeun William Umboh},\n  title     = {Nested Convex Bodies are Chaseable},\n  booktitle = {{ACM-SIAM} Symposium on Discrete\n               Algorithms {(SODA)}},\n  year      = {2018},\n  url       = {https://doi.org/10.1137/1.9781611975031.81},\n  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\n  biburl    = {https://dblp.org/rec/conf/soda/BansalB0KU18.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1007/978-3-030-04612-5\\_6\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2018', 'https://doi.org/10.1007/978-3-030-04612-5\\_6', event);\">\n    Timing Matters: Online Dynamics in Broadcast Games.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Chawla, S.; Naor, J. (.; Panigrahi, D.; Singh, M.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>International Conference on Web and Internet Economics (WINE)</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1007/978-3-030-04612-5\\_6\"\n     onclick=\"log_download('chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2018', 'https://doi.org/10.1007/978-3-030-04612-5\\_6', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Timing Matters: Online Dynamics in Broadcast Games [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chawla-naor-panigrahi-singh-umboh-timingmattersonlinedynamicsinbroadcastgames-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/wine/0001NPSU18,\n  author    = {Shuchi Chawla and\n               Joseph (Seffi) Naor and\n               Debmalya Panigrahi and\n               Mohit Singh and\n               Seeun William Umboh},\n  title     = {Timing Matters: Online Dynamics in Broadcast Games},\n  booktitle = {International Conference on Web and Internet Economics {(WINE)}},\n  year      = {2018},\n  url       = {https://doi.org/10.1007/978-3-030-04612-5\\_6},\n  timestamp = {Tue, 14 May 2019 10:00:36 +0200},\n  biburl    = {https://dblp.org/rec/conf/wine/0001NPSU18.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bansal-umboh-tightapproximationboundsfordominatingsetongraphsofboundedarboricity-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1016/j.ipl.2017.01.011\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bansal-umboh-tightapproximationboundsfordominatingsetongraphsofboundedarboricity-2017', 'https://doi.org/10.1016/j.ipl.2017.01.011', event);\">\n    Tight approximation bounds for dominating set on graphs of bounded arboricity.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bansal, N.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Inf. Process. Lett.</i>, 122: 21–24.  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1016/j.ipl.2017.01.011\"\n     onclick=\"log_download('bansal-umboh-tightapproximationboundsfordominatingsetongraphsofboundedarboricity-2017', 'https://doi.org/10.1016/j.ipl.2017.01.011', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Tight approximation bounds for dominating set on graphs of bounded arboricity [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bansal-umboh-tightapproximationboundsfordominatingsetongraphsofboundedarboricity-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bansal-umboh-tightapproximationboundsfordominatingsetongraphsofboundedarboricity-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/ipl/BansalU17,\n  author    = {Nikhil Bansal and\n               Seeun William Umboh},\n  title     = {Tight approximation bounds for dominating set on graphs of bounded\n               arboricity},\n  journal   = {Inf. Process. Lett.},\n  volume    = {122},\n  pages     = {21--24},\n  year      = {2017},\n  url       = {https://doi.org/10.1016/j.ipl.2017.01.011},\n  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\n  biburl    = {https://dblp.org/rec/journals/ipl/BansalU17.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gupta-ravi-talwar-umboh-lastbutnotleastonlinespannersforbuyatbulk-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1137/1.9781611974782.38\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'gupta-ravi-talwar-umboh-lastbutnotleastonlinespannersforbuyatbulk-2017', 'https://doi.org/10.1137/1.9781611974782.38', event);\">\n    LAST but not Least: Online Spanners for Buy-at-Bulk.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gupta, A.; Ravi, R.; Talwar, K.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1137/1.9781611974782.38\"\n     onclick=\"log_download('gupta-ravi-talwar-umboh-lastbutnotleastonlinespannersforbuyatbulk-2017', 'https://doi.org/10.1137/1.9781611974782.38', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"LAST but not Least: Online Spanners for Buy-at-Bulk [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gupta-ravi-talwar-umboh-lastbutnotleastonlinespannersforbuyatbulk-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gupta-ravi-talwar-umboh-lastbutnotleastonlinespannersforbuyatbulk-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/soda/Gupta0TU17,\n  author    = {Anupam Gupta and\n               R. Ravi and\n               Kunal Talwar and\n               Seeun William Umboh},\n  title     = {{LAST} but not Least: Online Spanners for Buy-at-Bulk},\n  booktitle = {{ACM-SIAM} Symposium on Discrete\n               Algorithms {(SODA)}},\n  year      = {2017},\n  url       = {https://doi.org/10.1137/1.9781611974782.38},\n  timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},\n  biburl    = {https://dblp.org/rec/conf/soda/Gupta0TU17.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bansal-reichman-umboh-lpbasedrobustalgorithmsfornoisyminorfreeandboundedtreewidthgraphs-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1137/1.9781611974782.128\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bansal-reichman-umboh-lpbasedrobustalgorithmsfornoisyminorfreeandboundedtreewidthgraphs-2017', 'https://doi.org/10.1137/1.9781611974782.128', event);\">\n    LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bansal, N.; Reichman, D.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S. W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1137/1.9781611974782.128\"\n     onclick=\"log_download('bansal-reichman-umboh-lpbasedrobustalgorithmsfornoisyminorfreeandboundedtreewidthgraphs-2017', 'https://doi.org/10.1137/1.9781611974782.128', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bansal-reichman-umboh-lpbasedrobustalgorithmsfornoisyminorfreeandboundedtreewidthgraphs-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bansal-reichman-umboh-lpbasedrobustalgorithmsfornoisyminorfreeandboundedtreewidthgraphs-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/soda/Bansal0U17,\n  author    = {Nikhil Bansal and\n               Daniel Reichman and\n               Seeun William Umboh},\n  title     = {LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth\n               Graphs},\n  booktitle = {{ACM-SIAM} Symposium on Discrete\n               Algorithms {(SODA)}},\n  year      = {2017},\n  url       = {https://doi.org/10.1137/1.9781611974782.128},\n  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\n  biburl    = {https://dblp.org/rec/conf/soda/Bansal0U17.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"umboh-onlinenetworkdesignalgorithmsviahierarchicaldecompositions-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1137/1.9781611973730.91\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'umboh-onlinenetworkdesignalgorithmsviahierarchicaldecompositions-2015', 'https://doi.org/10.1137/1.9781611973730.91', event);\">\n    Online Network Design Algorithms via Hierarchical Decompositions.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>ACM-SIAM Symposium on Discrete Algorithms (SODA) 2015</i>,  2015. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1137/1.9781611973730.91\"\n     onclick=\"log_download('umboh-onlinenetworkdesignalgorithmsviahierarchicaldecompositions-2015', 'https://doi.org/10.1137/1.9781611973730.91', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Online Network Design Algorithms via Hierarchical Decompositions [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/umboh-onlinenetworkdesignalgorithmsviahierarchicaldecompositions-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('umboh-onlinenetworkdesignalgorithmsviahierarchicaldecompositions-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/soda/Umboh15,\n  author    = {Seeun Umboh},\n  title     = {Online Network Design Algorithms via Hierarchical Decompositions},\n  booktitle = {{ACM-SIAM} Symposium on Discrete\n               Algorithms {(SODA)} 2015},\n  year      = {2015},\n  url       = {https://doi.org/10.1137/1.9781611973730.91},\n  timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},\n  biburl    = {https://dblp.org/rec/conf/soda/Umboh15.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2014\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2014')\"\n      onkeypress=\"toggleGroup('group_2014')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2014</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"barman-chawla-umboh-networkdesignwithcoveragecosts-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.48\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'barman-chawla-umboh-networkdesignwithcoveragecosts-2014', 'https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.48', event);\">\n    Network Design with Coverage Costs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Barman, S.; Chawla, S.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.48\"\n     onclick=\"log_download('barman-chawla-umboh-networkdesignwithcoveragecosts-2014', 'https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.48', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Network Design with Coverage Costs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/barman-chawla-umboh-networkdesignwithcoveragecosts-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('barman-chawla-umboh-networkdesignwithcoveragecosts-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/approx/BarmanCU14,\n  author    = {Siddharth Barman and\n               Shuchi Chawla and\n               Seeun Umboh},\n  title     = {Network Design with Coverage Costs},\n  booktitle = {International Conference on Approximation Algorithms for Combinatorial Optimization Problems {(APPROX)}},\n  year      = {2014},\n  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.48},\n  timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},\n  biburl    = {https://dblp.org/rec/conf/approx/BarmanCU14.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2012\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2012')\"\n      onkeypress=\"toggleGroup('group_2012')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2012</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"barman-chawla-umboh-abicriteriaapproximationforthereorderingbufferproblem-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1007/978-3-642-33090-2\\_15\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'barman-chawla-umboh-abicriteriaapproximationforthereorderingbufferproblem-2012', 'https://doi.org/10.1007/978-3-642-33090-2\\_15', event);\">\n    A Bicriteria Approximation for the Reordering Buffer Problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Barman, S.; Chawla, S.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>European Symposium on Algorithms (ESA)</i>,  2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1007/978-3-642-33090-2\\_15\"\n     onclick=\"log_download('barman-chawla-umboh-abicriteriaapproximationforthereorderingbufferproblem-2012', 'https://doi.org/10.1007/978-3-642-33090-2\\_15', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Bicriteria Approximation for the Reordering Buffer Problem [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/barman-chawla-umboh-abicriteriaapproximationforthereorderingbufferproblem-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('barman-chawla-umboh-abicriteriaapproximationforthereorderingbufferproblem-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/esa/BarmanCU12,\n  author    = {Siddharth Barman and\n               Shuchi Chawla and\n               Seeun Umboh},\n  title     = {A Bicriteria Approximation for the Reordering Buffer Problem},\n  booktitle = {European Symposium on Algorithms {(ESA)}},\n  year      = {2012},\n  url       = {https://doi.org/10.1007/978-3-642-33090-2\\_15},\n  timestamp = {Tue, 14 May 2019 10:00:54 +0200},\n  biburl    = {https://dblp.org/rec/conf/esa/BarmanCU12.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"barman-umboh-chawla-malec-secretaryproblemswithconvexcosts-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1007/978-3-642-31594-7\\_7\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'barman-umboh-chawla-malec-secretaryproblemswithconvexcosts-2012', 'https://doi.org/10.1007/978-3-642-31594-7\\_7', event);\">\n    Secretary Problems with Convex Costs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Barman, S.; <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S.</a>; Chawla, S.;  and Malec, D. L.\n</span>\n\n  \n\n</span>\n\n  In <i>International Colloquium on Automata, Languages, and Programming (ICALP)</i>,  2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1007/978-3-642-31594-7\\_7\"\n     onclick=\"log_download('barman-umboh-chawla-malec-secretaryproblemswithconvexcosts-2012', 'https://doi.org/10.1007/978-3-642-31594-7\\_7', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Secretary Problems with Convex Costs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/barman-umboh-chawla-malec-secretaryproblemswithconvexcosts-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('barman-umboh-chawla-malec-secretaryproblemswithconvexcosts-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/icalp/BarmanUCM12,\n  author    = {Siddharth Barman and\n               Seeun Umboh and\n               Shuchi Chawla and\n               David L. Malec},\n  title     = {Secretary Problems with Convex Costs},\n  booktitle = {International Colloquium on Automata, Languages, and Programming {(ICALP)}},\n  year      = {2012},\n  url       = {https://doi.org/10.1007/978-3-642-31594-7\\_7},\n  timestamp = {Tue, 14 May 2019 10:00:44 +0200},\n  biburl    = {https://dblp.org/rec/conf/icalp/BarmanUCM12.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1142/S1793830910000929\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010', 'https://doi.org/10.1142/S1793830910000929', event);\">\n    Threshold Rules for Online Sample Selection.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bach, E.; Chawla, S.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Discret. Math. Algorithms Appl.</i>, 2(4): 625–642.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1142/S1793830910000929\"\n     onclick=\"log_download('bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010', 'https://doi.org/10.1142/S1793830910000929', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Threshold Rules for Online Sample Selection [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/dmaa/BachCU10,\n  author    = {Eric Bach and\n               Shuchi Chawla and\n               Seeun Umboh},\n  title     = {Threshold Rules for Online Sample Selection},\n  journal   = {Discret. Math. Algorithms Appl.},\n  volume    = 2,\n  number    = 4,\n  pages     = {625--642},\n  year      = 2010,\n  url       = {https://doi.org/10.1142/S1793830910000929},\n  timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},\n  biburl    = {https://dblp.org/rec/journals/dmaa/BachCU10.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1007/978-3-642-14031-0\\_52\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010', 'https://doi.org/10.1007/978-3-642-14031-0\\_52', event);\">\n    Threshold Rules for Online Sample Selection.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bach, E.; Chawla, S.;  and <a class=\"bibbase author link\" href=\"https://williamumboh.com/williamumboh.github.io-old/\">Umboh, S.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>International Conference on Computing and Combinatorics (COCOON)</i>,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1007/978-3-642-14031-0\\_52\"\n     onclick=\"log_download('bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010', 'https://doi.org/10.1007/978-3-642-14031-0\\_52', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Threshold Rules for Online Sample Selection [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bach-chawla-umboh-thresholdrulesforonlinesampleselection-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/cocoon/BachCU10,\n  author    = {Eric Bach and\n               Shuchi Chawla and\n               Seeun Umboh},\n  title     = {Threshold Rules for Online Sample Selection},\n  booktitle = {International Conference on Computing and Combinatorics {(COCOON)}},\n  year      = {2010},\n  url       = {https://doi.org/10.1007/978-3-642-14031-0\\_52},\n  timestamp = {Tue, 14 May 2019 10:00:35 +0200},\n  biburl    = {https://dblp.org/rec/conf/cocoon/BachCU10.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);