Aris Pagourtzis
Titel
Zitiert von
Zitiert von
Jahr
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
512001
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
502003
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
432001
Reliable broadcast with respect to topology knowledge
A Pagourtzis, G Panagiotakos, D Sakavalas
Distributed Computing 30 (2), 87-102, 2017
372017
The complexity of counting functions with easy decision version
A Pagourtzis, S Zachos
International Symposium on Mathematical Foundations of Computer Science, 741-752, 2006
362006
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
362003
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
342001
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
322002
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
302006
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
242008
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
242008
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
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
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
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
172018
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
172007
Flexible train rostering
S Eidenbenz, A Pagourtzis, P Widmayer
International Symposium on Algorithms and Computation, 615-624, 2003
152003
Periodic metro scheduling
E Bampas, G Kaouri, M Lampis, A Pagourtzis
6th Workshop on Algorithmic Methods and Models for Optimization of Railways …, 2006
142006
On a noncooperative model for wavelength assignment in multifiber optical networks
E Bampas, A Pagourtzis, G Pierrakos, K Potika
IEEE/ACM Transactions on Networking 20 (4), 1125-1137, 2011
132011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20