- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c27 |      | Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis: Selfish Resource Allocation in Optical Networks. CIAC 2013: 25-36 |
| 2012 | ||
| j11 | | Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika: On a Noncooperative Model for Wavelength Assignment in Multifiber Optical Networks. IEEE/ACM Trans. Netw. 20(4): 1125-1137 (2012) |
| 2011 | ||
| j10 | | Evangelos Bampas, Aris Pagourtzis, Katerina Potika: An experimental study of maximum profit wavelength assignment in WDM rings. Networks 57(3): 285-293 (2011) |
| c26 | | Paraschos Koutris, Aris Pagourtzis: Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. CATS 2011: 161-168 |
| 2010 | ||
| c25 | | Paraschos Koutris, Aris Pagourtzis: Brief announcement: k-shot distributed broadcasting in radio networks. PODC 2010: 77-78 |
| 2009 | ||
| j9 | | 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) |
| c24 | | Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasileios Syrgkanis: Colored Resource Allocation Games. CTW 2009: 68-72 |
| c23 | | Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes: On the Connection between Interval Size Functions and Path Counting. TAMC 2009: 108-117 |
| 2008 | ||
| j8 |  | Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis, Konrad Schlude: On the Complexity of Variations of Equal Sum Subsets. Nord. J. Comput. 14(3): 151-172 (2008) |
| c22 | | Evangelos Bampas, Aris Pagourtzis, Katerina Potika: Maximum Profit Wavelength Assignment in WDM Rings. CTW 2008: 35-38 |
| c21 | | 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 | ||
| j7 | | Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik: Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47(1): 97-117 (2007) |
| j6 | | Aris Pagourtzis, Katerina Potika, Stathis Zachos: Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007) |
| c20 | | Ioannis Milis, Aris Pagourtzis, Katerina Potika: Selfish Routing and Path Coloring in All-Optical Networks. CAAN 2007: 71-84 |
| c19 | | Dora Souliou, Aris Pagourtzis, Panayotis Tsanakas: A fast parallel algorithm for frequent itemsets mining. AIAI 2007: 213-220 |
| c18 | | Christos Nomikos, Aris Pagourtzis, Stathis Zachos: Randomized and Approximation Algorithms for Blue-Red Matching. MFCS 2007: 715-725 |
| 2006 | ||
| j5 | | 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) |
| j4 | | 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) |
| c17 | | Evangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis: Periodic Metro Scheduling. ATMOS 2006 |
| c16 | | Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis: Distributed Routing in Tree Networks with Few Landmarks. CAAN 2006: 45-57 |
| c15 | | Aris Pagourtzis, Stathis Zachos: The Complexity of Counting Functions with Easy Decision Version. MFCS 2006: 741-752 |
| 2005 | ||
| c14 | | 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 |
| c13 | | Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos: Computing Frequent Itemsets in Parallel Using Partial Support Trees. PVM/MPI 2005: 28-37 |
| 2004 | ||
| c12 | | Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos: Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING 2004: 150-161 |
| 2003 | ||
| j3 | | Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter: Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. 46(4): 391-400 (2003) |
| j2 | | 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) |
| c11 | | |
| c10 | | Christos Nomikos, Aris Pagourtzis, Stathis Zachos: Minimizing Request Blocking in All-Optical Rings. INFOCOM 2003 |
| c9 | | |
| c8 | | Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos: Resource Allocation Problems in Multifiber WDM Tree Networks. WG 2003: 218-229 |
| 2002 | ||
| c7 | | Leszek Gasieniec, Aris Pagourtzis, Igor Potapov: Deterministic Communication in Radio Networks with Large Labels. ESA 2002: 512-524 |
| c6 | | 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 |
| c5 | | Aris Pagourtzis, Igor Potapov, Wojciech Rytter: Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI 2002: 217-225 |
| 2001 | ||
| j1 | | Christos Nomikos, Aris Pagourtzis, Stathis Zachos: Routing and path multicoloring. Inf. Process. Lett. 80(5): 249-256 (2001) |
| c4 | | Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis: Oblivious gossiping in ad-hoc radio networks. DIAL-M 2001: 44-51 |
| c3 | | 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 |
| c2 | | Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos: Acceptor-Definable Counting Classes. Panhellenic Conference on Informatics 2001: 453-463 |
| c1 | | Aris Pagourtzis, Igor Potapov, Wojciech Rytter: PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI 2001: 249-256 |
Data released under the ODC-BY 1.0 license — See also our legal information page