Up a level |
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2019)
How fast can we reach a target vertex in stochastic temporal graphs?
Leibniz International Proceedings in Informatics, LIPIcs, 132.
131:1-131:1.
Akrida, Eleni C, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020)
How fast can we reach a target vertex in stochastic temporal graphs?
Journal of Computer and System Sciences, 114.
pp. 65-83.
Nikoletseas, Sotiris, Raptopoulos, Christoforos ORCID: 0000-0002-9837-2632 and Spirakis, Paul ORCID: 0000-0001-5396-3749
(2023)
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems.
In: 32nd International Symposium on Algorithms and Computation (ISAAC 2021), 2021-12-6 - 2021-12-8, Fukuoka , Japan.
Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257, Nikoletseas, Sotiris, Raptopoulos, Christoforos and Spirakis, Paul ORCID: 0000-0001-5396-3749
(2018)
Mutants and Residents with Different Connection Graphs in the Moran Process.
LATIN 2018: THEORETICAL INFORMATICS, 10807.
pp. 790-804.
Spirakis, Paul G ORCID: 0000-0001-5396-3749, Nikoletseas, Sotiris and Raptopoulos, Christoforos
(2023)
Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models.
.
Christodoulou, Filippos, Nikoletseas, Sotiris, Raptopoulos, Christoforos and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2023)
A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs.
.
Akrida, Eleni C, Mertzios, George B, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Raptopoulos, Christoforos
(2021)
The temporal explorer who returns to the base.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 120.
pp. 179-193.