Themistoklis Melissourgos

activity

20172026

most citedComputing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

5 citations · 12 across the 11 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 $d e f e n d er$ and $k$ $a tt a c k er s$ . Every attacker chooses, probabilistically, a node of the network to damage. The defender ch…

cs.CC2019★ 5 cited

Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos +1

We study the problem of finding an exact solution to the consensus halving problem. While recent work has shown that the approximate version of this problem is PPA-complete, we sho…