2009 |
30 | EE | Frans Coenen,
Paul H. Leng,
Aris Pagourtzis,
Wojciech Rytter,
Dora Souliou:
Improved methods for extracting frequent itemsets from interim-support trees.
Softw., Pract. Exper. 39(6): 551-571 (2009) |
2008 |
29 | | Evangelos Bampas,
Aris Pagourtzis,
Katerina Potika:
Maximum Profit Wavelength Assignment in WDM Rings.
CTW 2008: 35-38 |
28 | EE | Evangelos Bampas,
Aris Pagourtzis,
George Pierrakos,
Katerina Potika:
On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks.
ISAAC 2008: 159-170 |
2007 |
27 | EE | Dora Souliou,
Aris Pagourtzis,
Panayotis Tsanakas:
A fast parallel algorithm for frequent itemsets mining.
AIAI 2007: 213-220 |
26 | EE | Ioannis Milis,
Aris Pagourtzis,
Katerina Potika:
Selfish Routing and Path Coloring in All-Optical Networks.
CAAN 2007: 71-84 |
25 | EE | Christos Nomikos,
Aris Pagourtzis,
Stathis Zachos:
Randomized and Approximation Algorithms for Blue-Red Matching.
MFCS 2007: 715-725 |
24 | EE | Leszek Gasieniec,
Aris Pagourtzis,
Igor Potapov,
Tomasz Radzik:
Deterministic Communication in Radio Networks with Large Labels.
Algorithmica 47(1): 97-117 (2007) |
23 | EE | Aris Pagourtzis,
Katerina Potika,
Stathis Zachos:
Path multicoloring with fewer colors in spiders and caterpillars.
Computing 80(3): 255-274 (2007) |
2006 |
22 | EE | Evangelos Bampas,
Georgia Kaouri,
Michael Lampis,
Aris Pagourtzis:
Periodic Metro Scheduling.
ATMOS 2006 |
21 | EE | Ioannis Z. Emiris,
Euripides Markou,
Aris Pagourtzis:
Distributed Routing in Tree Networks with Few Landmarks.
CAAN 2006: 45-57 |
20 | EE | Aris Pagourtzis,
Stathis Zachos:
The Complexity of Counting Functions with Easy Decision Version.
MFCS 2006: 741-752 |
19 | EE | Christos Nomikos,
Aris Pagourtzis,
Katerina Potika,
Stathis Zachos:
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost.
Computer Networks 50(1): 1-14 (2006) |
18 | EE | Dora Souliou,
Aris Pagourtzis,
Nikolaos Drosinos,
Panayotis Tsanakas:
Computing frequent itemsets in parallel using partial support trees.
Journal of Systems and Software 79(12): 1735-1743 (2006) |
2005 |
17 | EE | Dora Souliou,
Aris Pagourtzis,
Nikolaos Drosinos:
Computing Frequent Itemsets in Parallel Using Partial Support Trees.
PVM/MPI 2005: 28-37 |
16 | EE | Stratis Ioannidis,
Christos Nomikos,
Aris Pagourtzis,
Stathis Zachos:
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree.
Panhellenic Conference on Informatics 2005: 57-67 |
2004 |
15 | EE | Christos Nomikos,
Aris Pagourtzis,
Katerina Potika,
Stathis Zachos:
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks.
NETWORKING 2004: 150-161 |
2003 |
14 | EE | Mark Cieliebak,
Stephan Eidenbenz,
Aris Pagourtzis:
Composing Equipotent Teams.
FCT 2003: 98-108 |
13 | EE | Christos Nomikos,
Aris Pagourtzis,
Stathis Zachos:
Minimizing Request Blocking in All-Optical Rings.
INFOCOM 2003 |
12 | EE | Stephan Eidenbenz,
Aris Pagourtzis,
Peter Widmayer:
Flexible Train Rostering.
ISAAC 2003: 615-624 |
11 | EE | Thomas Erlebach,
Aris Pagourtzis,
Katerina Potika,
Stamatis Stefanakos:
Resource Allocation Problems in Multifiber WDM Tree Networks.
WG 2003: 218-229 |
10 | EE | Alan Gibbons,
Aris Pagourtzis,
Igor Potapov,
Wojciech Rytter:
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique.
Comput. J. 46(4): 391-400 (2003) |
9 | EE | Christos Nomikos,
Aris Pagourtzis,
Stathis Zachos:
Satisfying a maximum number of pre-routed requests in all-optical rings.
Computer Networks 42(1): 55-63 (2003) |
2002 |
8 | EE | Leszek Gasieniec,
Aris Pagourtzis,
Igor Potapov:
Deterministic Communication in Radio Networks with Large Labels.
ESA 2002: 512-524 |
7 | | Aris Pagourtzis,
Paolo Penna,
Konrad Schlude,
Kathleen Steinhöfel,
David Scot Taylor,
Peter Widmayer:
Server Placements, Roman Domination and other Dominating Set Variants.
IFIP TCS 2002: 280-291 |
6 | EE | Aris Pagourtzis,
Igor Potapov,
Wojciech Rytter:
Observations on Parallel Computation of Transitive and Max-Closure Problems.
PVM/MPI 2002: 217-225 |
2001 |
5 | EE | Bogdan S. Chlebus,
Leszek Gasieniec,
Andrzej Lingas,
Aris Pagourtzis:
Oblivious gossiping in ad-hoc radio networks.
DIAL-M 2001: 44-51 |
4 | EE | Thomas Erlebach,
Martin Gantenbein,
Daniel Hürlimann,
Gabriele Neyer,
Aris Pagourtzis,
Paolo Penna,
Konrad Schlude,
Kathleen Steinhöfel,
David Scot Taylor,
Peter Widmayer:
On the Complexity of Train Assignment Problems.
ISAAC 2001: 390-402 |
3 | EE | Aris Pagourtzis,
Igor Potapov,
Wojciech Rytter:
PVM Computation of the Transitive Closure: The Dependency Graph Approach.
PVM/MPI 2001: 249-256 |
2 | EE | Aggelos Kiayias,
Aris Pagourtzis,
Kiron Sharma,
Stathis Zachos:
Acceptor-Definable Counting Classes.
Panhellenic Conference on Informatics 2001: 453-463 |
1 | EE | Christos Nomikos,
Aris Pagourtzis,
Stathis Zachos:
Routing and path multicoloring.
Inf. Process. Lett. 80(5): 249-256 (2001) |