 | 2010 |
|---|
| 69 |       | Amin Coja-Oghlan,
Colin Cooper,
Alan Frieze:
An Efficient Sparse Regularity Concept.
SIAM J. Discrete Math. 23(4): 2000-2034 (2010) |
| 2009 |
|---|
| 68 | | Colin Cooper,
Andrew R. A. McGrae,
Michele Zito:
Martingales on Trees and the Empire Chromatic Number of Random Trees.
FCT 2009: 74-83 |
| 67 | | Colin Cooper,
Alan M. Frieze,
Tomasz Radzik:
Multiple Random Walks and Interacting Particle Systems.
ICALP (2) 2009: 399-410 |
| 66 | | Colin Cooper,
David Ilcinkas,
Ralf Klasing,
Adrian Kosowski:
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.
ICALP (2) 2009: 411-422 |
| 65 | | Colin Cooper,
Martin E. Dyer,
Andrew J. Handley:
The flip markov chain and a randomising P2P protocol.
PODC 2009: 141-150 |
| 64 | | Amin Coja-Oghlan,
Colin Cooper,
Alan M. Frieze:
An efficient sparse regularity concept.
SODA 2009: 207-216 |
| 63 | | Colin Cooper,
Alan M. Frieze:
The cover time of random geometric graphs.
SODA 2009: 48-57 |
| 62 | | Colin Cooper,
Michele Zito:
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm.
Discrete Applied Mathematics 157(9): 2010-2014 (2009) |
| 61 | | Colin Cooper,
Alan M. Frieze:
Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439.
Random Struct. Algorithms 34(2): 300-304 (2009) |
| 60 | | Colin Cooper,
Alan Frieze,
Tomasz Radzik:
Multiple Random Walks in Random Regular Graphs.
SIAM J. Discrete Math. 23(4): 1738-1761 (2009) |
| 59 | | Petra Berenbrink,
Colin Cooper,
Zengjian Hu:
Energy efficient randomised communication in unknown AdHoc networks.
Theor. Comput. Sci. 410(27-29): 2549-2561 (2009) |
| 2008 |
|---|
| 58 | | Colin Cooper,
Alan M. Frieze:
Random Walks on Random Graphs.
NanoNet 2008: 95-106 |
| 57 | | Colin Cooper,
Ralf Klasing,
Tomasz Radzik:
Locating and Repairing Faults in a Network with Mobile Agents.
SIROCCO 2008: 20-32 |
| 56 | | Colin Cooper,
Alan M. Frieze:
The cover time of the giant component of a random graph.
Random Struct. Algorithms 32(4): 401-439 (2008) |
| 55 | | Colin Cooper,
Ralf Klasing,
Tomasz Radzik:
A randomized algorithm for the joining protocol in dynamic distributed networks.
Theor. Comput. Sci. 406(3): 248-262 (2008) |
| 2007 |
|---|
| 54 | | Colin Cooper,
Alan M. Frieze:
The Cover Time of Random Digraphs.
APPROX-RANDOM 2007: 422-435 |
| 53 | | Colin Cooper,
Michele Zito:
Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases.
PKDD 2007: 398-405 |
| 52 | | Petra Berenbrink,
Colin Cooper,
Zengjian Hu:
Energy efficient randomised communication in unknown AdHoc networks.
SPAA 2007: 250-259 |
| 51 | | Colin Cooper,
Alan M. Frieze,
Gregory B. Sorkin:
Random 2-SAT with Prescribed Literal Degrees.
Algorithmica 48(3): 249-265 (2007) |
| 50 | | Colin Cooper,
Martin E. Dyer,
Catherine S. Greenhill:
Sampling Regular Graphs and a Peer-to-Peer Network.
Combinatorics, Probability & Computing 16(4): 557-593 (2007) |
| 49 | | Colin Cooper,
Alan M. Frieze:
The cover time of the preferential attachment graph.
J. Comb. Theory, Ser. B 97(2): 269-290 (2007) |
| 48 | | Colin Cooper,
Alan M. Frieze:
The cover time of sparse random graphs.
Random Struct. Algorithms 30(1-2): 1-16 (2007) |
| 2006 |
|---|
| 47 | | Colin Cooper,
Ralf Klasing,
Tomasz Radzik:
Searching for Black-Hole Faults in a Network Using Multiple Agents.
OPODIS 2006: 320-332 |
| 46 | | Petra Berenbrink,
Colin Cooper,
Zengjian Hu:
Energy Efficient Randomized Communication in Unknown AdHoc Networks
CoRR abs/cs/0612074: (2006) |
| 45 | | Colin Cooper:
Distribution of Vertex Degree in Web-Graphs.
Combinatorics, Probability & Computing 15(5): 637-661 (2006) |
| 44 | | Michele Zito,
Colin Cooper:
Dominating sets of random recursive trees.
Electronic Notes in Discrete Mathematics 27: 107-108 (2006) |
| 43 | | K. Burgin,
Prasad Chebolu,
Colin Cooper,
Alan M. Frieze:
Hamilton cycles in random lifts of graphs.
Eur. J. Comb. 27(8): 1282-1293 (2006) |
| 42 | | Gürkan Bebek,
Petra Berenbrink,
Colin Cooper,
Tom Friedetzky,
Joseph H. Nadeau,
Süleyman Cenk Sahinalp:
The degree distribution of the generalized duplication model.
Theor. Comput. Sci. 369(1-3): 239-249 (2006) |
| 2005 |
|---|
| 41 | | Colin Cooper,
Alan M. Frieze:
The cover time of two classes of random graphs.
SODA 2005: 961-970 |
| 40 | | Colin Cooper,
Martin E. Dyer,
Catherine S. Greenhill:
Sampling regular graphs and a peer-to-peer network.
SODA 2005: 980-988 |
| 39 | | Gürkan Bebek,
Petra Berenbrink,
Colin Cooper,
Tom Friedetzky,
Joseph H. Nadeau,
Süleyman Cenk Sahinalp:
Improved Duplication Models for Proteome Network Evolution.
Systems Biology and Regulatory Genomics 2005: 119-137 |
| 38 |  | Colin Cooper,
Ralf Klasing,
Michele Zito:
Lower Bounds and Algorithms for Dominating Sets in Web Graphs.
Internet Mathematics 2(3): (2005) |
| 37 | | Colin Cooper,
Alan M. Frieze:
The Cover Time of Random Regular Graphs.
SIAM J. Discrete Math. 18(4): 728-740 (2005) |
| 2004 |
|---|
| 36 | | Colin Cooper,
Ralf Klasing,
Michele Zito:
Dominating Sets in Web Graphs.
WAW 2004: 31-43 |
| 35 | | Colin Cooper,
Alan M. Frieze:
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence.
Combinatorics, Probability & Computing 13(3): 319-337 (2004) |
| 34 | | Colin Cooper:
The cores of random hypergraphs with a given degree sequence.
Random Struct. Algorithms 25(4): 353-375 (2004) |
| 2003 |
|---|
| 33 | | Colin Cooper,
Alan M. Frieze:
The cover time of sparse random graphs.
SODA 2003: 140-147 |
| 32 | | Tom Bohman,
Colin Cooper,
Alan M. Frieze,
Ryan Martin,
Miklós Ruszinkó:
On Randomly Generated Intersecting Hypergraphs.
Electr. J. Comb. 10: (2003) |
| 31 | | Colin Cooper,
Alan M. Frieze:
Crawling on Simple Models of Web Graphs.
Internet Mathematics 1(1): (2003) |
| 30 | | Colin Cooper,
Alan M. Frieze,
Juan Vera:
Random Deletion in a Scale-Free Random Graph Process.
Internet Mathematics 1(4): (2003) |
| 29 | | Colin Cooper,
Alan M. Frieze:
A general model of web graphs.
Random Struct. Algorithms 22(3): 311-335 (2003) |
| 2002 |
|---|
| 28 | | Colin Cooper:
Classifying Special Interest Groups in Web Graphs.
RANDOM 2002: 263-276 |
| 27 | | Colin Cooper,
Alan M. Frieze,
Gregory B. Sorkin:
A note on random 2-SAT with prescribed literal degrees.
SODA 2002: 316-320 |
| 26 | | Colin Cooper,
Alan M. Frieze:
Crawling on web graphs.
STOC 2002: 419-427 |
| 25 | | Colin Cooper,
Alan M. Frieze:
Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs.
Combinatorics, Probability & Computing 11(2): (2002) |
| 24 | | Colin Cooper,
Alan M. Frieze,
Bruce A. Reed:
Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity.
Combinatorics, Probability & Computing 11(3): (2002) |
| 23 | | Colin Cooper,
Alan M. Frieze,
Bruce A. Reed,
Oliver Riordan:
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number.
Combinatorics, Probability & Computing 11(4): (2002) |
| 2001 |
|---|
| 22 | | Colin Cooper,
Alan M. Frieze:
A General Model of Undirected Web Graphs.
ESA 2001: 500-511 |
| 21 | | Colin Cooper,
Martin E. Dyer,
Alan M. Frieze:
On Markov Chains for Randomly H-Coloring a Graph.
J. Algorithms 39(1): 117-134 (2001) |
| 20 | | Colin Cooper:
The union of two random permutations does not have a directed Hamilton cycle.
Random Struct. Algorithms 18(1): 95-98 (2001) |
| 2000 |
|---|
| 19 | | Tom Bohman,
Colin Cooper,
Alan M. Frieze:
Min-Wise Independent Linear Permutations.
Electr. J. Comb. 7: (2000) |
| 18 | | Colin Cooper,
Alan M. Frieze,
Kurt Mehlhorn,
Volker Priebe:
Average-case complexity of shortest-paths problems in the vertex-potential model.
Random Struct. Algorithms 16(1): 33-46 (2000) |
| 17 | | Colin Cooper:
On the rank of random matrices.
Random Struct. Algorithms 16(2): 209-232 (2000) |
| 16 | | Colin Cooper,
Alan M. Frieze:
Hamilton cycles in random graphs and directed graphs.
Random Struct. Algorithms 16(4): 369-401 (2000) |
| 15 | | Colin Cooper:
On the distribution of rank of a random matrix over a finite field.
Random Struct. Algorithms 17(3-4): 197-212 (2000) |
| 1999 |
|---|
| 14 | | Colin Cooper,
Alan M. Frieze:
Mixing properties of the Swendsen-Wang process on classes of graphs.
Random Struct. Algorithms 15(3-4): 242-261 (1999) |
| 1997 |
|---|
| 13 | | Colin Cooper,
Alan M. Frieze,
Kurt Mehlhorn,
Volker Priebe:
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model.
RANDOM 1997: 15-26 |
| 1996 |
|---|
| 12 | | Colin Cooper,
Alan M. Frieze,
Michael Molloy,
Bruce A. Reed:
Perfect Matchings in Random r-regular, s-uniform Hypergraphs.
Combinatorics, Probability & Computing 5: 1-14 (1996) |
| 1995 |
|---|
| 11 | | Colin Cooper,
Alan M. Frieze:
On the Connectivity of Random k-th Nearest Neighbour Graphs.
Combinatorics, Probability & Computing 4: 343-362 (1995) |
| 10 | | Martin Anthony,
Graham Brightwell,
Colin Cooper:
The vapnik-chervonenkis dimension of a random graph.
Discrete Mathematics 138(1-3): 43-56 (1995) |
| 9 | | Colin Cooper,
Alan M. Frieze:
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold.
Electr. J. Comb. 2: (1995) |
| 8 | | Colin Cooper:
On the 2-Cyclic Property in 2-Regular Digraphs.
Random Struct. Algorithms 6(4): 439-448 (1995) |
| 1994 |
|---|
| 7 | | Colin Cooper,
Alan M. Frieze,
Michael Molloy:
Hamilton Cycles in Random Regular Digraphs.
Combinatorics, Probability & Computing 3: 39-49 (1994) |
| 6 | | Colin Cooper,
Alan M. Frieze:
Hamilton Cycles in a Class of Random Directed Graphs.
J. Comb. Theory, Ser. B 62(1): 151-163 (1994) |
| 5 | | Colin Cooper:
The Threshold for Hamilton Cycles in the Square of a Random Graph.
Random Struct. Algorithms 5(1): 25-32 (1994) |
| 1993 |
|---|
| 4 | | Colin Cooper:
A Note on the Connectivity of 2-Regular Digraphs.
Random Struct. Algorithms 4(4): 469-472 (1993) |
| 1992 |
|---|
| 3 | | Colin Cooper:
On the Trickness of Sparse Random Graphs.
Combinatorics, Probability & Computing 1: 303-309 (1992) |
| 2 | | Colin Cooper:
1-Pancyclic Hamilton Cycles in Random Graphs.
Random Struct. Algorithms 3(3): 277-288 (1992) |
| 1990 |
|---|
| 1 | | Colin Cooper,
Alan M. Frieze:
The limiting probability that alpha-in, ß-out is strongly connected.
J. Comb. Theory, Ser. B 48(1): 117-134 (1990) |
