default search action
Grigorios Koumoutsos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Nikhil Bansal
, Marek Eliás
Competitive Algorithms for Generalized k-Server in Uniform Metrics. ACM Trans. Algorithms 19(1): 8:1-8:15 (2023) - [j6]Prosenjit Bose
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19(3): 25:1-25:19 (2023) - 2021
- [j5]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. Theory Comput. Syst. 65(3): 541-558 (2021) - [c11]Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Worst-Case Efficient Dynamic Geometric Independent Set. ESA 2021: 25:1-25:15 - [i12]Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Worst-Case Efficient Dynamic Geometric Independent Set. CoRR abs/2108.08050 (2021) - 2020
- [j4]Nikhil Bansal, Martin Böhm, Marek Eliás
Nested Convex Bodies are Chaseable. Algorithmica 82(6): 1640-1653 (2020) - [j3]Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov:
Sublinear Explicit Incremental Planar Voronoi Diagrams. J. Inf. Process. 28: 766-774 (2020) - [c10]Dimitris Fotakis
The Online Min-Sum Set Cover Problem. ICALP 2020: 51:1-51:16 - [c9]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. SODA 2020: 1878-1891 - [c8]Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos:
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. WAOA 2020: 143-158 - [i11]Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas:
The Online Min-Sum Set Cover Problem. CoRR abs/2003.02161 (2020) - [i10]Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov:
Sublinear Explicit Incremental Planar Voronoi Diagrams. CoRR abs/2007.01686 (2020) - [i9]Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Dynamic Geometric Independent Set. CoRR abs/2007.08643 (2020) - [i8]Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos:
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. CoRR abs/2007.08669 (2020)
2010 – 2019
- 2019
- [j2]Nikhil Bansal, Marek Eliás
The (h, k)-Server Problem on Bounded Depth Trees. ACM Trans. Algorithms 15(2): 28:1-28:26 (2019) - [c7]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. CSR 2019: 93-105 - [c6]John Iacono, Ben Karsin, Grigorios Koumoutsos:
External Memory Planar Point Location with Fast Updates. ISAAC 2019: 58:1-58:18 - [i7]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-trees. CoRR abs/1903.03560 (2019) - [i6]John Iacono, Ben Karsin, Grigorios Koumoutsos:
External Memory Planar Point Location with Fast Updates. CoRR abs/1905.02620 (2019) - [i5]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. CoRR abs/1908.00848 (2019) - 2018
- [j1]Nikhil Bansal, Marek Eliás
Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62(2): 349-365 (2018) - [c5]Nikhil Bansal, Marek Eliás
Competitive Algorithms for Generalized k-Server in Uniform Metrics. SODA 2018: 992-1001 - [c4]Nikhil Bansal, Martin Böhm, Marek Eliás
Nested Convex Bodies are Chaseable. SODA 2018: 1253-1260 - 2017
- [c3]Nikhil Bansal, Marek Eliás
Weighted k-Server Bounds via Combinatorial Dichotomies. FOCS 2017: 493-504 - [c2]Nikhil Bansal, Marek Eliás
The (h, k)-Server Problem on Bounded Depth Trees. SODA 2017: 1022-1037 - [i4]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos:
Weighted k-Server Bounds via Combinatorial Dichotomies. CoRR abs/1704.03318 (2017) - [i3]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. CoRR abs/1707.04519 (2017) - [i2]Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. CoRR abs/1707.05527 (2017) - 2016
- [i1]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
New Bounds for the $(h, k)$-Server Problem. CoRR abs/1608.08527 (2016) - 2015
- [c1]Nikhil Bansal, Marek Eliás
Tight Bounds for Double Coverage Against Weak Adversaries. WAOA 2015: 47-58
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: