BibTeX records: Grigorios Koumoutsos

download as .bib file

@article{DBLP:journals/talg/BansalEKN23,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos and
                  Jesper Nederlof},
  title        = {Competitive Algorithms for Generalized \emph{k}-Server in Uniform
                  Metrics},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {19},
  number       = {1},
  pages        = {8:1--8:15},
  year         = {2023},
  url          = {https://doi.org/10.1145/3568677},
  doi          = {10.1145/3568677},
  timestamp    = {Sat, 29 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/BansalEKN23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/BoseCIKL23,
  author       = {Prosenjit Bose and
                  Jean Cardinal and
                  John Iacono and
                  Grigorios Koumoutsos and
                  Stefan Langerman},
  title        = {Competitive Online Search Trees on Trees},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {19},
  number       = {3},
  pages        = {25:1--25:19},
  year         = {2023},
  url          = {https://doi.org/10.1145/3595180},
  doi          = {10.1145/3595180},
  timestamp    = {Fri, 18 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/BoseCIKL23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/DemaineIKL21,
  author       = {Erik D. Demaine and
                  John Iacono and
                  Grigorios Koumoutsos and
                  Stefan Langerman},
  title        = {Belga B-Trees},
  journal      = {Theory Comput. Syst.},
  volume       = {65},
  number       = {3},
  pages        = {541--558},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00224-020-09991-8},
  doi          = {10.1007/S00224-020-09991-8},
  timestamp    = {Fri, 28 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/DemaineIKL21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/CardinalIK21,
  author       = {Jean Cardinal and
                  John Iacono and
                  Grigorios Koumoutsos},
  editor       = {Petra Mutzel and
                  Rasmus Pagh and
                  Grzegorz Herman},
  title        = {Worst-Case Efficient Dynamic Geometric Independent Set},
  booktitle    = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
                  6-8, 2021, Lisbon, Portugal (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {204},
  pages        = {25:1--25:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2021.25},
  doi          = {10.4230/LIPICS.ESA.2021.25},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/CardinalIK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2108-08050,
  author       = {Jean Cardinal and
                  John Iacono and
                  Grigorios Koumoutsos},
  title        = {Worst-Case Efficient Dynamic Geometric Independent Set},
  journal      = {CoRR},
  volume       = {abs/2108.08050},
  year         = {2021},
  url          = {https://arxiv.org/abs/2108.08050},
  eprinttype    = {arXiv},
  eprint       = {2108.08050},
  timestamp    = {Mon, 23 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2108-08050.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BansalBEKU20,
  author       = {Nikhil Bansal and
                  Martin B{\"{o}}hm and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos and
                  Seeun William Umboh},
  title        = {Nested Convex Bodies are Chaseable},
  journal      = {Algorithmica},
  volume       = {82},
  number       = {6},
  pages        = {1640--1653},
  year         = {2020},
  url          = {https://doi.org/10.1007/s00453-019-00661-x},
  doi          = {10.1007/S00453-019-00661-X},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BansalBEKU20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jip/ArsenevaIKLZ20,
  author       = {Elena Arseneva and
                  John Iacono and
                  Grigorios Koumoutsos and
                  Stefan Langerman and
                  Boris Zolotov},
  title        = {Sublinear Explicit Incremental Planar Voronoi Diagrams},
  journal      = {J. Inf. Process.},
  volume       = {28},
  pages        = {766--774},
  year         = {2020},
  url          = {https://doi.org/10.2197/ipsjjip.28.766},
  doi          = {10.2197/IPSJJIP.28.766},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jip/ArsenevaIKLZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/FotakisKKSV20,
  author       = {Dimitris Fotakis and
                  Loukas Kavouras and
                  Grigorios Koumoutsos and
                  Stratis Skoulakis and
                  Manolis Vardas},
  editor       = {Artur Czumaj and
                  Anuj Dawar and
                  Emanuela Merelli},
  title        = {The Online Min-Sum Set Cover Problem},
  booktitle    = {47th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
                  Conference)},
  series       = {LIPIcs},
  volume       = {168},
  pages        = {51:1--51:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2020.51},
  doi          = {10.4230/LIPICS.ICALP.2020.51},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/FotakisKKSV20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BoseCIKL20,
  author       = {Prosenjit Bose and
                  Jean Cardinal and
                  John Iacono and
                  Grigorios Koumoutsos and
                  Stefan Langerman},
  editor       = {Shuchi Chawla},
  title        = {Competitive Online Search Trees on Trees},
  booktitle    = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages        = {1878--1891},
  publisher    = {{SIAM}},
  year         = {2020},
  url          = {https://doi.org/10.1137/1.9781611975994.115},
  doi          = {10.1137/1.9781611975994.115},
  timestamp    = {Thu, 15 Jul 2021 13:48:53 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BoseCIKL20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/waoa/ChristouFK20,
  author       = {Dimitris Christou and
                  Dimitris Fotakis and
                  Grigorios Koumoutsos},
  editor       = {Christos Kaklamanis and
                  Asaf Levin},
  title        = {Memoryless Algorithms for the Generalized k-server Problem on Uniform
                  Metrics},
  booktitle    = {Approximation and Online Algorithms - 18th International Workshop,
                  {WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {12806},
  pages        = {143--158},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-80879-2\_10},
  doi          = {10.1007/978-3-030-80879-2\_10},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/waoa/ChristouFK20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2003-02161,
  author       = {Dimitris Fotakis and
                  Loukas Kavouras and
                  Grigorios Koumoutsos and
                  Stratis Skoulakis and
                  Manolis Vardas},
  title        = {The Online Min-Sum Set Cover Problem},
  journal      = {CoRR},
  volume       = {abs/2003.02161},
  year         = {2020},
  url          = {https://arxiv.org/abs/2003.02161},
  eprinttype    = {arXiv},
  eprint       = {2003.02161},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2003-02161.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2007-01686,
  author       = {Elena Arseneva and
                  John Iacono and
                  Grigorios Koumoutsos and
                  Stefan Langerman and
                  Boris Zolotov},
  title        = {Sublinear Explicit Incremental Planar Voronoi Diagrams},
  journal      = {CoRR},
  volume       = {abs/2007.01686},
  year         = {2020},
  url          = {https://arxiv.org/abs/2007.01686},
  eprinttype    = {arXiv},
  eprint       = {2007.01686},
  timestamp    = {Mon, 06 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2007-01686.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2007-08643,
  author       = {Sujoy Bhore and
                  Jean Cardinal and
                  John Iacono and
                  Grigorios Koumoutsos},
  title        = {Dynamic Geometric Independent Set},
  journal      = {CoRR},
  volume       = {abs/2007.08643},
  year         = {2020},
  url          = {https://arxiv.org/abs/2007.08643},
  eprinttype    = {arXiv},
  eprint       = {2007.08643},
  timestamp    = {Tue, 28 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2007-08643.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2007-08669,
  author       = {Dimitris Christou and
                  Dimitris Fotakis and
                  Grigorios Koumoutsos},
  title        = {Memoryless Algorithms for the Generalized k-server Problem on Uniform
                  Metrics},
  journal      = {CoRR},
  volume       = {abs/2007.08669},
  year         = {2020},
  url          = {https://arxiv.org/abs/2007.08669},
  eprinttype    = {arXiv},
  eprint       = {2007.08669},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2007-08669.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/BansalEJK19,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Lukasz Jez and
                  Grigorios Koumoutsos},
  title        = {The (\emph{h, k})-Server Problem on Bounded Depth Trees},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {15},
  number       = {2},
  pages        = {28:1--28:26},
  year         = {2019},
  url          = {https://doi.org/10.1145/3301314},
  doi          = {10.1145/3301314},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/BansalEJK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csr/DemaineIKL19,
  author       = {Erik D. Demaine and
                  John Iacono and
                  Grigorios Koumoutsos and
                  Stefan Langerman},
  editor       = {Ren{\'{e}} van Bevern and
                  Gregory Kucherov},
  title        = {Belga B-Trees},
  booktitle    = {Computer Science - Theory and Applications - 14th International Computer
                  Science Symposium in Russia, {CSR} 2019, Novosibirsk, Russia, July
                  1-5, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11532},
  pages        = {93--105},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-19955-5\_9},
  doi          = {10.1007/978-3-030-19955-5\_9},
  timestamp    = {Tue, 25 Jun 2019 14:30:35 +0200},
  biburl       = {https://dblp.org/rec/conf/csr/DemaineIKL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/IaconoKK19,
  author       = {John Iacono and
                  Ben Karsin and
                  Grigorios Koumoutsos},
  editor       = {Pinyan Lu and
                  Guochuan Zhang},
  title        = {External Memory Planar Point Location with Fast Updates},
  booktitle    = {30th International Symposium on Algorithms and Computation, {ISAAC}
                  2019, December 8-11, 2019, Shanghai University of Finance and Economics,
                  Shanghai, China},
  series       = {LIPIcs},
  volume       = {149},
  pages        = {58:1--58:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.58},
  doi          = {10.4230/LIPICS.ISAAC.2019.58},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/IaconoKK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1903-03560,
  author       = {Erik D. Demaine and
                  John Iacono and
                  Grigorios Koumoutsos and
                  Stefan Langerman},
  title        = {Belga B-trees},
  journal      = {CoRR},
  volume       = {abs/1903.03560},
  year         = {2019},
  url          = {http://arxiv.org/abs/1903.03560},
  eprinttype    = {arXiv},
  eprint       = {1903.03560},
  timestamp    = {Sun, 31 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1903-03560.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1905-02620,
  author       = {John Iacono and
                  Ben Karsin and
                  Grigorios Koumoutsos},
  title        = {External Memory Planar Point Location with Fast Updates},
  journal      = {CoRR},
  volume       = {abs/1905.02620},
  year         = {2019},
  url          = {http://arxiv.org/abs/1905.02620},
  eprinttype    = {arXiv},
  eprint       = {1905.02620},
  timestamp    = {Mon, 27 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1905-02620.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1908-00848,
  author       = {Prosenjit Bose and
                  Jean Cardinal and
                  John Iacono and
                  Grigorios Koumoutsos and
                  Stefan Langerman},
  title        = {Competitive Online Search Trees on Trees},
  journal      = {CoRR},
  volume       = {abs/1908.00848},
  year         = {2019},
  url          = {http://arxiv.org/abs/1908.00848},
  eprinttype    = {arXiv},
  eprint       = {1908.00848},
  timestamp    = {Fri, 09 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1908-00848.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/BansalEJKP18,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Lukasz Jez and
                  Grigorios Koumoutsos and
                  Kirk Pruhs},
  title        = {Tight Bounds for Double Coverage Against Weak Adversaries},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {349--365},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9703-3},
  doi          = {10.1007/S00224-016-9703-3},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BansalEJKP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/Bansal0KN18,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos and
                  Jesper Nederlof},
  editor       = {Artur Czumaj},
  title        = {Competitive Algorithms for Generalized \emph{k}-Server in Uniform
                  Metrics},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages        = {992--1001},
  publisher    = {{SIAM}},
  year         = {2018},
  url          = {https://doi.org/10.1137/1.9781611975031.64},
  doi          = {10.1137/1.9781611975031.64},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/Bansal0KN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BansalB0KU18,
  author       = {Nikhil Bansal and
                  Martin B{\"{o}}hm and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos and
                  Seeun William Umboh},
  editor       = {Artur Czumaj},
  title        = {Nested Convex Bodies are Chaseable},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages        = {1253--1260},
  publisher    = {{SIAM}},
  year         = {2018},
  url          = {https://doi.org/10.1137/1.9781611975031.81},
  doi          = {10.1137/1.9781611975031.81},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BansalB0KU18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BansalEK17,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos},
  editor       = {Chris Umans},
  title        = {Weighted k-Server Bounds via Combinatorial Dichotomies},
  booktitle    = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2017, Berkeley, CA, USA, October 15-17, 2017},
  pages        = {493--504},
  publisher    = {{IEEE} Computer Society},
  year         = {2017},
  url          = {https://doi.org/10.1109/FOCS.2017.52},
  doi          = {10.1109/FOCS.2017.52},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/BansalEK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BansalEJK17,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Lukasz Jez and
                  Grigorios Koumoutsos},
  editor       = {Philip N. Klein},
  title        = {The (\emph{h}, \emph{k})-Server Problem on Bounded Depth Trees},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {1022--1037},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.65},
  doi          = {10.1137/1.9781611974782.65},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BansalEJK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BansalEK17,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos},
  title        = {Weighted k-Server Bounds via Combinatorial Dichotomies},
  journal      = {CoRR},
  volume       = {abs/1704.03318},
  year         = {2017},
  url          = {http://arxiv.org/abs/1704.03318},
  eprinttype    = {arXiv},
  eprint       = {1704.03318},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/BansalEK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BansalEKN17,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos and
                  Jesper Nederlof},
  title        = {Competitive Algorithms for Generalized k-Server in Uniform Metrics},
  journal      = {CoRR},
  volume       = {abs/1707.04519},
  year         = {2017},
  url          = {http://arxiv.org/abs/1707.04519},
  eprinttype    = {arXiv},
  eprint       = {1707.04519},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/BansalEKN17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BansalBEKU17,
  author       = {Nikhil Bansal and
                  Martin B{\"{o}}hm and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos and
                  Seeun William Umboh},
  title        = {Nested Convex Bodies are Chaseable},
  journal      = {CoRR},
  volume       = {abs/1707.05527},
  year         = {2017},
  url          = {http://arxiv.org/abs/1707.05527},
  eprinttype    = {arXiv},
  eprint       = {1707.05527},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/BansalBEKU17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BansalEJK16,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Lukasz Jez and
                  Grigorios Koumoutsos},
  title        = {New Bounds for the {\textdollar}(h, k){\textdollar}-Server Problem},
  journal      = {CoRR},
  volume       = {abs/1608.08527},
  year         = {2016},
  url          = {http://arxiv.org/abs/1608.08527},
  eprinttype    = {arXiv},
  eprint       = {1608.08527},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/BansalEJK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/waoa/BansalEJKP15,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Lukasz Jez and
                  Grigorios Koumoutsos and
                  Kirk Pruhs},
  editor       = {Laura Sanit{\`{a}} and
                  Martin Skutella},
  title        = {Tight Bounds for Double Coverage Against Weak Adversaries},
  booktitle    = {Approximation and Online Algorithms - 13th International Workshop,
                  {WAOA} 2015, Patras, Greece, September 17-18, 2015. Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9499},
  pages        = {47--58},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-28684-6\_5},
  doi          = {10.1007/978-3-319-28684-6\_5},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/BansalEJKP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.