activity
20142026
most citedDistributed Methods for Computing Approximate Equilibria

21 citations · 65 across the 25 of their papers we have counts for

collaborators
Showing cs.DSShow all

7 papers · 1 filter

cs.DS2022

The Parameterized Complexity of Welfare Guarantees in Schelling Segregation

Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith

Schelling's model considers types of agents each of whom needs to select a vertex on an undirected graph, where every agent prefers to neighbor agents of the same type. We are…

cs.DS2021

Minimizing Reachability Times on Temporal Graphs via Shifting Labels

Argyrios Deligkas, Eduard Eiben, George Skretas

We study how we can accelerate the spreading of information in temporal graphs via shifting operations; a problem that captures real-world applications varying from information flo…

cs.DS2020

The K-Centre Problem for Necklaces

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev +1

In graph theory, the objective of the k-centre problem is to find a set of vertices for which the largest distance of any vertex to its closest vertex in the -set is minimis…

cs.DS2020★ 1 cited

Matching in Stochastically Evolving Graphs

Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios +2

This paper studies the maximum cardinality matching problem in stochastically evolving graphs. We formally define the arrival-departure model with stochastic departures. There, a g…

cs.DS2020

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis +1

In this paper we consider the following total functional problem: Given a cubic Hamiltonian graph and a Hamiltonian cycle of , how can we compute a second Hamiltonian…

cs.DS2020

Optimizing Reachability Sets in Temporal Graphs by Delaying

Argyrios Deligkas, Igor Potapov

A temporal graph is a dynamic graph where every edge is assigned a set of integer time labels that indicate at which discrete time step the edge is available. In this paper, we stu…

cs.DS2017

Binary Search in Graphs Revisited

Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis

In the classical binary search in a path the aim is to detect an unknown target by asking as few queries as possible, where each query reveals the direction to the target. This bin…