Probabilistic satisfiability. - George F. Georgakopoulos; Dimitris J. Kavvadias; Christos H. Papadimitriou (J. Complex., 1988)

General Splay: A Basic Theory and Calculus. - George F. Georgakopoulos; David J. McClurkin (ISAAC, 1999)

Sphendamnoe: A Proof that k-Splay Fails to Achieve logkN Behaviour. - David J. McClurkin; George F. Georgakopoulos (Panhellenic Conference on Informatics, 2001)

Precedence Constrained Scheduling: A Case in P. - Kostas Politopoulos; George F. Georgakopoulos; Panayotis Tsanakas (Comput. J., 2001)

Nash equilibria as a fundamental issue concerning network-switches design. - George F. Georgakopoulos (ICC, 2004)

Generalized Template Splay: A Basic Theory and Calculus. - George F. Georgakopoulos; David J. McClurkin (Comput. J., 2004)

Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees. - George F. Georgakopoulos (J. Algorithms, 2004)

How to Splay for loglog N-Competitiveness. - George F. Georgakopoulos (WEA, 2005)

On the Synthetic Generation of Semantic Web Schemas. - Yannis Theoharis; George F. Georgakopoulos; Vassilis Christophides (SWDB-ODBIS, 2007)

MAX-DENSITY Revisited: a Generalization and a More Efficient Algorithm. - George F. Georgakopoulos; Kostas Politopoulos (Comput. J., 2007)

Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying. - George F. Georgakopoulos (Inf. Process. Lett., 2008)

Buffered cross-bar switches, revisited: design steps, proofs and simulations towards optimal rate and minimum buffer memory. - George F. Georgakopoulos (IEEE/ACM Trans. Netw., 2008)

Nash equilibria in all-optical networks. - George F. Georgakopoulos; Dimitris J. Kavvadias; Leonidas G. Sioutis (Discret. Math., 2009)

PoweRGen: A power-law based generator of RDFS schemas. - Yannis Theoharis; George F. Georgakopoulos; Vassilis Christophides (Inf. Syst., 2012)