Obserwuj
Aris Pagourtzis
Tytuł
Cytowane przez
Cytowane przez
Rok
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
532002
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
502001
Resource allocation problems in multifiber WDM tree networks
T Erlebach, A Pagourtzis, K Potika, S Stefanakos
Graph-Theoretic Concepts in Computer Science: 29th International Workshop …, 2003
492003
Deterministic communication in radio networks with large labels
L Gasieniec, A Pagourtzis, I Potapov, T Radzik
Algorithmica 47 (1), 97-117, 2007
46*2007
The complexity of counting functions with easy decision version
A Pagourtzis, S Zachos
International Symposium on Mathematical Foundations of Computer Science, 741-752, 2006
452006
Reliable broadcast with respect to topology knowledge
A Pagourtzis, G Panagiotakos, D Sakavalas
Distributed Computing 30, 87-102, 2017
432017
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
432008
Routing and path multicoloring
C Nomikos, A Pagourtzis, S Zachos
Information Processing Letters 80 (5), 249-256, 2001
432001
Towards everlasting privacy and efficient coercion resistance in remote electronic voting
P Grontas, A Pagourtzis, A Zacharakis, B Zhang
Financial Cryptography and Data Security: FC 2018 International Workshops …, 2019
402019
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
392003
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
352001
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
312006
Optimal circle search despite the presence of faulty robots
K Georgiou, E Kranakis, N Leonardos, A Pagourtzis, I Papaioannou
International Symposium on Algorithms and Experiments for Sensor Systems …, 2019
252019
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
232019
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
22*2013
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
222003
Acceptor-definable counting classes
A Kiayias, A Pagourtzis, K Sharma, S Zachos
Advances in Informatics: 8th Panhellenic Conference on Informatics, PCI 2001 …, 2003
22*2003
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
212007
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
192003
Periodic metro scheduling
E Bampas, G Kaouri, M Lampis, A Pagourtzis
6th Workshop on Algorithmic Methods and Models for Optimization of Railways …, 2006
172006
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20