Aris Pagourtzis's Publications

• E. Bampas, A. Pagourtzis, G. Pierrakos, and K. Potika,
  On a non-cooperative model for wavelength assignment in multifiber optical networks,
  IEEE/ACM Transactions on Networking, 20(4): 1125-1137, 2012. (online copy)
• E. Bampas, A. Pagourtzis, and K. Potika,
  An experimental study of maximum profit wavelength assignment in WDM rings,
  Networks, 57(3), pp. 285-293 (2011). (online copy, preliminary draft)
• P. Koutris and A. Pagourtzis,
  Oblivious k-shot broadcasting in ad hoc radio networks,
  In Proceedings of the 17th Computing: The Australasian The- ory Symposium (CATS 2011), Perth, Australia, January 2011, CPRIT, Vol. 119. (pdf)
• P. Koutris and A. Pagourtzis,
  Brief announcement: k-shot distributed broadcasting in radio networks,
  In Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of Distributed Computing (PODC '10). ACM, New York, NY, USA, 77-78. DOI=10.1145/1835698.1835717 (electronic edition)
• E. Bampas, A. Pagourtzis, G. Pierrakos, and V. Syrganis,
  Colored resource allocation games (extended abstract),
  In Proceedings of CTW 2009 - 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp. 68-72, 2009. (electronic edition)
• E. Bampas, A.-N. Goebel, A. Pagourtzis, and A. Tentes,
  On the connection between interval size functions and path counting,
  In Proceedings of TAMC 2009 - 6th Annual Conference on Theory and Applications of Models of Computation, LNCS 5532, pp. 108-117. Springer-Verlag, Berlin Heidelberg, 2009. (electronic edition)
• F. Coenen, P. Leng, A. Pagourtzis, D. Souliou, and W. Rytter,
  Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees,
  Software: Practice and Experience, 39(6), pp. 551-571, Wiley Interscience 2009. (online copy)
• M. Cieliebak, S. Eidenbenz, A. Pagourtzis, and K. Schlude,
  On the Complexity of Variations of Equal Sum Subsets,
  Nordic Journal of Computing, 14(3), pp. 151-172 (2008). (pdf)
• E. Bampas, A. Pagourtzis, G. Pierrakos, and K. Potika,
  On a non-cooperative model for wavelength assignment in multifiber optical networks,
  In Proceedings of ISAAC 2008 - 19th International Symposium on Algorithms and Computation, LNCS 5369, pp. 159-170. Springer-Verlag, Berlin Heidelberg, 2008. (electronic edition)
• E. Bampas, A. Pagourtzis, and K. Potika,
  Maximum profit wavelength assignment in WDM rings (extended abstract) ,
  In Proceedings of CTW 2008 - 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp. 35-38, 2008. (electronic edition)
  
• C. Nomikos, A. Pagourtzis, and S. Zachos,
  Randomized and Approximation Algorithms for Blue-Red Matching,
  In Proceedings of 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007). (electronic edition)
• A. Pagourtzis, K. Potika, and S. Zachos,
  Path Multicoloring with Fewer Colors in Spiders and Caterpillars,
  Computing, 80(3), pp. 255-274, Springer Wien, 2007. (electronic edition)
• L. Gasieniec, A. Pagourtzis, I. Potapov, and T. Radzik,
  Deterministic Communication in Radio Networks with Large Labels,
  Algorithmica, 47(1), pp. 97-117, Springer, 2007. (electronic edition)


• I. Milis, A. Pagourtzis, and K. Potika,
  Selfish Routing and Path Coloring in All-Optical Networks.
  In Proceedings of 4th Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007), Lecture Notes in Computer Science 4852, pp. 71-84, Springer-Verlag 2007. (electronic edition)
  
• E. Bampas, G. Kaouri, M. Lampis, and A. Pagourtzis,
  Periodic Metro Scheduling,
  In Proceedings of the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2006), Schloss Dagstuhl Research Online Publication Server. (electronic edition)
• C. Nomikos, A. Pagourtzis, K. Potika, and S. Zachos,
  Routing and Wavelength Assignment in Multifiber WDM Networks with Non-Uniform Fiber Cost,
  Computer Networks, 50(1), pp. 1-14, Elsevier Science, 2006. (electronic edition)


• A. Pagourtzis and S. Zachos,
  The Complexity of Counting Functions with Easy Decision Version,
  In Proceedings of 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), Lecture Notes in Computer Science 4162, pp. 741-752, Springer-Verlag. (electronic edition, Long version)
• D. Souliou, A. Pagourtzis, N. Drosinos, and P. Tsanakas,
  Computing Frequent Itemsets in Parallel using Partial Support Trees,
  Journal of Systems and Software, 79(12), pp. 1735-1743, Elsevier Science, 2006. (online copy)


• I.Z. Emiris, E. Markou, and A. Pagourtzis,
  Distributed Routing in Tree Networks with Few Landmarks,
  In Proceedings of 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN' 2006), July 2006, Chester, United Kingdom. (pdf)
  
• F. Coenen, P. Leng, A. Pagourtzis, D. Souliou and W. Rytter,
  Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees,
  In Proceedings of the 25th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (AI 2005), Dec 13 -- 14, pp. 263-276, Springer, London. (pdf)
  
• S. Ioannidis, C. Nomikos, A. Pagourtzis, and S. Zachos,
  Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree,
  In Proceedings of 10th Panhellenic Conference on Informatics (PCI 2005), Volos, Greece, Nov 11-13 2005. Lecture Notes in Computer Science 3746, pp. 57-67, Springer-Verlag. (electronic edition)
  
• A. Pagourtzis, D. Souliou and P. Tsanakas,
  Techniques for Parallel Mining of Association Rules,
  In Proceedings of 10th Panhellenic Conference on Informatics (PCI 2005), Volos, Greece, Nov 11-13 2005.
  
• D. Souliou, A. Pagourtzis, and N. Drosinos,
  Computing Frequent Itemsets in Parallel Using Partial Support Trees,
  In Proceedings of 10th European PVM/MPI Conference (Euro PVM/MPI 2005), Sep 18 - 21, 2005, Sorrento (Naples), Italy, Lecture Notes in Computer Science 3666, pp. 28-37, Springer-Verlag 2005. (electronic edition)
  
• A. Pagourtzis and S. Zachos,
  Self-Reducibility of Hard Counting Problems with Decision Version in P,
  In Proceedings of 5th Panhellenic Logic Symposium (PLS 2005), Athens, Jul 25-28, pp. 126-133, 2005.
  
• C. Nomikos, A. Pagourtzis, K. Potika, and S. Zachos,
  Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks,
  In Proceedings of the Third IFIP-TC6 Networking Conference (Networking 2004), Athens, Greece, May 9-14, 2004, pp. 150-161. (electronic edition)
• C. Nomikos, A. Pagourtzis, and S. Zachos,
  Satisfying a maximum number of pre-routed requests in all-optical rings,
  Computer Networks, 42(1), pp. 55-63, Elsevier Science, 2003. (electronic edition)
• A. Gibbons, A. Pagourtzis, I. Potapov and W. Rytter,
  Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique,
  The Computer Journal, 46(4), pp. 391-400, Oxford University Press, 2003. (electronic edition)


• S. Eidenbenz, A. Pagourtzis, and P. Widmayer,
  Flexible Train Rostering,
  In Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), Kyoto, Japan, December 15-17, 2003, Lecture Notes in Computer Science 2906, pp. 615-624, Springer-Verlag. (electronic edition)
  
• T. Erlebach, A. Pagourtzis, K. Potika, S. Stefanakos,
  Limited Bandwidth in Multiple-Fiber All-Optical Caterpillars: a Minimization Problem,
  Proceedings of the 1st Balkan Conference on Informatics (BCI 2003), pp. 133-146, Thessaloniki, Greece, November 21-23, 2003.
  
• M. Cieliebak, S. Eidenbenz, and A. Pagourtzis,
  Composing Equipotent Teams,
  In Proceedings of 14th International Symposium on Fundamentals of Computation Theory (FCT 2003), Malmoe, Sweden, Aug 13-15, 2003, Lecture Notes in Computer Science 2751, pp. 98-108, Springer-Verlag, 2003. (electronic edition)
  
• S. Zachos and A. Pagourtzis,
  Combinatory Complexity: Operators on Complexity Classes,
  In Proceedings of 4th Panhellenic Logic Symposium (PLS 2003), Thessaloniki, Jul 7-10 2003.
  
• T. Erlebach, A. Pagourtzis, E. Potika, and S. Stefanakos,
  Resource Allocation Problems in Multifiber WDM Tree Networks,
  In Proceedings of 29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003), Jun 19 - 21 2003, Elspeet Netherlands, Lecture Notes in Computer Science 2880, pp. 218-229, Springer Verlag, 2003. (electronic edition)
  
• C. Nomikos, A. Pagourtzis, and S. Zachos,
  Minimizing Request Blocking in All-Optical Rings,
  In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 2003), Mar 30 - Apr 3 2003, San Francisco, CA, USA. (electronic edition)
  
• L. Gasieniec, A. Pagourtzis, and I. Potapov,
  Deterministic Communication in Radio Networks with Large Labels,
  In Proceedings of 10th European Symposium on Algorithms (ESA 2002), Sep 17-21, 2002, Rome, Lecture Notes in Computer Science 2641, pp. 512-524, Springer-Verlag. (electronic edition)
  
• A. Pagourtzis, I. Potapov, and W. Rytter,
  Observations on Parallel Computation of Transitive and Max-Closure Problems,
  In Proceedings of the 9th European PVM/MPI Conference (PVM/MPI 2002), Sep 29 - Oct 02, 2002, Linz, Austria, Lecture Notes in Computer Science 2474, pp. 217-225, Springer-Verlag. (electronic edition)
  
• A. Pagourtzis, P. Penna, K. Schlude, K. Steinhofel, D.S. Taylor, and P. Widmayer,
  Server Placements, Roman Domination and Other Dominating Set Variants,
  In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), Montreal, pp. 280-291, August 25-30, 2002.
  
• M. Cieliebak, S. Eidenbenz, A. Pagourtzis, and K. Schlude,
  Equal Sum Subsets: Complexity of Variations,
  ETH Zuerich Technical Report 370/2002, June 2002, 12 pages. (electronic edition)
  
• T. Erlebach, M. Gantenbein, D. Hurlimann, G. Neyer, A. Pagourtzis, P. Penna, K. Schlude, K. Steinhofel, D.S. Taylor, and P. Widmayer,
  On the Complexity of Train Assignment Problems,
  In Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC 2001), Dec 19-21, Christchurch, New Zealand, 2001, Lecture Notes in Computer Science 2223, pp. 390-402, Springer-Verlag (electronic edition)
  
• C. Nomikos, A. Pagourtzis, E. Potika, and S. Zachos, i
  Path Multi-Coloring in Weighted Graphs,
  In Proceedings of the 8th Panhellenic Conference on Informatics (PCI 2001), Vol. 1, pp. 178-186, Nicosia, Cyprus, Nov 8-10, 2001.
  
• A. Kiayias, A. Pagourtzis, K. Sharma, and S. Zachos,
  Path-order Complexity Classes,
  In Proceedings of the 8th Panhellenic Conference on Informatics (PCI 2001), Vol. 2, pp. 20-29, Nicosia, Cyprus, Nov 8-10, 2001.
  
• A. Pagourtzis, I. Potapov, and W. Rytter,
  PVM Computation of the Transitive Closure: The Dependency Graph Approach,
  In Proceedings of the 8th European PVM/MPI Conference (PVM/MPI 2001), Santorini/Thera, Greece, September 23-26, 2001, Lecture Notes in Computer Science 2131, pp. 249-256, Springer-Verlag. (electronic edition)
  
• B.S. Chlebus, L. Gasieniec, A. Lingas, and A.T. Pagourtzis,
  Oblivious Gossiping in ad-hoc Radio Networks,
  In Proceedings of the 5th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM'2001), Rome, Italy, July 21, 2001, pp. 44-51, ACM Press, NY, 2001. (electronic edition)
  
• A. Pagourtzis,
  On the Complexity of Hard Counting Problems with Easy Decision Version,
  In Proceedings of the 3rd Panhellenic Logic Symposium (PLS 2001), pp.21-29, Anogia, Crete, July 17-22, 2001.
  
• C. Nomikos, A. Pagourtzis, and S. Zachos,
  Routing and Path Multi-Coloring,
  Information Processing Letters, 80(5), pp. 249-256, Elsevier Science, 2001. (electronic edition)


• C. Nomikos, A. Pagourtzis, and S. Zachos,
  An Approximation Algorithm for w-Coloring Circular Arcs,
  In Fotiadis D.I. and Nikolopoulos S.D. (eds.), Advances in Informatics, pp. 231-238, ISBN 981-02-4192-5, World Scientific, 2000.
  
• A. Pagourtzis, K. Sharma and S. Zachos,
  Determining the Maximum Solution is Cook[1]-equivalent to Counting,
  In Fotiadis D.I. and Nikolopoulos S.D. (eds.), Advances in Informatics, pp. 239-247, ISBN 981-02-4192-5, World Scientific, 2000.
  
• C. Nomikos, A. Pagourtzis, and S. Zachos,
  An Approximation Algorithm for w-Coloring Circular Arcs,
  In Proceedings of the 7th Panhellenic Conference on Informatics (PCI '99), Ioannina, 1999, Vol. II, pp. 77-82.
  
• A. Pagourtzis, K. Sharma and S. Zachos,
  Determining the Maximum Solution is Cook[1]-equivalent to Counting,
  In Proceedings of the 7th Panhellenic Conference on Informatics (PCI '99), Ioannina, 1999, Vol. II, pp. 83-90.
  
• A. Kiayias, A. Pagourtzis, and S. Zachos,
  Cook Reductions Blur Structural Differences Between Functional Complexity Classes,
  In Proceedings of the 2nd Panhellenic Logic Symposium (PLS '99), pp. 132-137, Delphi, Jul 13-17, 1999. (electronic edition)
  
• A. Pagourtzis, K. Sharma and S. Zachos,
  Computation Trees: the Rightmost Accepting Path,
  In Proceedings of CTS Workshop on Combinatorics and Algorithms (CTS '98), Taiwan, pp. 124-135, Dec 21-23, 1998.
  
• A. Kiayias, A. Pagourtzis, K. Sharma and S. Zachos,
  The Complexity of Determining the Order of Solutions,
  In Proceedings of the First Southern Symposium on Computing (FSCC'98), http://pax.st.usm.edu/cmi/ fscc98_html/ authorfscc.html, Hattiesburg, Mississippi, US, Dec 4-5, 1998.
  
• A. Pagourtzis, K. Sharma and S. Zachos,
  Tree Models and Probabilistic Polynomial-Time Computations,
  In Proceedings of 4th Australasian Theory Symposium (CATS'98), DMTCS Series, 20(3), pp. 291-305, Springer-Verlag, Perth, Australia, Feb 2-3, 1998.
  
• C. Nomikos, A. Pagourtzis and S. Zachos,
  Efficient Coloring with Applications in Multi-wavelength Routing,
  In ICALP'97 Satellite Workshop on Algorithmic Aspects of Communication, Bologna, Italy, Jul 11-12, 1997.