Elements of the theory of dynamic networks
O Michail, PG Spirakis - Communications of the ACM, 2018 - dl.acm.org
Elements of the theory of dynamic networks Page 1 72 COMMUNICATIONS OF THE ACM |
FEBRUARY 2018 | VOL. 61 | NO. 2 review articles IMA GE B Y ANITHA DEVI MUR THI A …
FEBRUARY 2018 | VOL. 61 | NO. 2 review articles IMA GE B Y ANITHA DEVI MUR THI A …
An introduction to temporal graphs: An algorithmic perspective
O Michail - Internet Mathematics, 2016 - Taylor & Francis
A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …
discrete and only the relationships between the participating entities may change and not …
[HTML][HTML] Traveling salesman problems in temporal graphs
O Michail, PG Spirakis - Theoretical Computer Science, 2016 - Elsevier
In this work, we introduce the notion of time to some well-known combinatorial optimization
problems. In particular, we study problems defined on temporal graphs. A temporal graph …
problems. In particular, we study problems defined on temporal graphs. A temporal graph …
Universal shape formation for programmable matter
We envision programmable matter consisting of systems of computationally limited devices
(which we call particles) that are able to self-organize in order to achieve a desired collective …
(which we call particles) that are able to self-organize in order to achieve a desired collective …
The canonical amoebot model: Algorithms and concurrency control
The amoebot model abstracts active programmable matter as a collection of simple
computational elements called amoebots that interact locally to collectively achieve tasks of …
computational elements called amoebots that interact locally to collectively achieve tasks of …
Fast space optimal leader election in population protocols
L Gasieniec, G Stachowiak - arXiv preprint arXiv:1704.07649, 2017 - arxiv.org
The model of population protocols refers to the growing in popularity theoretical framework
suitable for studying pairwise interactions within a large collection of simple …
suitable for studying pairwise interactions within a large collection of simple …
An introduction to temporal graphs: An algorithmic perspective
O Michail - … , Probability, Networks, and Games: Scientific Papers …, 2015 - Springer
A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …
discrete and only the relationships between the participating entities may change and not …
Universal coating for programmable matter
The idea behind universal coating is to have a thin layer of a specific substance covering an
object of any shape so that one can measure a certain condition (like temperature or cracks) …
object of any shape so that one can measure a certain condition (like temperature or cracks) …
[HTML][HTML] On the transformation capability of feasible mechanisms for programmable matter
We study theoretical models of programmable matter systems, consisting of n spherical
modules kept together by magnetic or electrostatic forces and able to perform two minimal …
modules kept together by magnetic or electrostatic forces and able to perform two minimal …
Forming tile shapes with simple robots
Motivated by the problem of manipulating nanoscale materials, we investigate the problem
of reconfiguring a set of tiles into certain shapes by robots with limited computational …
of reconfiguring a set of tiles into certain shapes by robots with limited computational …