dblp.uni-trier.dewww.uni-trier.de

Aris Pagourtzis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
30EEFrans 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
28EEEvangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika: On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks. ISAAC 2008: 159-170
2007
27EEDora Souliou, Aris Pagourtzis, Panayotis Tsanakas: A fast parallel algorithm for frequent itemsets mining. AIAI 2007: 213-220
26EEIoannis Milis, Aris Pagourtzis, Katerina Potika: Selfish Routing and Path Coloring in All-Optical Networks. CAAN 2007: 71-84
25EEChristos Nomikos, Aris Pagourtzis, Stathis Zachos: Randomized and Approximation Algorithms for Blue-Red Matching. MFCS 2007: 715-725
24EELeszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik: Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47(1): 97-117 (2007)
23EEAris Pagourtzis, Katerina Potika, Stathis Zachos: Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007)
2006
22EEEvangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis: Periodic Metro Scheduling. ATMOS 2006
21EEIoannis Z. Emiris, Euripides Markou, Aris Pagourtzis: Distributed Routing in Tree Networks with Few Landmarks. CAAN 2006: 45-57
20EEAris Pagourtzis, Stathis Zachos: The Complexity of Counting Functions with Easy Decision Version. MFCS 2006: 741-752
19EEChristos 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)
18EEDora 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
17EEDora Souliou, Aris Pagourtzis, Nikolaos Drosinos: Computing Frequent Itemsets in Parallel Using Partial Support Trees. PVM/MPI 2005: 28-37
16EEStratis 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
15EEChristos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos: Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING 2004: 150-161
2003
14EEMark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis: Composing Equipotent Teams. FCT 2003: 98-108
13EEChristos Nomikos, Aris Pagourtzis, Stathis Zachos: Minimizing Request Blocking in All-Optical Rings. INFOCOM 2003
12EEStephan Eidenbenz, Aris Pagourtzis, Peter Widmayer: Flexible Train Rostering. ISAAC 2003: 615-624
11EEThomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos: Resource Allocation Problems in Multifiber WDM Tree Networks. WG 2003: 218-229
10EEAlan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter: Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. 46(4): 391-400 (2003)
9EEChristos 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
8EELeszek 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
6EEAris Pagourtzis, Igor Potapov, Wojciech Rytter: Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI 2002: 217-225
2001
5EEBogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis: Oblivious gossiping in ad-hoc radio networks. DIAL-M 2001: 44-51
4EEThomas 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
3EEAris Pagourtzis, Igor Potapov, Wojciech Rytter: PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI 2001: 249-256
2EEAggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos: Acceptor-Definable Counting Classes. Panhellenic Conference on Informatics 2001: 453-463
1EEChristos Nomikos, Aris Pagourtzis, Stathis Zachos: Routing and path multicoloring. Inf. Process. Lett. 80(5): 249-256 (2001)

Coauthor Index

1Evangelos Bampas [22] [28] [29]
2Bogdan S. Chlebus [5]
3Mark Cieliebak [14]
4Frans Coenen [30]
5Nikolaos Drosinos [17] [18]
6Stephan Eidenbenz [12] [14]
7Ioannis Z. Emiris [21]
8Thomas Erlebach [4] [11]
9Martin Gantenbein [4]
10Leszek Gasieniec [5] [8] [24]
11Alan Gibbons [10]
12Daniel Hürlimann [4]
13Stratis Ioannidis [16]
14Georgia Kaouri [22]
15Aggelos Kiayias [2]
16Michael Lampis [22]
17Paul H. Leng [30]
18Andrzej Lingas [5]
19Euripides Markou [21]
20Ioannis Milis [26]
21Gabriele Neyer [4]
22Christos Nomikos [1] [9] [13] [15] [16] [19] [25]
23Paolo Penna [4] [7]
24George Pierrakos [28]
25Igor Potapov [3] [6] [8] [10] [24]
26Katerina Potika [11] [15] [19] [23] [26] [28] [29]
27Tomasz Radzik [24]
28Wojciech Rytter [3] [6] [10] [30]
29Konrad Schlude [4] [7]
30Kiron Sharma [2]
31Dora Souliou [17] [18] [27] [30]
32Stamatis Stefanakos [11]
33Kathleen Steinhöfel [4] [7]
34David Scot Taylor [4] [7]
35Panayotis Tsanakas [18] [27]
36Peter Widmayer [4] [7] [12]
37Stathis Zachos [1] [2] [9] [13] [15] [16] [19] [20] [23] [25]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)