Skip to main content

and
  1. Article

    Open Access

    Connected Subgraph Defense Games

    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 chooses, probabilistically as well, a co...

    Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos in Algorithmica (2021)

  2. No Access

    Chapter and Conference Paper

    On Temporally Connected Graphs of Small Cost

    We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of n vertices, where each edge has an associated set of discrete availability instanc...

    Eleni C. Akrida, Leszek Gąsieniec in Approximation and Online Algorithms (2015)