5 citations · 5 across the 5 of their papers we have counts for
6 papers
The Complexity of Growing a Graph
George B. Mertzios, Othon Michail, George Skretas +2
We study a new algorithmic process of graph growth which starts from a single initial vertex and operates in discrete time-steps, called \emph{slots}. In every slot, the graph grow…
Gathering in 1-Interval Connected Graphs
Othon Michail, Paul G. Spirakis, Michail Theofilatos
We examine the problem of gathering agents (or multi-agent rendezvous) in dynamic graphs which may change in every synchronous round but remain always connected (-int…
Crystal Structure Prediction via Oblivious Local Search
Dmytro Antypov, Argyrios Deligkas, Vladimir Gusev +3
We study Crystal Structure Prediction, one of the major problems in computational chemistry. This is essentially a continuous optimization problem, where many different, simple and…
Fault Tolerant Network Constructors
Othon Michail, Paul G. Spirakis, Michail Theofilatos
In this work, we consider adversarial crash faults of nodes in the network constructors model Michail and Spirakis, 2016. We first show that, without further assumptions, the…
Fast Approximate Counting and Leader Election in Populations
Othon Michail, Paul G. Spirakis, Michail Theofilatos
We study the problems of leader election and population size counting for population protocols: networks of finite-state anonymous agents that interact randomly under a uniform ran…
Exact size counting in uniform population protocols in nearly logarithmic time
David Doty, Mahsa Eftekhari, Othon Michail +2
We study population protocols: networks of anonymous agents that interact under a scheduler that picks pairs of agents uniformly at random. The _size counting problem_ is that of c…