Følg
George B. Mertzios
George B. Mertzios
Associate Professor, Durham University
Verifisert e-postadresse på durham.ac.uk - Startside
Tittel
Sitert av
Sitert av
År
Temporal network optimization subject to connectivity constraints
GB Mertzios, O Michail, PG Spirakis
Algorithmica 81 (4), 1416-1449, 2019
155*2019
Determining majority in networks with local interactions and very small local memory
GB Mertzios, SE Nikoletseas, CL Raptopoulos, PG Spirakis
Distributed Computing 30, 1-16, 2017
1112017
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
892021
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
89*2017
Temporal vertex cover with a sliding time window
EC Akrida, GB Mertzios, PG Spirakis, V Zamaraev
arXiv preprint arXiv:1802.07103, 2018
862018
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
76*2017
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
722014
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
622017
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
602012
The longest path problem has a polynomial solution on interval graphs
K Ioannidou, GB Mertzios, SD Nikolopoulos
Algorithmica 61, 320-341, 2011
602011
Computing maximum matchings in temporal graphs
GB Mertzios, H Molter, R Niedermeier, V Zamaraev, P Zschoche
Journal of Computer and System Sciences 137, 1-19, 2023
562023
The power of linear-time data reduction for maximum matching
GB Mertzios, A Nichterlein, R Niedermeier
Algorithmica 82 (12), 3521-3565, 2020
53*2020
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
532017
Optimizing busy time on parallel machines
GB Mertzios, M Shalom, A Voloshin, PWH Wong, S Zaks
Theoretical Computer Science 562, 524-541, 2015
522015
Sliding window temporal graph coloring
GB Mertzios, H Molter, V Zamaraev
Journal of Computer and System Sciences 120, 97-115, 2021
482021
The temporal explorer who returns to the base
EC Akrida, GB Mertzios, PG Spirakis, C Raptopoulos
Journal of Computer and System Sciences 120, 179-193, 2021
452021
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
43*2016
Intersection graphs of L-shapes and segments in the plane
S Felsner, K Knauer, GB Mertzios, T Ueckerdt
Discrete Applied Mathematics 206, 48-55, 2016
352016
Algorithms and Almost Tight Results for -Colorability of Small Diameter Graphs
GB Mertzios, PG Spirakis
Algorithmica 74, 385-414, 2016
342016
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
332013
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20