External Links

    Journal: Random Struct. Algorithms

    Volume 45, Issue 4

    553 -- 607Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller, Milos Stojakovic. Maker-breaker games on random geometric graphs
    608 -- 626David Conlon, Jacob Fox, Benny Sudakov. Cycle packing
    627 -- 674Colin Cooper, Alan M. Frieze, Eyal Lubetzky. Cover time of a random graph with a degree sequence II: Allowing vertices of degree two
    675 -- 702Colin Cooper, Alan M. Frieze, Ryuhei Uehara. k-trees and related branching processes
    703 -- 723Suguru Tamaki, Yuichi Yoshida. A query efficient non-adaptive long code test with perfect completeness
    724 -- 761Svante Janson, Malwina J. Luczak, Peter Windridge. Law of large numbers for the SIR epidemic on a random graph with given degrees
    762 -- 765Oliver Riordan. Long cycles in random subgraphs of graphs with large minimum degree

    Volume 45, Issue 3

    343 -- 361Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott. H-free graphs have a linear homogeneous set
    362 -- 382Emmanuel Abbe, Andrea Montanari. On the concentration of the number of solutions of random satisfiability formulas
    383 -- 407Itai Benjamini, Gady Kozma, Nicholas C. Wormald. The mixing time of the giant component of a random graph
    408 -- 420Luc Devroye, Nicolas Fraiman. Connectivity of inhomogeneous random graphs
    421 -- 442Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger. Stochastic service systems, random interval graphs and search algorithms
    443 -- 497Alan M. Frieze. On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three
    498 -- 512Michael Molloy. Sets that are connected in two random graphs
    513 -- 551Michael E. Picollelli. The diamond-free process

    Volume 45, Issue 2

    139 -- 184Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler. Finding cycles and trees in sublinear time
    185 -- 217Michael Borokhovich, Chen Avin, Zvi Lotker. Bounds for algebraic gossip on graphs
    218 -- 235Demetres Christofides, Klas Markström. The thresholds for diameter 2 in random Cayley graphs
    236 -- 260Nicolas Curien, Igor Kortchemski. Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
    261 -- 305Thomas Feierl. B
    306 -- 317Eyal Heiman, Gideon Schechtman, Adi Shraibman. Deterministic algorithms for matrix completion
    318 -- 341Tobias Müller, Milos Stojakovic. A threshold for the Maker-Breaker clique game

    Volume 45, Issue 1

    1 -- 13Lionel Levine, Yuval Peres. d
    14 -- 37Amalia Duch, Rosa M. Jiménez, Conrado Martínez. K-dimensional binary search trees
    38 -- 77Mirko Ebbers, Holger Knöpfel, Matthias Löwe, Franck Vermet. Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model
    78 -- 110Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang. Improved inapproximability results for counting independent sets in the hard-core model
    111 -- 137Mark Holmes, Thomas S. Salisbury. Degenerate random environments
    runs on