Aris Pagourtzis

	2009
32		Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasileios Syrgkanis: Colored Resource Allocation Games. CTW 2009: 68-72
31		Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes: On the Connection between Interval Size Functions and Path Counting. TAMC 2009: 108-117
30		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		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		Dora Souliou, Aris Pagourtzis, Panayotis Tsanakas: A fast parallel algorithm for frequent itemsets mining. AIAI 2007: 213-220
26		Ioannis Milis, Aris Pagourtzis, Katerina Potika: Selfish Routing and Path Coloring in All-Optical Networks. CAAN 2007: 71-84
25		Christos Nomikos, Aris Pagourtzis, Stathis Zachos: Randomized and Approximation Algorithms for Blue-Red Matching. MFCS 2007: 715-725
24		Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik: Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47(1): 97-117 (2007)
23		Aris Pagourtzis, Katerina Potika, Stathis Zachos: Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007)
	2006
22		Evangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis: Periodic Metro Scheduling. ATMOS 2006
21		Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis: Distributed Routing in Tree Networks with Few Landmarks. CAAN 2006: 45-57
20		Aris Pagourtzis, Stathis Zachos: The Complexity of Counting Functions with Easy Decision Version. MFCS 2006: 741-752
19		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		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		Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos: Computing Frequent Itemsets in Parallel Using Partial Support Trees. PVM/MPI 2005: 28-37
16		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		Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos: Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING 2004: 150-161
	2003
14		Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis: Composing Equipotent Teams. FCT 2003: 98-108
13		Christos Nomikos, Aris Pagourtzis, Stathis Zachos: Minimizing Request Blocking in All-Optical Rings. INFOCOM 2003
12		Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer: Flexible Train Rostering. ISAAC 2003: 615-624
11		Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos: Resource Allocation Problems in Multifiber WDM Tree Networks. WG 2003: 218-229
10		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		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		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		Aris Pagourtzis, Igor Potapov, Wojciech Rytter: Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI 2002: 217-225
	2001
5		Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis: Oblivious gossiping in ad-hoc radio networks. DIAL-M 2001: 44-51
4		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		Aris Pagourtzis, Igor Potapov, Wojciech Rytter: PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI 2001: 249-256
2		Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos: Acceptor-Definable Counting Classes. Panhellenic Conference on Informatics 2001: 453-463
1		Christos Nomikos, Aris Pagourtzis, Stathis Zachos: Routing and path multicoloring. Inf. Process. Lett. 80(5): 249-256 (2001)

Coauthor Index

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