Browse by People

Deligkas, Argyrios, Mertzios, George B and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2017) Binary Search in Graphs Revisited. In: Mathematical Foundations Of Computer Science (MFCS) 2017, 2017-8-21 - 2017-8-25, Aalborg , Denmark.

Mertzios, George B, Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, George, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail (2022) The Complexity of Growing a Graph. In: International Symposium on Algorithmics of Wireless Networks (ALGOSENSORS).

Mertzios, George B, Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, George ORCID: 0000-0003-2514-8004, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2021) The Complexity of Growing a Graph. [Preprint]

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

Hamm, Thekla, Klobas, Nina, Mertzios, George B and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2022) The Complexity of Temporal Vertex Cover in Small-Degree Graphs. In: 36th AAAI Conference on Artificial Intelligence, 2022-2-22 - 2022-3-1, Vancouver , Canada.

Deligkas, Argyrios, Mertzios, George B and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2017) The Computational Complexity of Weighted Greedy Matching. In: Thirty First AAAI Conference on Artificial Intelligence AAAI 2017, 2017-2-4 - 2017-2-9, San Francisco US.

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. In: STACS.

Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp (2023) Computing maximum matchings in temporal graphs. Journal of Computer and System Sciences, 137. pp. 1-19.

Enright, Jessica, Meeks, Kitty, Mertzios, George B and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2021) Deleting edges to restrict the size of an epidemic in temporal networks. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 119. pp. 60-77.

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

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

Deligkas, Argyrios, Mertzios, George B, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2020) Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. Leibniz International Proceedings in Informatics, LIPIcs, 170.

Gadouleau, Maximilien, Harms, Nathaniel, Mertzios, George B and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2024) Graphs with minimum fractional domatic number. Discrete Applied Mathematics, 343. pp. 140-148.

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.

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). pp. 739-754.

Mertzios, George B, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2017) Population Protocols for Majority in Arbitrary Networks. Trends in Mathematics, 6. pp. 77-82.

Mertzios, George B, Molter, Hendrik and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2021) Sliding window temporal graph coloring. Journal of Computer and System Sciences, 120. pp. 97-115.

Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2018) Temporal Vertex Cover with a Sliding Time Window. In: International; Colloquium on Automata , Languages and Programming (ICALP), 2018-7-9 - 2018-7-13, Prague.

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

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 ORCID: 0000-0001-5396-3749 (2019) The temporal explorer who returns to the base. International Conference on Algorithms and Complexity (CIAC), 11485 . pp. 13-24.

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.