Browse by People


Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 16.


Deligkas, Argyrios, Mertzios, George B and Spirakis, Paul G
(2017) Binary Search in Graphs Revisited. .


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Gasieniec, Leszek ORCID: 0000-0003-1809-9814, Mertzios, George B and Spirakis, Paul G
(2017) The Complexity of Optimal Design of Temporally Connected Graphs. THEORY OF COMPUTING SYSTEMS, 61 (3). 907 - 944.


Deligkas, Argyrios, Mertzios, George B, Spirakis, Paul G and AAAI,
(2017) The Computational Complexity of Weighted Greedy Matching. .


Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020) Computing Maximum Matchings in Temporal Graphs. .


Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020) Computing Maximum Matchings in Temporal Graphs. .


Mertzios, George B, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G
(2017) Determining majority in networks with local interactions and very small local memory. Distributed Computing, 30 (1). 1 - 16.


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Gasieniec, Leszek ORCID: 0000-0003-1809-9814, Mertzios, George B and Spirakis, Paul G
(2016) Ephemeral networks with random availability of links: The case of fast networks. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 87. 109 - 120.


Deligkas, Argyrios, Mertzios, George B, Spirakis, Paul G and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle.


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
How fast can we reach a target vertex in stochastic temporal graphs?


Akrida, Eleni C, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G 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. 65 - 83.


Mertzios, George B, Shalom, Mordechai, Wong, Prudence WH ORCID: 0000-0001-7935-7245 and Zaks, Shmuel
(2017) Online Regenerator Placement. Theory of Computing Systems, 61 (3). 739 - 754.


Mertzios, George B, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G
(2017) Population Protocols for Majority in Arbitrary Networks. 77 - 82.


Akrida, E ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Temporal Vertex Cover with a Sliding Time Window. Journal of Computer and System Sciences, 107. 108 - 123.


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul G and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018) Temporal Vertex Cover with a Sliding Time Window. .


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul G and Zarnaraev, Viktor
(2020) Temporal vertex cover with a sliding time window. .


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B and Spirakis, Paul G
(2019) The temporal explorer who returns to the base. International Conference on Algorithms and Complexity (CIAC).

This list was generated on Mon Nov 23 03:58:07 2020 GMT.