◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Eleni C. Akrida

7 papers hereh-index 9317 citations19 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author6
  • last author1

Across the 7 of 7 papers where every author was matched, so the position is known.

fields
  • cs.CC3
  • cs.DS3
  • cs.GT1

identity via Semantic Scholar / OpenAlex

activity
20162026
most citedMatching in Stochastically Evolving Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing 2019Show all

2 papers · 1 filter

cs.GT2019

Connected Subgraph Defense Games

Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos +1

We study a security game over a network played between a defender and k attackers. Every attacker chooses, probabilistically, a node of the network to damage. The defender ch…

cs.CC2019

How fast can we reach a target vertex in stochastic temporal graphs?

Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas +3

Temporal graphs are used to abstractly model real-life networks that are inherently dynamic in nature. Given a static underlying graph G=(V,E), a temporal graph on G is a seque…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.