Demetres Christofides

27 papers Journal 26Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Powers of Rational Matrices Revisited.
Am. Math. Mon.
Demetres Christofides
2018 J jnl
A fast algorithm for the gas station problem.
Inf. Process. Lett.
Kleitos Papadopoulos, Demetres Christofides
2017 J jnl
A fast algorithm for the gas station problem.
CoRR
Kleitos Papadopoulos, Demetres Christofides
2017 J jnl
Graph Guessing Games and Non-Shannon Information Inequalities.
IEEE Trans. Inf. Theory
Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Emil R. Vaughan, Søren Riis
2016 J jnl
First-Order Convergence and Roots.
Comb. Probab. Comput.
Demetres Christofides, Daniel Král'
2014 J jnl
First order convergence and roots.
CoRR
Demetres Christofides, Daniel Král
2014 J jnl
Graph Guessing Games and non-Shannon Information Inequalities.
CoRR
Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan
2014 J jnl
Hamilton cycles in dense vertex-transitive graphs.
J. Comb. Theory B
Demetres Christofides, Jan Hladký, András Máthé
2014 J jnl
The asymptotic complexity of matrix reduction over finite fields.
CoRR
Demetres Christofides
2014 J jnl
The range of thresholds for diameter 2 in random Cayley graphs.
Eur. J. Comb.
Demetres Christofides, Klas Markström
2014 J jnl
The thresholds for diameter 2 in random Cayley graphs.
Random Struct. Algorithms
Demetres Christofides, Klas Markström
2013 J jnl
A Note on Hitting Maximum and Maximal Cliques With a Stable Set.
J. Graph Theory
Demetres Christofides, Katherine Edwards, Andrew D. King
2013 J jnl
An Approximate Vertex-Isoperimetric Inequality for r-sets.
Electron. J. Comb.
Demetres Christofides, David Ellis, Peter Keevash
2013 — conf
Multiple unicasts, graph guessing games, and non-Shannon inequalities.
NetCod
Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan
2012 J jnl
Edge-disjoint Hamilton cycles in graphs.
J. Comb. Theory B
Demetres Christofides, Daniela Kühn, Deryk Osthus
2012 J jnl
Finding Hamilton cycles in robustly expanding digraphs.
J. Graph Algorithms Appl.
Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus
2012 J jnl
Random Latin square graphs.
Random Struct. Algorithms
Demetres Christofides, Klas Markström
2011 J jnl
A note on hitting maximum and maximal cliques with a stable set
CoRR
Demetres Christofides, Katherine Edwards, Andrew D. King
2011 J jnl
A proof of the dense version of Lovász conjecture.
Electron. Notes Discret. Math.
Demetres Christofides, Jan Hladký, András Máthé
2011 J jnl
The Guessing Number of Undirected Graphs.
Electron. J. Comb.
Demetres Christofides, Klas Markström
2010 J jnl
A Semiexact Degree Condition for Hamilton Cycles in Digraphs.
SIAM J. Discret. Math.
Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus
2010 J jnl
Influences of monotone Boolean functions.
Discret. Math.
Demetres Christofides
2009 J jnl
On randomized algorithms for the majority problem.
Discret. Appl. Math.
Demetres Christofides
2009 J jnl
Randomized algorithms for the majority problem.
Electron. Notes Discret. Math.
Demetres Christofides
2008 J jnl
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales.
Random Struct. Algorithms
Demetres Christofides, Klas Markström
2007 J jnl
Induced lines in Hales-Jewett cubes.
J. Comb. Theory A
Demetres Christofides
2006 J jnl
Pair lengths of product graphs.
Discret. Math.
Demetres Christofides