| Temporal network optimization subject to connectivity constraints GB Mertzios, O Michail, PG Spirakis Algorithmica 81 (4), 1416-1449, 2019 | 121* | 2019 |
| Determining majority in networks with local interactions and very small local memory GB Mertzios, SE Nikoletseas, CL Raptopoulos, PG Spirakis Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 108 | 2014 |
| 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 | 75* | 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 | 64 | 2014 |
| 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 | 62 | 2012 |
| 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 | 61 | 2020 |
| 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 | 58 | 2021 |
| 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 | 58 | 2017 |
| 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 | 57* | 2017 |
| The longest path problem has a polynomial solution on interval graphs K Ioannidou, GB Mertzios, SD Nikolopoulos Algorithmica 61, 320-341, 2011 | 54 | 2011 |
| Optimizing busy time on parallel machines GB Mertzios, M Shalom, A Voloshin, PWH Wong, S Zaks Theoretical Computer Science 562, 524-541, 2015 | 51 | 2015 |
| 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 | 46 | 2017 |
| The power of linear-time data reduction for matching. GB Mertzios, A Nichterlein, R Niedermeier Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017 | 45* | 2017 |
| 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 | 40* | 2016 |
| Computing maximum matchings in temporal graphs GB Mertzios, H Molter, R Niedermeier, V Zamaraev, P Zschoche arXiv preprint arXiv:1905.05304, 2019 | 38 | 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 | 35 | 2019 |
| 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 | 31 | 2016 |
| 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 | 31 | 2013 |
| Algorithms and Almost Tight Results for -Colorability of Small Diameter Graphs GB Mertzios, PG Spirakis Algorithmica 74, 385-414, 2016 | 30 | 2016 |
| The longest path problem is polynomial on interval graphs K Ioannidou, GB Mertzios, SD Nikolopoulos Mathematical Foundations of Computer Science 2009: 34th International …, 2009 | 30 | 2009 |
Paul SpirakisProfessor of Computer Science U. Liverpool and U. Patras在 liverpool.ac.uk 的电子邮件经过验证
