default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDemetres Christofides
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j20]Kleitos Papadopoulos
, Demetres Christofides:
A fast algorithm for the gas station problem. Inf. Process. Lett. 131: 55-59 (2018)- 2017
- [j19]Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Emil R. Vaughan, Søren Riis:
Graph Guessing Games and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory 63(7): 4257-4267 (2017) - [i5]Kleitos Papadopoulos, Demetres Christofides:
A fast algorithm for the gas station problem. CoRR abs/1706.00195 (2017) - 2016
- [j18]Demetres Christofides, Daniel Král':
First-Order Convergence and Roots. Comb. Probab. Comput. 25(2): 213-221 (2016) - 2014
- [j17]Demetres Christofides, Klas Markström:
The range of thresholds for diameter 2 in random Cayley graphs. Eur. J. Comb. 35: 141-154 (2014) - [j16]Demetres Christofides, Jan Hladký, András Máthé:
Hamilton cycles in dense vertex-transitive graphs. J. Comb. Theory B 109: 34-72 (2014) - [j15]Demetres Christofides, Klas Markström:
The thresholds for diameter 2 in random Cayley graphs. Random Struct. Algorithms 45(2): 218-235 (2014) - [i4]Demetres Christofides, Daniel Král:
First order convergence and roots. CoRR abs/1403.3049 (2014) - [i3]Demetres Christofides:
The asymptotic complexity of matrix reduction over finite fields. CoRR abs/1406.5826 (2014) - [i2]Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan:
Graph Guessing Games and non-Shannon Information Inequalities. CoRR abs/1410.8349 (2014) - 2013
- [j14]Demetres Christofides, David Ellis, Peter Keevash:
An Approximate Vertex-Isoperimetric Inequality for r-sets. Electron. J. Comb. 20(4): 15 (2013) - [j13]Demetres Christofides, Katherine Edwards, Andrew D. King:
A Note on Hitting Maximum and Maximal Cliques With a Stable Set. J. Graph Theory 73(3): 354-360 (2013) - [c1]Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan:
Multiple unicasts, graph guessing games, and non-Shannon inequalities. NetCod 2013: 1-6 - 2012
- [j12]Demetres Christofides, Daniela Kühn, Deryk Osthus:
Edge-disjoint Hamilton cycles in graphs. J. Comb. Theory B 102(5): 1035-1060 (2012) - [j11]Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus:
Finding Hamilton cycles in robustly expanding digraphs. J. Graph Algorithms Appl. 16(2): 335-358 (2012) - [j10]Demetres Christofides, Klas Markström:
Random Latin square graphs. Random Struct. Algorithms 41(1): 47-65 (2012) - 2011
- [j9]Demetres Christofides, Klas Markström:
The Guessing Number of Undirected Graphs. Electron. J. Comb. 18(1) (2011) - [j8]Demetres Christofides, Jan Hladký, András Máthé:
A proof of the dense version of Lovász conjecture. Electron. Notes Discret. Math. 38: 285-290 (2011) - [i1]Demetres Christofides, Katherine Edwards, Andrew D. King:
A note on hitting maximum and maximal cliques with a stable set. CoRR abs/1109.3092 (2011) - 2010
- [j7]Demetres Christofides:
Influences of monotone Boolean functions. Discret. Math. 310(8): 1401-1402 (2010) - [j6]Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus:
A Semiexact Degree Condition for Hamilton Cycles in Digraphs. SIAM J. Discret. Math. 24(3): 709-756 (2010)
2000 – 2009
- 2009
- [j5]Demetres Christofides:
On randomized algorithms for the majority problem. Discret. Appl. Math. 157(7): 1481-1485 (2009) - [j4]Demetres Christofides:
Randomized algorithms for the majority problem. Electron. Notes Discret. Math. 34: 453-457 (2009) - 2008
- [j3]Demetres Christofides, Klas Markström:
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. Random Struct. Algorithms 32(1): 88-100 (2008) - 2007
- [j2]Demetres Christofides:
Induced lines in Hales-Jewett cubes. J. Comb. Theory A 114(5): 906-918 (2007) - 2006
- [j1]Demetres Christofides:
Pair lengths of product graphs. Discret. Math. 306(17): 2111-2114 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
