| Oblivious gossiping in ad-hoc radio networks BS Chlebus, L Gąsieniec, A Lingas, AT Pagourtzis Proceedings of the 5th international workshop on Discrete algorithms and …, 2001 | 51 | 2001 |
| Resource allocation problems in multifiber WDM tree networks T Erlebach, A Pagourtzis, K Potika, S Stefanakos International Workshop on Graph-Theoretic Concepts in Computer Science, 218-229, 2003 | 49 | 2003 |
| Deterministic communication in radio networks with large labels L Gasieniec, A Pagourtzis, I Potapov, T Radzik Algorithmica 47 (1), 97-117, 2007 | 45* | 2007 |
| Routing and path multicoloring C Nomikos, A Pagourtzis, S Zachos Information Processing Letters 80 (5), 249-256, 2001 | 44 | 2001 |
| Reliable broadcast with respect to topology knowledge A Pagourtzis, G Panagiotakos, D Sakavalas Distributed Computing 30 (2), 87-102, 2017 | 40 | 2017 |
| The complexity of counting functions with easy decision version A Pagourtzis, S Zachos International Symposium on Mathematical Foundations of Computer Science, 741-752, 2006 | 36 | 2006 |
| Minimizing request blocking in all-optical rings C Nomikos, A Pagourtzis, S Zachos IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE …, 2003 | 36 | 2003 |
| Server placements, Roman domination and other dominating set variants A Pagourtzis, P Penna, K Schlude, K Steinhöfel, DS Taylor, P Widmayer Foundations of Information Technology in the Era of Network and Mobile …, 2002 | 36 | 2002 |
| On the complexity of train assignment problems T Erlebach, M Gantenbein, D Hürlimann, G Neyer, A Pagourtzis, P Penna, ... International Symposium on Algorithms and Computation, 390-402, 2001 | 34 | 2001 |
| On the Complexity of Variations of Equal Sum Subsets. M Cieliebak, S Eidenbenz, A Pagourtzis, K Schlude Nord. J. Comput. 14 (3), 151-172, 2008 | 31 | 2008 |
| On the Complexity of Variations of Equal Sum Subsets. M Cieliebak, S Eidenbenz, A Pagourtzis, K Schlude Nord. J. Comput. 14 (3), 151-172, 2008 | 31 | 2008 |
| Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost C Nomikos, A Pagourtzis, K Potika, S Zachos Computer Networks 50 (1), 1-14, 2006 | 31 | 2006 |
| Towards everlasting privacy and efficient coercion resistance in remote electronic voting P Grontas, A Pagourtzis, A Zacharakis, B Zhang International Conference on Financial Cryptography and Data Security, 210-231, 2018 | 22 | 2018 |
| Satisfying a maximum number of pre-routed requests in all-optical rings C Nomikos, A Pagourtzis, S Zachos Computer Networks 42 (1), 55-63, 2003 | 22 | 2003 |
| A graph parameter that matches the resilience of the certified propagation algorithm C Litsas, A Pagourtzis, D Sakavalas International Conference on Ad-Hoc Networks and Wireless, 269-280, 2013 | 19* | 2013 |
| Randomized and approximation algorithms for blue-red matching C Nomikos, A Pagourtzis, S Zachos International Symposium on Mathematical Foundations of Computer Science, 715-725, 2007 | 19 | 2007 |
| Fiber cost reduction and wavelength minimization in multifiber WDM networks C Nomikos, A Pagourtzis, K Potika, S Zachos In Proceedings of the 3rd International IFIP-TC6 Networking Conference, LNCS …, 2003 | 19 | 2003 |
| Periodic metro scheduling E Bampas, G Kaouri, M Lampis, A Pagourtzis 6th Workshop on Algorithmic Methods and Models for Optimization of Railways …, 2006 | 16 | 2006 |
| Flexible train rostering S Eidenbenz, A Pagourtzis, P Widmayer International Symposium on Algorithms and Computation, 615-624, 2003 | 16 | 2003 |
| Novel strategies for path stability estimation under topology change using Hello messaging in MANETs A Naushad, G Abbas, ZH Abbas, A Pagourtzis Ad Hoc Networks 87, 76-99, 2019 | 13 | 2019 |
Stathis (Efstathios) ZachosCS Professor, NTUAVerified email at cs.ntua.gr
