Follow
George B. Mertzios
George B. Mertzios
Associate Professor, Durham University
Verified email at durham.ac.uk - Homepage
Title
Cited by
Cited by
Year
Temporal network optimization subject to connectivity constraints
GB Mertzios, O Michail, PG Spirakis
Algorithmica 81 (4), 1416-1449, 2019
135*2019
Determining majority in networks with local interactions and very small local memory
GB Mertzios, SE Nikoletseas, CL Raptopoulos, PG Spirakis
International Colloquium on Automata, Languages, and Programming, 871-882, 2014
1132014
Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity
F Foucaud, GB Mertzios, R Naserasr, A Parreau, P Valicov
Algorithmica 78 (3), 914-944, 2017
83*2017
Temporal vertex cover with a sliding time window
EC Akrida, GB Mertzios, PG Spirakis, V Zamaraev
Journal of Computer and System Sciences 107, 108-123, 2020
732020
Deleting edges to restrict the size of an epidemic in temporal networks
J Enright, K Meeks, GB Mertzios, V Zamaraev
Journal of Computer and System Sciences 119, 60-77, 2021
722021
Approximating fixation probabilities in the generalized moran process
J Díaz, LA Goldberg, GB Mertzios, D Richerby, M Serna, PG Spirakis
Algorithmica 69, 78-91, 2014
672014
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs
AC Giannopoulou, GB Mertzios, R Niedermeier
Theoretical computer science 689, 67-95, 2017
642017
The complexity of optimal design of temporally connected graphs
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
Theory of Computing Systems 61, 907-944, 2017
63*2017
A simple polynomial algorithm for the longest path problem on cocomparability graphs
GB Mertzios, DG Corneil
SIAM Journal on Discrete Mathematics 26 (3), 940-963, 2012
622012
The longest path problem has a polynomial solution on interval graphs
K Ioannidou, GB Mertzios, SD Nikolopoulos
Algorithmica 61, 320-341, 2011
572011
Optimizing busy time on parallel machines
GB Mertzios, M Shalom, A Voloshin, PWH Wong, S Zaks
Theoretical Computer Science 562, 524-541, 2015
522015
The power of linear-time data reduction for maximum matching
GB Mertzios, A Nichterlein, R Niedermeier
Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017
49*2017
Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds
F Foucaud, GB Mertzios, R Naserasr, A Parreau, P Valicov
Theoretical Computer Science 668, 43-58, 2017
482017
Computing maximum matchings in temporal graphs
GB Mertzios, H Molter, R Niedermeier, V Zamaraev, P Zschoche
arXiv preprint arXiv:1905.05304, 2019
46*2019
Sliding window temporal graph coloring
GB Mertzios, H Molter, V Zamaraev
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7667-7674, 2019
422019
Ephemeral networks with random availability of links: The case of fast networks
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
Journal of Parallel and Distributed Computing 87, 109-120, 2016
41*2016
Algorithms and Almost Tight Results for -Colorability of Small Diameter Graphs
GB Mertzios, PG Spirakis
Algorithmica 74, 385-414, 2016
332016
On the fixation probability of superstars
J Díaz, LA Goldberg, GB Mertzios, D Richerby, M Serna, PG Spirakis
Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2013
322013
The temporal explorer who returns to the base
EC Akrida, GB Mertzios, PG Spirakis
International Conference on Algorithms and Complexity, 13-24, 2019
312019
Natural models for evolution on networks
GB Mertzios, S Nikoletseas, C Raptopoulos, PG Spirakis
Theoretical Computer Science 477, 76-95, 2013
302013
The system can't perform the operation now. Try again later.
Articles 1–20