Most cited
This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.
- Cited by 24
Asymptotic Enumeration of Constellations and Related Families of Maps on Orientable Surfaces
-
- Published online by Cambridge University Press:
- 01 July 2009, pp. 477-516
-
- Article
- Export citation
- Cited by 24
Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
-
- Published online by Cambridge University Press:
- 12 July 2002, pp. 249-261
-
- Article
- Export citation
- Cited by 24
List Total Colourings of Graphs
-
- Published online by Cambridge University Press:
- 01 June 1998, pp. 181-188
-
- Article
- Export citation
- Cited by 24
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
-
- Published online by Cambridge University Press:
- 01 December 1997, pp. 397-433
-
- Article
- Export citation
- Cited by 24
Robust Analysis of Preferential Attachment Models with Fitness
-
- Published online by Cambridge University Press:
- 24 February 2014, pp. 386-411
-
- Article
- Export citation
- Cited by 24
A Simple SVD Algorithm for Finding Hidden Partitions
- Part of:
-
- Published online by Cambridge University Press:
- 09 October 2017, pp. 124-140
-
- Article
- Export citation
- Cited by 24
Unit Distances in Three Dimensions
-
- Published online by Cambridge University Press:
- 25 April 2012, pp. 597-610
-
- Article
- Export citation
- Cited by 24
Random Graphs from a Minor-Closed Class
-
- Published online by Cambridge University Press:
- 01 July 2009, pp. 583-599
-
- Article
- Export citation
- Cited by 23
Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs
-
- Published online by Cambridge University Press:
- 16 December 2010, pp. 173-211
-
- Article
- Export citation
- Cited by 23
Random Lifts of Graphs: Edge Expansion
-
- Published online by Cambridge University Press:
- 07 April 2006, pp. 317-332
-
- Article
- Export citation
- Cited by 23
Graphs, Links, and Duality on Surfaces
-
- Published online by Cambridge University Press:
- 29 September 2010, pp. 267-287
-
- Article
- Export citation
- Cited by 23
Ramsey Games Against a One-Armed Bandit
-
- Published online by Cambridge University Press:
- 03 December 2003, pp. 515-545
-
- Article
- Export citation
- Cited by 23
Singularity Analysis Via the Iterated Kernel Method
-
- Published online by Cambridge University Press:
- 10 June 2014, pp. 861-888
-
- Article
- Export citation
- Cited by 23
Extremal Numbers for Odd Cycles
-
- Published online by Cambridge University Press:
- 01 December 2014, pp. 641-645
-
- Article
- Export citation
- Cited by 22
Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections
-
- Published online by Cambridge University Press:
- 22 June 2009, pp. 61-85
-
- Article
- Export citation
- Cited by 22
An Extension of Foster's Network Theorem
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 421-427
-
- Article
- Export citation
- Cited by 22
On Ramsey Numbers of Sparse Graphs
-
- Published online by Cambridge University Press:
- 03 December 2003, pp. 627-641
-
- Article
- Export citation
- Cited by 22
Asymptotics of Multivariate Sequences II: Multiple Points of the Singular Variety
-
- Published online by Cambridge University Press:
- 24 September 2004, pp. 735-761
-
- Article
- Export citation
- Cited by 22
The Satisfiability Threshold for k-XORSAT
- Part of:
-
- Published online by Cambridge University Press:
- 31 July 2015, pp. 236-268
-
- Article
- Export citation
- Cited by 22
On the Independent Domination Number of Random Regular Graphs
-
- Published online by Cambridge University Press:
- 07 June 2006, pp. 513-522
-
- Article
- Export citation