This page is under reconstruction.
For recent publications of CoReLab members please see their individual pages (links here). Most of these publications also appear in the DBLP bibliography server.
For earlier publications you may check the list below.

2013

  • Dimitris Fotakis, Christos Tzamos: Winner-imposing strategyproof mechanisms for multiple Facility Location games. Theor. Comput. Sci. 472: 90-103 (2013) (Electronic Edition)
  • Dimitris Fotakis, Christos Tzamos: Strategyproof facility location for concave cost functions. ACM Conference on Electronic Commerce 2013: 435-452 (Electronic Edition)
  • Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman: Enumerating subgraph instances using map-reduce. ICDE 2013: 62-73 (Electronic Edition)
  • Dimitris Fotakis, Christos Tzamos: On the Power of Deterministic Mechanisms for Facility Location Games. ICALP (1) 2013: 449-460 (Electronic Edition)
  • Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis: The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. FCT 2013: 171-182 (Electronic Edition)
  • Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis: Selfish Resource Allocation in Optical Networks. CIAC 2013: 25-36 (Electronic Edition)
  • Evangelos Bampas, Anissa Lamani, Franck Petit, Mathieu Valero: Self-Stabilizing Balancing Algorithm for Containment-Based Trees. SSS 2013: 191-205. (Electronic Edition)
  • Chris Litsas, Aris Pagourtzis, Dimitris Sakavalas: A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm. ADHOC-NOW 2013: 269-280 (Electronic Edition)
  • Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On swap-distance geometry of voting rules. AAMAS 2013: 383-390 (Electronic Edition)
  • Svetlana Obraztsova, Yair Zick, Edith Elkind: On manipulation in multi-winner elections based on scoring rules. AAMAS 2013: 359-366 (Electronic Edition)
  • Wen-Ju Cheng, Jim Cox, Stathis Zachos: Random Walks on Some Basic Classes of Digraphs. ICTAC 2013: 122-140 (Electronic Edition)
  • Dimitris Fotakis, Christos Tzamos: Strategy-Proof Facility Location for Concave Cost Functions. CoRR abs/1305.3333 (2013) (Electronic Edition)

2012

  • 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) (Electronic Edition)
  • Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos: Ordered coloring of grids and related graphs. Theor. Comput. Sci. 444: 40-51 (2012) (Electronic Edition)
  • Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis: Efficient methods for selfish network design. Theor. Comput. Sci. 448: 9-20 (2012) (Electronic Edition)
  • Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis: The Impact of Social Ignorance on Weighted Congestion Games. Theory Comput. Syst. 50(3): 559-578 (2012) (Electronic Edition)
  • Dimitris Fotakis, Epameinondas Sidiropoulos: A new multi-objective self-organizing optimization algorithm (MOSOA) for spatial optimization problems. Applied Mathematics and Computation 218(9): 5168-5180 (2012) (Electronic Edition)
  • Dimitris Fotakis, Paris Siminelakis: On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities. WINE 2012: 270-283 (Electronic Edition)
  • Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis: On the Hardness of Network Design for Bottleneck Routing Games. SAGT 2012: 156-167 (Electronic Edition)
  • Dimitris Fotakis, Paraschos Koutris: Online Sum-Radii Clustering. MFCS 2012: 395-406 (Electronic Edition)
  • Svetlana Obraztsova, Edith Elkind: Optimal manipulation of voting rules. AAMAS 2012: 619-626 (Electronic Edition)
  • Svetlana Obraztsova, Edith Elkind: Optimal Manipulation of Voting Rules. AAAI 2012 (Electronic Edition)
  • Evangelos Bampas, Anissa Lamani, Franck Petit, Mathieu Valero: Self-Stabilizing Balancing Algorithm for Containment-Based Trees. CoRR abs/1212.3418 (2012) (Electronic Edition)
  • Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman: Enumerating Subgraph Instances Using Map-Reduce. CoRR abs/1208.0615 (2012) (Electronic Edition)
  • Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis: On the Hardness of Network Design for Bottleneck Routing Games. CoRR abs/1207.5212 (2012) (Electronic Edition)
  • Dimitris Fotakis, Christos Tzamos: On the Power of Deterministic Mechanisms for Facility Location Games. CoRR abs/1207.0935 (2012) (Electronic Edition)

2011

  • Evangelos Bampas, Aris Pagourtzis, Katerina Potika: An experimental study of maximum profit wavelength assignment in WDM rings. Networks 57(3): 285-293 (2011) (Electronic Edition)
  • Dimitris Fotakis: Memoryless facility location in one pass. ACM Transactions on Algorithms 7(4): 49 (2011) (Electronic Edition)
  • Dimitris Fotakis: Online and incremental algorithms for facility location. SIGACT News 42(1): 97-131 (2011) (Electronic Edition)
  • Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti: Network Verification via Routing Table Queries. SIROCCO 2011: 270-281 (Electronic Edition)
  • Dimitris Fotakis, Piotr Krysta, Orestis Telelis: Externalities among Advertisers in Sponsored Search. SAGT 2011: 105-116 (Electronic Edition)
  • Paraschos Koutris, Aris Pagourtzis: Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. CATS 2011: 161-168 (Electronic Edition)
  • Dimitris Fotakis, Paris Siminelakis: On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities. CoRR abs/1110.1894 (2011) (Electronic Edition)
  • Dimitris Fotakis, Paraschos Koutris: Online Sum-Radii Clustering. CoRR abs/1109.5325 (2011) (Electronic Edition)

2010

  • Dimitris Fotakis: Stackelberg Strategies for Atomic Congestion Games. Theory Comput. Syst. 47(1): 218-249 (2010) (Electronic Edition)
  • Dimitris Fotakis: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy. Theory Comput. Syst. 47(1): 113-136 (2010) (Electronic Edition)
  • Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis: Atomic Congestion Games: Fast, Myopic and Concurrent. Theory Comput. Syst. 47(1): 38-59 (2010) (Electronic Edition)
  • Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Area-Feature Boundary Labeling. Comput. J. 53(6): 827-841 (2010) (Electronic Edition)
  • Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. DISC 2010: 297-311. (Electronic Edition)
  • Dimitris Fotakis, Christos Tzamos: Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games. WINE 2010: 234-245. (Electronic Edition)
  • Dimitris Fotakis, George Karakostas, Stavros G. Kolliopoulos: On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. SAGT 2010: 162-173 (Electronic Edition)
  • Paraschos Koutris, Aris Pagourtzis: Brief announcement: k-shot distributed broadcasting in radio networks. PODC 2010: 77-78 (Electronic Edition)
  • Victor Kyritsis, Paraskevas V. Lekeas, Dora Souliou, Foto N. Afrati: A New Framework for Join Product Skew. RED 2010: 1-10 (Electronic Edition)
  • Tatiana Tambouratzis, Miltiadis S. Chalikias, Dora Souliou, Andreas Gregoriades: Dimensionality Reduction of Accident Databases for Minimal Tradeoff in Prediction Accuracy. IKE 2010: 64-71
  • Tatiana Tambouratzis, Dora Souliou, Miltiadis S. Chalikias, Andreas Gregoriades: Combining probabilistic neural networks and decision trees for maximally accurate and efficient accident prediction. IJCNN 2010: 1-8 (Electronic Edition)
  • Foto N. Afrati, Victor Kyritsis, Paraskevas V. Lekeas, Dora Souliou: A New Framework for Join Product Skew. CoRR abs/1005.5732 (2010) (Electronic Edition)

2009

  • Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36): 3305-3326 (2009). (Electronic Edition)
  • 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). (Electronic Edition)
  • Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis: The impact of social ignorance on weighted congestion games. WINE, LNCS, Springer, 2009. (to appear)
  • Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis: Efficient methods for selfish network design. ICALP (track C), LNCS 5556, Springer, 2009, pp. 459-471. (Electronic Edition)
  • Vassilis Zikas, Sarah Hauser, Ueli M. Maurer: Realistic failures in secure multi-party computation. TCC, LNCS 5444, Springer, 2009, pp. 274-293. (Electronic Edition)
  • Evangelos Bampas, Leszek Gąsieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik: Robustness of the rotor-router mechanism. OPODIS, LNCS 5923, Springer, 2009, pp. 345-358. (Electronic Edition)
  • Evangelos Bampas, Leszek Gąsieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Euler tour lock-in problem in the rotor-router model. DISC, LNCS 5805, Springer, 2009, pp. 423-435. (Electronic Edition)
  • Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos: Ordered coloring grids and related graphs. SIROCCO, LNCS, Springer, 2009. (to appear)
  • Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasileios Syrgkanis: Colored resource allocation games. CTW, École Polytechnique and CNAM, 2009, pp. 68-72.
  • Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes: On the connection between interval size functions and path counting. TAMC, LNCS 5532, Springer, 2009, pp. 108-117. (Electronic Edition)

2008

  • Martin Hirt, Ueli M. Maurer, Vassilis Zikas: MPC vs. SFE: Unconditional and computational security. ASIACRYPT, LNCS 5350, Springer, 2008, pp. 1-18. (Electronic Edition)
  • Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli M. Maurer, Vassilis Zikas: MPC vs. SFE: Perfect security in a unified corruption model. TCC, LNCS 4948, Springer, 2008, pp. 231-250. (Electronic Edition)
  • Michael Lampis, Georgia Kaouri, Valia Mitsou: On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. ISAAC 2008, LNCS 5369, pp. 220-231, 2008. (Electronic Edition)
  • Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika: On a non-cooperative model for wavelength assignment in multifiber optical networks. ISAAC 2008, LNCS 5369, pp. 159-170, 2008. (Electronic Edition)
  • Evangelos Bampas, Aris Pagourtzis, Katerina Potika: Maximum profit wavelength assignment in WDM rings. In G. Righini, editor, Proceedings of CTW 2008 – 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp. 35–38, 2008.

2007

  • Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik: Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47(1): 97-117 (2007). (Electronic Edition)
  • Aris Pagourtzis, Katerina Potika, Stathis Zachos: Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007). (Electronic Edition)
  • Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos: Maximizing the guarded boundary of an Art Gallery is APX-complete. Comput. Geom. 38(3): 170-180 (2007). (Electronic Edition)
  • Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco: Hardness and approximation results for Black Hole Search in arbitrary networks. Theor. Comput. Sci. 384(2-3): 201-221 (2007). (Electronic Edition)
  • Euripides Markou, Andrzej Pelc: Efficient Exploration of Faulty Trees. Theory Comput. Syst. 40(3): 225-247 (2007). (Electronic Edition)
  • Ioannis Milis, Aris Pagourtzis, Katerina Potika: Selfish Routing and Path Coloring in All-Optical Networks. CAAN 2007: 71-84. (Electronic Edition)
  • Christos Nomikos, Aris Pagourtzis, Stathis Zachos: Randomized and Approximation Algorithms for Blue-Red Matching. MFCS 2007: 715-725. (Electronic Edition)
  • Panagiotis Cheilaris and Stathis Zachos, Path-related vertex colorings of graphs, in Proceedings of 11th Panhellenic Conference on Informatics (PCI 2007), Patras, Greece, May 18-20 2007, vol. A, pp. 607-616. (Electronic Edition)
  • Michael Lampis and Valia Mitsou, Generalizing Alcuin's River Crossing Problem, in Proceedings of 11th Panhellenic Conference on Informatics (PCI 2007), Patras, Greece, May 18-20 2007, vol. A, pp. 617-626. (Electronic Edition)
  • Evangelos Bampas, Aris Pagourtzis, and Katerina Potika, Maximum Request Satisfaction in WDM Rings: Algorithms and Experiments, in Proceedings of 11th Panhellenic Conference on Informatics (PCI 2007), Patras, Greece, May 18-20 2007, vol. A, pp. 627-642. (Electronic Edition)
  • Georgia Kaouri, Aris Pagourtzis, and Katerina Potika, Conflict-free Coloring for Connected Subgraphs of Trees and Trees of Rings, in Proceedings of 11th Panhellenic Conference on Informatics (PCI 2007), Patras, Greece, May 18-20 2007, vol. A, pp. 643-650. (Electronic Edition)
  • Aristeidis Tentes, An Optimal Monte Carlo Type Byzantine Agreement Protocol, in Proceedings of 11th Panhellenic Conference on Informatics (PCI 2007), Patras, Greece, May 18-20 2007, vol. B, pp. 131-140. (Electronic Edition)
  • Michael Lampis and Valia Mitsou, The Ferry Cover Problem, in Proceedings of Fourth International Conference on Fun With Algorithms (FUN 2007), Castiglioncello, Italy, June 3-6 2007. Lecture Notes in Computer Science 4475, pp. 227-239, Springer 2007. (Electronic Edition)

2006

  • A. Pagourtzis, K. Potika, and S. Zachos, Path Multicoloring using a Minimum Number of Colors, to appear in journal Computing, Springer-Verlag.
  • 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)
  • Petros Potikas, Panos Rondogiannis and Manolis Gergatsoulis, A Value-Propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs, Fundamenta Informaticae, Vol. 72(4), pages 485-527, 2006.
  • Michael A. Bekos, Michael Kaufmann, Katerina Potika and Antonios Symvonis, Polygons Labelling of Minimum Leader Length, Proceedings of Asia Pacific Symposium on Information Visualization 2006, Australian Computer Society Inc., Volume 60 of the Conference in Research and Practice in Information Technology (CRPIT) Series.pp. 15--21.
  • Evangelos Bampas, Georgia Kaouri, Michael Lampis, and Aris Pagourtzis. Periodic Metro Scheduling. In Riko Jacob and Matthias Müller-Hannemann, editors, ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, number 06002 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. <http://drops.dagstuhl.de/opus/volltexte/2006/684> (Electronic Edition)
  • Michael Lampis, Kyriakos G. Ginis, Nikolaos S. Papaspyrou. Quantum Data and Control Made Easier. Workshop for Quantum Programming Languages, Oxford 2006. (Electronic Edition)

2005

  • F. Coenen, P. Leng, A. Pagourtzis, D. Souliou and W. Rytter, Techniques for Faster Generation of Frequent Itemsets Using Interim Support Trees, to appear in Proceedings of the 25th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (AI 2005), Dec 13 -- 14, 2005, Cambridge, UK. To be published by Springer-Verlag.
  • 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.
  • Katerina Potika, Maximizing the Number of Connections in Multifiber WDM chain, ring and star networks Proceedings of the Networking 2005, LNCS 3462, pp. 1465-1470, Waterloo, Canada, May 2-6.

2004

  • C. Nomikos, A. Pagourtzis, K. Potika, and S. Zachos, Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks, Proceedings of the Third IFIP-TC6 Networking Conference (Networking 2004), Athens, Greece, May 9-14, 2004, pp. 150-161.(Electronic Edition)
  • Petros Potikas, Manolis Gergatsoulis, Panos Rondogiannis, Using Branching-Time Logic to Optimize an Extended Class of Datalog Queries. In Proceedings of 3rd Hellenic Conference on Artificial Intelligence, SETN'04, Proceedings (Companion Volume), pages 197-206, Samos, Greece, 5-8 May, 2004.