Pair lengths of product graphs. - Demetres Christofides (Discret. Math., 2006)

Induced lines in Hales-Jewett cubes. - Demetres Christofides (J. Comb. Theory A, 2007)

Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. - Demetres Christofides; Klas Markström (Random Struct. Algorithms, 2008)

On randomized algorithms for the majority problem. - Demetres Christofides (Discret. Appl. Math., 2009)

Influences of monotone Boolean functions. - Demetres Christofides (Discret. Math., 2010)

A Semiexact Degree Condition for Hamilton Cycles in Digraphs. - Demetres Christofides; Peter Keevash; Daniela Kühn; Deryk Osthus (SIAM J. Discret. Math., 2010)

The Guessing Number of Undirected Graphs. - Demetres Christofides; Klas Markström (Electron. J. Comb., 2011)

A proof of the dense version of Lovász conjecture. - Demetres Christofides; Jan Hladký; András Máthé (Electron. Notes Discret. Math., 2011)

Edge-disjoint Hamilton cycles in graphs. - Demetres Christofides; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2012)

Finding Hamilton cycles in robustly expanding digraphs. - Demetres Christofides; Peter Keevash; Daniela Kühn; Deryk Osthus (J. Graph Algorithms Appl., 2012)

Random Latin square graphs. - Demetres Christofides; Klas Markström (Random Struct. Algorithms, 2012)

Multiple unicasts, graph guessing games, and non-Shannon inequalities. - Rahil Baber; Demetres Christofides; Ntah Ahn Dang; Søren Riis; Emil R. Vaughan (NetCod, 2013)

An Approximate Vertex-Isoperimetric Inequality for r-sets. - Demetres Christofides; David Ellis; Peter Keevash (Electron. J. Comb., 2013)

A Note on Hitting Maximum and Maximal Cliques With a Stable Set. - Demetres Christofides; Katherine Edwards; Andrew D. King (J. Graph Theory, 2013)

The asymptotic complexity of matrix reduction over finite fields. - Demetres Christofides (CoRR, 2014)

The range of thresholds for diameter 2 in random Cayley graphs. - Demetres Christofides; Klas Markström (Eur. J. Comb., 2014)

Hamilton cycles in dense vertex-transitive graphs. - Demetres Christofides; Jan Hladký; András Máthé (J. Comb. Theory B, 2014)

The thresholds for diameter 2 in random Cayley graphs. - Demetres Christofides; Klas Markström (Random Struct. Algorithms, 2014)

First-Order Convergence and Roots. - Demetres Christofides; Daniel Král' (Comb. Probab. Comput., 2016)

Graph Guessing Games and Non-Shannon Information Inequalities. - Rahil Baber; Demetres Christofides; Ntah Ahn Dang; Emil R. Vaughan; Søren Riis (IEEE Trans. Inf. Theory, 2017)

A fast algorithm for the gas station problem. - Kleitos Papadopoulos; Demetres Christofides (Inf. Process. Lett., 2018)

Powers of Rational Matrices Revisited. - Demetres Christofides (Am. Math. Mon., 2025)