• Ioannis Georgiadis, "Coordination Mechanisms for reducing the Price of Anarchy in Selfish Scheduling Games"
  • Andreas Göbel, "Complexity Dichotomies for Approximation of Counting Problems"
  • Thomas Zacharias, "Μη Διαλογικά Συστήματα Απόδειξης στην Κρυπτογραφία Ζευγμάτων και Εφαρμογές στις Ομαδικές Υπογραφές"
  • Paris Siminelakis, "Στρατηγικές "Επιρροής-Εκμετάλλευσης" στα Κοινωνικά Δίκτυα"
  • Alexandros Angelopoulos, "On the Variants of Thickness of a Graph, the Drawing Thickness of a Graph Drawing and Complexity"
  • Stelios Despotakis, "Complexity Dichotomies in Counting Problems"
  • Dimitris Sakavalas, "Secure Broadcast in Generic and Wireless Networks"
  • Markos Epitropou, "Externalities in Sponsored Search Auctions"
  • Antonis Antonopoulos, "Derandomization under Uniform Assuptions"


  • Christos Tzamos, "Truthful Mechanisms without Money"
  • Haris Angelidakis, "Approximation algorithms for Stochastic Combinatorial Optimization Problems"


  • Eleni Mpakali, "Randomness Extractors and Applications to Cryptography"
  • Ioannis Panageas, "Randomized Truthful Mechanisms"
  • Manos Thanos, "Online primal-dual algorithms for covering and packing problems"


  • Andreas Galanis, "Encoding probabilistically checkable proofs".
  • Paraschos Koutris, "Broadcasting and gossiping in radio networks".
  • Vassilis Syrganis, "Equilibria in congestion games: existence, complexity, and efficiency".
  • Giorgos Pierrakos, "Profit Maximization in Mechanism Design"


  • Andreas Göbel, "Complexity classes of counting problems".


  • Giorgos Pierrakos, "Games and selfish behavior in networks".
  • Sofia Karygianni, "#P: complexity and approximation techniques".


  • Anna Pappa, "Secure electronic voting".
  • Antonis Achilleos, "Descriptive complexity and optimization problems".
  • Aris Tentes, "Byzantine agreements and distributed computations".
  • Panagiotis Voulgaris, "An algebraic methodology for characterizing the tractability of constraint satisfaction problems".
  • Petros Mol, "Lattices and their applications to the RSA cryptosystem".
  • Valia Mitsou, "Distributed leader-election algorithms in synchronous networks".


  • Giannis Korkontzelos, "Paschool: an educational programming language for junior high school".
  • Kostas Tsaprounis, "Elliptic curves and cryptography".


  • Alexandros Tzannes, "Graph isomorphism and complexity classes".
  • Evangelos Bampas, "Algorithmic techniques in complexity theory".
  • Giorgos Amanatidis, "Probabilistically checkable proofs".
  • Giorgos Piliouras, "Game theory and complexity".
  • Ilias Diakonikolas, "Approximation algorithm design techniques based on linear programming".
  • Konstantinos Daskalakis, "The problem of existence of pure Nash equilibrium in graph games".
  • Spyros Antonakopoulos, "Online algorithms".
  • Vassilis Zikas, "Secure multiparty computations".


  • Christina Apergi, "Games and selfish routing".
  • Kostas Bimpikis, "Mechanism design: auctions and networks".
  • Nikos Tzevelekos, "Many-valued modal logics and applications in computer science".
  • Evangelos Tzannis, "Hybrid logic".


  • Stratis Ioannidis, "Routing and path coloring in all-optical networks".


  • Panagiotis Hilaris, "Rewriting systems and the combinator S".
  • Stavros Vassos, "Nonmonotonic logical approaches for solving the frame problem".