King's College London
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j64 |      | Colin Cooper, Alan M. Frieze: Component structure of the vacant set induced by a random walk on a random graph. Random Struct. Algorithms 42(2): 135-158 (2013) |
| 2012 | ||
| j63 | | Mohammed Abdullah, Colin Cooper, Alan M. Frieze: Cover time of a random graph with given degree sequence. Discrete Mathematics 312(21): 3146-3163 (2012) |
| j62 | | Colin Cooper, Alan M. Frieze: Stationary distribution and cover time of random walks on random digraphs. J. Comb. Theory, Ser. B 102(2): 329-362 (2012) |
| j61 | | Tugkan Batu, Petra Berenbrink, Colin Cooper: Chains-into-bins processes. J. Discrete Algorithms 14: 21-28 (2012) |
| c38 | | Colin Cooper, Tomasz Radzik, Yiannis Siantos: Estimating network parameters using random walks. CASoN 2012: 33-40 |
| c37 | | Petra Berenbrink, Colin Cooper, Tom Friedetzky: Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time. PODC 2012: 29-36 |
| c36 | | Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik: Coalescing random walks and voting on graphs. PODC 2012: 47-56 |
| c35 | | Colin Cooper, Alan M. Frieze, Pawel Pralat: Some Typical Properties of the Spatial Preferred Attachment Model. WAW 2012: 29-40 |
| c34 | | Colin Cooper, Tomasz Radzik, Yiannis Siantos: A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence. WAW 2012: 165-178 |
| c33 | | Colin Cooper, Tomasz Radzik, Yiannis Siantos: A fast algorithm to find all high degree vertices in power law graphs. WWW (Companion Volume) 2012: 1007-1016 |
| i7 | | Petra Berenbrink, Colin Cooper, Tom Friedetzky: Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time. CoRR abs/1204.1939 (2012) |
| i6 | | Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik: Coalescing random walks and voting on graphs. CoRR abs/1204.4106 (2012) |
| 2011 | ||
| j60 | | Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Computing 24(2): 91-99 (2011) |
| j59 | | Colin Cooper, Alan M. Frieze: The cover time of random geometric graphs. Random Struct. Algorithms 38(3): 324-349 (2011) |
| j58 | | Colin Cooper, Pawel Pralat: Scale-free graphs of increasing degree. Random Struct. Algorithms 38(4): 396-421 (2011) |
| c32 | | Mohammed Abdullah, Colin Cooper, Moez Draief: Viral Processes by Random Walks on Random Regular Graphs. APPROX-RANDOM 2011: 351-364 |
| c31 | | Colin Cooper: Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful. SIROCCO 2011: 1-14 |
| c30 | | Colin Cooper, Alan M. Frieze, Tomasz Radzik: The Cover Times of Random Walks on Hypergraphs. SIROCCO 2011: 210-221 |
| c29 | | Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald: Randomized Diffusion for Indivisible Loads. SODA 2011: 429-439 |
| c28 | | |
| c27 | | Colin Cooper, Alan M. Frieze: Component structure of the vacant set induced by a random walk on a random graph. SODA 2011: 1211-1221 |
| i5 | | Colin Cooper, Martin E. Dyer, Velumailum Mohanaraj: On the Imitation Strategy for Games on Graphs. CoRR abs/1102.3879 (2011) |
| i4 | | Colin Cooper, Alan M. Frieze: Stationary distribution and cover time of random walks on random digraphs. CoRR abs/1103.4317 (2011) |
| 2010 | ||
| j57 | | Colin Cooper, Ryuhei Uehara: Scale Free Properties of Random k-Trees. Mathematics in Computer Science 3(4): 489-496 (2010) |
| j56 | | Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze: An Efficient Sparse Regularity Concept. SIAM J. Discrete Math. 23(4): 2000-2034 (2010) |
| j55 | | Colin Cooper, Alan M. Frieze, Michael Krivelevich: Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discrete Math. 24(2): 558-569 (2010) |
| j54 | | Colin Cooper, Alan M. Frieze: Random Walks with Look-Ahead in Scale-Free Random Graphs. SIAM J. Discrete Math. 24(3): 1162-1176 (2010) |
| j53 | | Colin Cooper, Ralf Klasing, Tomasz Radzik: Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci. 411(14-15): 1638-1647 (2010) |
| c26 | | |
| c25 | | Mohammed Abdullah, Colin Cooper, Tomasz Radzik: The Cover Time of Cartesian Product Graphs. IWOCA 2010: 377-389 |
| c24 | | Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald: Speeding Up Random Walks with Neighborhood Exploration. SODA 2010: 1422-1435 |
| i3 | | Colin Cooper, Alan M. Frieze: Component structure induced by a random walk on a random graph. CoRR abs/1005.1564 (2010) |
| i2 | | |
| 2009 | ||
| j52 | | 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) |
| j51 | | 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) |
| j50 | | Colin Cooper, Alan M. Frieze, Tomasz Radzik: Multiple Random Walks in Random Regular Graphs. SIAM J. Discrete Math. 23(4): 1738-1761 (2009) |
| j49 | | Petra Berenbrink, Colin Cooper, Zengjian Hu: Energy efficient randomised communication in unknown AdHoc networks. Theor. Comput. Sci. 410(27-29): 2549-2561 (2009) |
| c23 | | Colin Cooper, Andrew R. A. McGrae, Michele Zito: Martingales on Trees and the Empire Chromatic Number of Random Trees. FCT 2009: 74-83 |
| c22 | | Colin Cooper, Alan M. Frieze, Tomasz Radzik: Multiple Random Walks and Interacting Particle Systems. ICALP (2) 2009: 399-410 |
| c21 | | Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422 |
| c20 | | Colin Cooper, Martin E. Dyer, Andrew J. Handley: The flip markov chain and a randomising P2P protocol. PODC 2009: 141-150 |
| c19 | | |
| c18 | | Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze: An efficient sparse regularity concept. SODA 2009: 207-216 |
| r1 | | Colin Cooper, Michele Zito: Realistic Data for Testing Rule Mining Algorithms. Encyclopedia of Data Warehousing and Mining 2009: 1653-1658 |
| 2008 | ||
| j48 | | William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat: A Spatial Web Graph Model with Local Influence Regions. Internet Mathematics 5(1): 175-196 (2008) |
| j47 | | Colin Cooper, Alan M. Frieze: The cover time of the giant component of a random graph. Random Struct. Algorithms 32(4): 401-439 (2008) |
| j46 | | 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) |
| c17 | | |
| c16 | | Colin Cooper, Ralf Klasing, Tomasz Radzik: Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO 2008: 20-32 |
| 2007 | ||
| j45 | | Colin Cooper, Alan M. Frieze, Gregory B. Sorkin: Random 2-SAT with Prescribed Literal Degrees. Algorithmica 48(3): 249-265 (2007) |
| j44 | | 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) |
| j43 | | Colin Cooper, Alan M. Frieze: The cover time of the preferential attachment graph. J. Comb. Theory, Ser. B 97(2): 269-290 (2007) |
| j42 | | Colin Cooper, Alan M. Frieze: The cover time of sparse random graphs. Random Struct. Algorithms 30(1-2): 1-16 (2007) |
| c15 | | |
| c14 | | Colin Cooper, Michele Zito: Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. PKDD 2007: 398-405 |
| c13 | | Petra Berenbrink, Colin Cooper, Zengjian Hu: Energy efficient randomised communication in unknown AdHoc networks. SPAA 2007: 250-259 |
| c12 | | William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat: A Spatial Web Graph Model with Local Influence Regions. WAW 2007: 96-107 |
| 2006 | ||
| j41 | | Colin Cooper: Distribution of Vertex Degree in Web-Graphs. Combinatorics, Probability & Computing 15(5): 637-661 (2006) |
| j40 | | K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze: Hamilton cycles in random lifts of graphs. Eur. J. Comb. 27(8): 1282-1293 (2006) |
| j39 | | Michele Zito, Colin Cooper: Dominating sets of random recursive trees. Electronic Notes in Discrete Mathematics 27: 107-108 (2006) |
| j38 | | 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) |
| c11 | | Colin Cooper, Ralf Klasing, Tomasz Radzik: Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS 2006: 320-332 |
| i1 | | Petra Berenbrink, Colin Cooper, Zengjian Hu: Energy Efficient Randomized Communication in Unknown AdHoc Networks. CoRR abs/cs/0612074 (2006) |
| 2005 | ||
| j37 | | Colin Cooper, Ralf Klasing, Michele Zito: Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Mathematics 2(3): 275-300 (2005) |
| j36 | | Colin Cooper, Alan M. Frieze: The Cover Time of Random Regular Graphs. SIAM J. Discrete Math. 18(4): 728-740 (2005) |
| c10 | | 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 |
| c9 | | |
| c8 | | Colin Cooper, Martin E. Dyer, Catherine S. Greenhill: Sampling regular graphs and a peer-to-peer network. SODA 2005: 980-988 |
| 2004 | ||
| j35 | | 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) |
| j34 | | Colin Cooper: The cores of random hypergraphs with a given degree sequence. Random Struct. Algorithms 25(4): 353-375 (2004) |
| c7 | | |
| 2003 | ||
| j33 | | Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó: On Randomly Generated Intersecting Hypergraphs. Electr. J. Comb. 10 (2003) |
| j32 | | Colin Cooper, Alan M. Frieze: Crawling on Simple Models of Web Graphs. Internet Mathematics 1(1): 57-90 (2003) |
| j31 | | Colin Cooper, Alan M. Frieze, Juan Vera: Random Deletion in a Scale-Free Random Graph Process. Internet Mathematics 1(4): 463-483 (2003) |
| j30 | | Colin Cooper, Alan M. Frieze: A general model of web graphs. Random Struct. Algorithms 22(3): 311-335 (2003) |
| c6 | | |
| 2002 | ||
| j29 | | Colin Cooper, Alan M. Frieze: Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. Combinatorics, Probability & Computing 11(2): 129-133 (2002) |
| j28 | | Colin Cooper, Alan M. Frieze, Bruce A. Reed: Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Combinatorics, Probability & Computing 11(3): 249-261 (2002) |
| j27 | | 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): 323-341 (2002) |
| c5 | | |
| c4 | | Colin Cooper, Alan M. Frieze, Gregory B. Sorkin: A note on random 2-SAT with prescribed literal degrees. SODA 2002: 316-320 |
| c3 | | |
| 2001 | ||
| j26 | | Colin Cooper, Martin E. Dyer, Alan M. Frieze: On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms 39(1): 117-134 (2001) |
| j25 | | Colin Cooper: The union of two random permutations does not have a directed Hamilton cycle. Random Struct. Algorithms 18(1): 95-98 (2001) |
| c2 | | |
| 2000 | ||
| j24 | | Tom Bohman, Colin Cooper, Alan M. Frieze: Min-Wise Independent Linear Permutations. Electr. J. Comb. 7 (2000) |
| j23 | | Béla Bollobás, Colin Cooper, Trevor I. Fenner, Alan M. Frieze: Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k. Journal of Graph Theory 34(1): 42-59 (2000) |
| j22 | | 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) |
| j21 | | |
| j20 | | Colin Cooper, Alan M. Frieze: Hamilton cycles in random graphs and directed graphs. Random Struct. Algorithms 16(4): 369-401 (2000) |
| j19 | | 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 | ||
| j18 | | Colin Cooper: Asymptotics for dependent sums of random vectors. Random Struct. Algorithms 14(3): 267-292 (1999) |
| j17 | | 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 | ||
| c1 | | 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 | ||
| j16 | | 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) |
| j15 | | Colin Cooper: Asymptotic Enumeration of Predicate-Junction Flowgraphs. Combinatorics, Probability & Computing 5: 215-226 (1996) |
| 1995 | ||
| j14 | | Colin Cooper, Alan M. Frieze: Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. Electr. J. Comb. 2 (1995) |
| j13 | | Colin Cooper, Alan M. Frieze: On the Connectivity of Random k-th Nearest Neighbour Graphs. Combinatorics, Probability & Computing 4: 343-362 (1995) |
| j12 | | Martin Anthony, Graham Brightwell, Colin Cooper: The vapnik-chervonenkis dimension of a random graph. Discrete Mathematics 138(1-3): 43-56 (1995) |
| j11 | | Colin Cooper: On the 2-Cyclic Property in 2-Regular Digraphs. Random Struct. Algorithms 6(4): 439-448 (1995) |
| 1994 | ||
| j10 | | Colin Cooper, Alan M. Frieze, Michael Molloy: Hamilton Cycles in Random Regular Digraphs. Combinatorics, Probability & Computing 3: 39-49 (1994) |
| j9 |  | Colin Cooper: Probabilistic analysis of two k-cluster problems. Discrete Applied Mathematics 50(1): 27-51 (1994) |
| j8 | | Colin Cooper, Alan M. Frieze: Hamilton Cycles in a Class of Random Directed Graphs. J. Comb. Theory, Ser. B 62(1): 151-163 (1994) |
| j7 | | Colin Cooper: The Threshold for Hamilton Cycles in the Square of a Random Graph. Random Struct. Algorithms 5(1): 25-32 (1994) |
| 1993 | ||
| j6 | | Colin Cooper: A Note on the Connectivity of 2-Regular Digraphs. Random Struct. Algorithms 4(4): 469-472 (1993) |
| 1992 | ||
| j5 | | Colin Cooper: On the Trickness of Sparse Random Graphs. Combinatorics, Probability & Computing 1: 303-309 (1992) |
| j4 | | Colin Cooper: 1-Pancyclic Hamilton Cycles in Random Graphs. Random Struct. Algorithms 3(3): 277-288 (1992) |
| 1991 | ||
| j3 | | Colin Cooper: Pancyclic Hamilton cycles in random graphs. Discrete Mathematics 91(2): 141-148 (1991) |
| 1990 | ||
| j2 | | 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) |
| 1989 | ||
| j1 | | Colin Cooper, Alan M. Frieze: On the number of hamilton cycles in a random graph. Journal of Graph Theory 13(6): 719-735 (1989) |
Data released under the ODC-BY 1.0 license — See also our legal information page