default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEleni C. Akrida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j8]Eleni C. Akrida
, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. Algorithmica 83(11): 3403-3431 (2021)- [j7]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Christoforos L. Raptopoulos:
The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120: 179-193 (2021) - 2020
- [j6]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107: 108-123 (2020) - [j5]Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
How fast can we reach a target vertex in stochastic temporal graphs? J. Comput. Syst. Sci. 114: 65-83 (2020) - 2019
- [j4]Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis:
Temporal flows in temporal networks. J. Comput. Syst. Sci. 103: 46-60 (2019) - [j3]Eleni C. Akrida, Paul G. Spirakis:
On Verifying and Maintaining Connectivity of Interval Temporal Networks. Parallel Process. Lett. 29(2): 1950009:1-1950009:16 (2019) - 2017
- [j2]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
The Complexity of Optimal Design of Temporally Connected Graphs. Theory Comput. Syst. 61(3): 907-944 (2017) - 2016
- [j1]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Ephemeral networks with random availability of links: The case of fast networks. J. Parallel Distributed Comput. 87: 109-120 (2016)
Conference and Workshop Papers
- 2024
- [c13]Marjahan Begum, Julia Crossley, Filip Strömbäck, Eleni C. Akrida, Isaac Alpizar Chacon, Abigail Evans, Joshua B. Gross, Pontus Haglund, Violetta Lonati, Chandrika Satyavolu, Sverrir Thorgeirsson:
Designing a Pedagogical Framework for Developing Abstraction Skills. ITiCSE (2) 2024 - [c12]Arwa Al Saqaabi, Craig D. Stewart, Eleni C. Akrida, Alexandra I. Cristea:
Paraphrase Generation and Identification at Paragraph-Level. ITS (2) 2024: 278-291 - 2022
- [c11]Steven Bradley, Eleni C. Akrida:
Narrowing and Stretching: Addressing the Challenge of Multi-track Programming. CEP 2022: 1-4 - [c10]Arwa Al Saqaabi, Craig D. Stewart, Eleni C. Akrida, Alexandra I. Cristea:
A Paraphrase Identification Approach in Paragraph length texts. EDM 2022 - [c9]Arwa Al Saqaabi, Eleni C. Akrida, Alexandra I. Cristea, Craig D. Stewart:
A Paraphrase Identification Approach in Paragraph Length Texts. ICDM (Workshops) 2022: 358-367 - 2019
- [c8]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis:
The Temporal Explorer Who Returns to the Base. CIAC 2019: 13-24 - [c7]Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP 2019: 131:1-131:14 - [c6]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. SAGT 2019: 216-236 - 2018
- [c5]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal Vertex Cover with a Sliding Time Window. ICALP 2018: 148:1-148:14 - 2017
- [c4]Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis:
Temporal Flows in Temporal Networks. CIAC 2017: 43-54 - 2015
- [c3]Eleni C. Akrida, Paul G. Spirakis:
On Verifying and Maintaining Connectivity of Interval Temporal Networks. ALGOSENSORS 2015: 142-154 - [c2]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
On Temporally Connected Graphs of Small Cost. WAOA 2015: 84-96 - 2014
- [c1]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Ephemeral networks with random availability of links: diameter and connectivity. SPAA 2014: 267-276
Editorship
- 2023
- [e1]Eleni C. Akrida, Mark Zarb:
Computing Education Practice, CEP 2023, Durham, United Kingdom, 6 January 2023. ACM 2023, ISBN 978-1-4503-9821-3 [contents]
Informal and Other Publications
- 2020
- [i8]Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Matching in Stochastically Evolving Graphs. CoRR abs/2005.08263 (2020) - 2019
- [i7]Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
How fast can we reach a target vertex in stochastic temporal graphs? CoRR abs/1903.03636 (2019) - [i6]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. CoRR abs/1906.02774 (2019) - 2018
- [i5]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal Vertex Cover with a Sliding Time Window. CoRR abs/1802.07103 (2018) - [i4]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis:
The temporal explorer who returns to the base. CoRR abs/1805.04713 (2018) - 2016
- [i3]Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis:
Flows in Temporal networks. CoRR abs/1606.01091 (2016) - 2015
- [i2]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Designing and Testing Temporally Connected Graphs. CoRR abs/1502.04579 (2015) - 2013
- [i1]Paul G. Spirakis, Eleni Ch. Akrida:
Moving in temporal graphs with very sparse random availability of edges. CoRR abs/1310.7898 (2013)
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-20 21:22 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:
