A Note on the Non-Colorability Threshold of a Random Graph. - Alexis C. Kaporis; Lefteris M. Kirousis; Yannis C. Stamatiou (Electron. J. Comb., 2000)

Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. - Alexis C. Kaporis; Lefteris M. Kirousis; Yannis C. Stamatiou; Malvina Vamvakari; Michele Zito 001 (ICTCS, 2001)

Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval. - Alexis C. Kaporis; Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Yannis C. Stamatiou; Elias C. Stavropoulos (Comput. J., 2001)

Selecting Complementary Pairs of Literals. - Alexis C. Kaporis; Lefteris M. Kirousis; Efthimios G. Lalas (Electron. Notes Discret. Math., 2003)

Οριακά φαινόμενα αλλαγής φάσης σε συνδυαστικά προβλήματα - Alexis C. Kaporis (2003)

5-Regular Graphs are 3-Colorable with Positive Probability. - Josep Díaz; G. Grammatikopoulos; Alexis C. Kaporis; Lefteris M. Kirousis; Xavier Pérez-Giménez; Dionisios G. Sotiropoulos (ESA, 2005)

Experimental Results for Stackelberg Scheduling Strategies. - Alexis C. Kaporis; Lefteris M. Kirousis; Efpraxia I. Politopoulou; Paul G. Spirakis (WEA, 2005)

The Price of Optimum in Stackelberg Games - Alexis C. Kaporis; Efpraxia I. Politopoulou; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 2005)

Proving Conditional Randomness using The Principle of Deferred Decisions. - Alexis C. Kaporis; Lefteris M. Kirousis; Yannis C. Stamatiou (Computational Complexity and Statistical Physics, 2006)

Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold. - Alexis C. Kaporis; Lefteris M. Kirousis; Elias C. Stavropoulos (ESA, 2006)

The probabilistic analysis of a greedy satisfiability algorithm. - Alexis C. Kaporis; Lefteris M. Kirousis; Efthimios G. Lalas (Random Struct. Algorithms, 2006)

The unsatisfiability threshold revisited. - Alexis C. Kaporis; Lefteris M. Kirousis; Yannis C. Stamatiou; Malvina Vamvakari; Michele Zito 001 (Discret. Appl. Math., 2007)

Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games. - Dimitris Kalles; Alexis C. Kaporis; Paul G. Spirakis (WEA, 2008)

Emerge-Sort: Converging to Ordered Sequences by Simple Local Operators - Dimitris Kalles; Alexis C. Kaporis (CoRR, 2008)

Thresholds of Random k-Sat. - Alexis C. Kaporis; Lefteris M. Kirousis (Encyclopedia of Algorithms, 2008)

Stackelberg Games: The Price of Optimum. - Alexis C. Kaporis; Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. - Gerth Stølting Brodal; Alexis C. Kaporis; Spyros Sioutas; Konstantinos Tsakalidis; Kostas Tsichlas (ISAAC, 2009)

On the chromatic number of a random 5-regular graph. - Josep Díaz; Alexis C. Kaporis; G. D. Kemkes; Lefteris M. Kirousis; Xavier Pérez-Giménez; Nicholas C. Wormald (J. Graph Theory, 2009)

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. - Alexis C. Kaporis; Paul G. Spirakis (Theor. Comput. Sci., 2009)

Efficient processing of 3-sided range queries with probabilistic guarantees. - Alexis C. Kaporis; Apostolos N. Papadopoulos; Spyros Sioutas; Konstantinos Tsakalidis; Kostas Tsichlas (ICDT, 2010)

ISB-tree: A new indexing scheme with efficient expected behaviour. - Alexis C. Kaporis; Christos Makris 001; George Mavritsakis; Spyros Sioutas; Athanasios K. Tsakalidis; Kostas Tsichlas; Christos D. Zaroliagis (J. Discrete Algorithms, 2010)

Atomic Congestion Games: Fast, Myopic and Concurrent. - Dimitris Fotakis 001; Alexis C. Kaporis; Paul G. Spirakis (Theory Comput. Syst., 2010)

Selfish splittable flows and NP-completeness. - Alexis C. Kaporis; Paul G. Spirakis (Comput. Sci. Rev., 2011)

The Impact of Social Ignorance on Weighted Congestion Games. - Dimitris Fotakis 001; Vasilis Gkatzelis; Alexis C. Kaporis; Paul G. Spirakis (Theory Comput. Syst., 2012)

Efficient methods for selfish network design. - Dimitris Fotakis 001; Alexis C. Kaporis; Paul G. Spirakis (Theor. Comput. Sci., 2012)

Improved Bounds for Finger Search on a RAM. - Alexis C. Kaporis; Christos Makris 001; Spyros Sioutas; Athanasios K. Tsakalidis; Kostas Tsichlas; Christos D. Zaroliagis (Algorithmica, 2013)

Dynamic 3-sided planar range queries with expected doubly-logarithmic time. - Gerth Stølting Brodal; Alexis C. Kaporis; Apostolos N. Papadopoulos; Spyros Sioutas; Konstantinos Tsakalidis; Kostas Tsichlas (Theor. Comput. Sci., 2014)

On the hardness of network design for bottleneck routing games. - Dimitris Fotakis 001; Alexis C. Kaporis; Thanasis Lianeas; Paul G. Spirakis (Theor. Comput. Sci., 2014)

Thresholds of Random k-Sat. - Alexis C. Kaporis; Lefteris M. Kirousis (Encyclopedia of Algorithms, 2016)

Stackelberg Games: The Price of Optimum. - Alexis C. Kaporis; Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

Resolving Braess's Paradox in Random Networks. - Dimitris Fotakis 001; Alexis C. Kaporis; Thanasis Lianeas; Paul G. Spirakis (Algorithmica, 2017)

Random input helps searching predecessors. - Djamal Belazzougui; Alexis C. Kaporis; Paul G. Spirakis (GASCom, 2018)

Dynamic Interpolation Search revisited. - Alexis C. Kaporis; Christos Makris 001; Spyros Sioutas; Athanasios K. Tsakalidis; Kostas Tsichlas; Christos D. Zaroliagis (Inf. Comput., 2020)