default search action
Ioannis Lamprou 0001
Person information
- affiliation: Huawei Paris Research Center, France
- affiliation: University of Liverpool, UK
- affiliation: National and Kapodistrian University of Athens, Zografou, Greece
Other persons with the same name
- Ioannis Lamprou 0002
— Technical University of Crete, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c8]Ioannis Lamprou, Zhen Zhang, Javier de Juan, Hang Yang, Yongqiang Lai, Etienne Filhol, Cédric Bastoul:
Safe Optimized Static Memory Allocation for Parallel Deep Learning. MLSys 2023 - 2022
- [c7]Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis
Fault-Tolerant Total Domination via Submodular Function Approximation. TAMC 2022: 281-292 - 2021
- [j6]Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos:
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination. Theor. Comput. Sci. 858: 1-12 (2021) - [j5]Ioannis Lamprou, Russell Martin, Sven Schewe
Maximum rooted connected expansion. Theor. Comput. Sci. 873: 25-37 (2021) - 2020
- [j4]Ioannis Lamprou, Russell Martin, Sven Schewe
Fast two-robot disk evacuation with wireless communication. Theor. Comput. Sci. 846: 38-60 (2020) - [c6]Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos:
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination. IWOCA 2020: 368-381 - [c5]Stefan Balev, Juan Luis Jiménez Laredo, Ioannis Lamprou, Yoann Pigné, Eric Sanlaville:
Cops and Robbers on Dynamic Graphs: Offline and Online Case. SIROCCO 2020: 203-219
2010 – 2019
- 2019
- [j3]Ioannis Lamprou
Eternally dominating large grids. Theor. Comput. Sci. 794: 27-46 (2019) - [i5]Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos:
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination. CoRR abs/1907.06576 (2019) - 2018
- [j2]Ioannis Lamprou
Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Algorithms 11(10): 149 (2018) - [c4]Ioannis Lamprou, Russell Martin, Sven Schewe
Maximum Rooted Connected Expansion. MFCS 2018: 25:1-25:14 - [i4]Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos:
Maximum Rooted Connected Expansion. CoRR abs/1806.09549 (2018) - 2017
- [c3]Ioannis Lamprou
Perpetually Dominating Large Grids. CIAC 2017: 393-404 - [c2]Ioannis Lamprou
Cover Time in Edge-Uniform Stochastically-Evolving Graphs. SSS 2017: 441-455 - [i3]Ioannis Lamprou, Russell Martin, Paul G. Spirakis:
Bounding the Cover Time in Edge-Uniform Stochastic Graphs. CoRR abs/1702.05412 (2017) - 2016
- [c1]Ioannis Lamprou
Fast Two-Robot Disk Evacuation with Wireless Communication. DISC 2016: 1-15 - [i2]Ioannis Lamprou, Russell Martin, Sven Schewe:
Fast Two-Robot Disk Evacuation with Wireless Communication. CoRR abs/1604.04217 (2016) - [i1]Ioannis Lamprou, Russell Martin, Sven Schewe:
Perpetually Dominating Large Grids. CoRR abs/1611.08204 (2016) - 2015
- [j1]Frédéric Giroire, Ioannis Lamprou
Connected surveillance game. Theor. Comput. Sci. 584: 131-143 (2015)
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-07-01 20:40 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: