Alan M. Frieze

466 papers A* 59A 2B 13C 6Misc 1Journal 366Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Aspects of a randomly growing cluster in R d , d ≥ 2. Discret. Appl. Math. Alan M. Frieze, Ravi Kannan, Wesley Pegden
2026	J	`jnl`	Binomial Random Matroids. CoRR Patrick Bennett, Alan M. Frieze
2026	J	`jnl`	The intersection of a random geometric graph with an Erdős-Rényi graph. Discret. Appl. Math. Patrick Bennett, Alan M. Frieze, Wesley Pegden
2025	J	`jnl`	Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds. Eur. J. Comb. Alan M. Frieze, Pu Gao, Calum MacRury, Pawel Pralat, Gregory B. Sorkin
2025	J	`jnl`	Cover time of random subgraphs of the hypercube. CoRR Colin Cooper, Alan M. Frieze, Wesley Pegden
2025	J	`jnl`	Giant rainbow trees in sparse random graphs. Eur. J. Comb. Tolson Bell, Alan M. Frieze
2025	J	`jnl`	Hamilton Cycles in Random Digraphs with Minimum Degree at Least One. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2025	J	`jnl`	Karp's patching algorithm on dense digraph. CoRR Alan M. Frieze
2025	J	`jnl`	Some online Maker-Breaker games. Discret. Math. Patrick Bennett, Alan M. Frieze
2025	J	`jnl`	The Moran Process on a Random Graph. Random Struct. Algorithms Alan M. Frieze, Wesley Pegden
2025	J	`jnl`	Weighted Tree Games. Electron. J. Comb. Patrick Bennett, Alan M. Frieze
2024	A*	`conf`	O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold. FOCS Tolson Bell, Alan M. Frieze
2024	J	`jnl`	On the Chromatic Number of Random Regular Hypergraphs. SIAM J. Discret. Math. Patrick Bennett, Alan M. Frieze
2024	J	`jnl`	On the Concentration of the Maximum Degree in the Duplication-Divergence Models. SIAM J. Discret. Math. Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
2024	J	`jnl`	On the Intersecting Family Process. Electron. J. Comb. Alan M. Frieze, Patrick Bennett, Andrew Newman, Wesley Pegden
2024	J	`jnl`	Rainbow Hamilton cycles in random geometric graphs. Random Struct. Algorithms Alan M. Frieze, Xavier Pérez-Giménez
2024	J	`jnl`	Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\). SIAM J. Discret. Math. Deepak Bal, Alan M. Frieze, Pawel Pralat
2024	J	`jnl`	Rainbow Thresholds. SIAM J. Discret. Math. Tolson Bell, Alan M. Frieze, Trent G. Marbach
2024	J	`jnl`	Rainbow powers of a Hamilton cycle in J. Graph Theory Tolson Bell, Alan M. Frieze
2024	J	`jnl`	The Bright Side of Simple Heuristics for the TSP. Electron. J. Comb. Alan M. Frieze, Wesley Pegden
2023	J	`jnl`	Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds. CoRR Alan M. Frieze, Pu Gao, Calum MacRury, Pawel Pralat, Gregory B. Sorkin
2023	J	`jnl`	Colorful Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. Debsoumya Chakraborti, Alan M. Frieze, Mihir Hasabnis
2023	J	`jnl`	Multitrees in Random Graphs. Electron. J. Comb. Alan M. Frieze, Wesley Pegden
2023	J	`jnl`	On the concentration of the maximum degree in the duplication-divergence models. CoRR Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
2023	J	`jnl`	Spanners in randomly weighted graphs: Euclidean case. J. Graph Theory Alan M. Frieze, Wesley Pegden
2023	A*	`conf`	Subexponential mixing for partition chains on grid-like graphs. SODA Alan M. Frieze, Wesley Pegden
2023	J	`jnl`	The bright side of simple heuristics for the TSP. CoRR Alan M. Frieze, Wesley Pegden
2022	J	`jnl`	A Randomly Weighted Minimum Arborescence with a Random Cost Constraint. Math. Oper. Res. Alan M. Frieze, Tomasz Tkocz
2022	J	`jnl`	A scaling limit for the length of the longest cycle in a sparse random digraph. Random Struct. Algorithms Michael Anastos, Alan M. Frieze
2022	J	`jnl`	Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. J. Appl. Probab. Hüseyin Acan, Alan M. Frieze, Boris G. Pittel
2022	A*	`conf`	Learning from a Sample in Online Algorithms. NeurIPS C. J. Argue, Alan M. Frieze, Anupam Gupta, Christopher Seiler
2022	J	`jnl`	Localization game for random graphs. Discret. Appl. Math. Andrzej Dudek, Sean English, Alan M. Frieze, Calum MacRury, Pawel Pralat
2022	J	`jnl`	On the Cover Time of the Emerging Giant. SIAM J. Discret. Math. Alan M. Frieze, Wesley Pegden, Tomasz Tkocz
2022	J	`jnl`	Rainbow spanning trees in randomly coloured G CoRR Deepak Bal, Alan M. Frieze, Pawel Pralat
2022	J	`jnl`	Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2022	J	`jnl`	Spanners in randomly weighted graphs: Independent edge lengths. Discret. Appl. Math. Alan M. Frieze, Wesley Pegden
2022	J	`jnl`	Subexponential mixing for partition chains on grid-like graphs. CoRR Alan M. Frieze, Wesley Pegden
2021	J	`jnl`	A Randomly Weighted Minimum Spanning Tree with a Random Cost Constraint. Electron. J. Comb. Alan M. Frieze, Tomasz Tkocz
2021	J	`jnl`	A scaling limit for the length of the longest cycle in a sparse random graph. J. Comb. Theory B Michael Anastos, Alan M. Frieze
2021	J	`jnl`	Finding maximum matchings in random regular graphs in linear expected time. Random Struct. Algorithms Michael Anastos, Alan M. Frieze
2021	J	`jnl`	Hamiltonicity of Random Graphs in the Stochastic Block Model. SIAM J. Discret. Math. Michael Anastos, Alan M. Frieze, Pu Gao
2021	J	`jnl`	Isomorphism for random Inf. Process. Lett. Debsoumya Chakraborti, Alan M. Frieze, Simi Haber, Mihir Hasabnis
2021	J	`jnl`	Maker Breaker on digraphs. J. Graph Theory Alan M. Frieze, Wesley Pegden
2021	J	`jnl`	Minimum-Weight Combinatorial Structures Under Random Cost-Constraints. Electron. J. Comb. Alan M. Frieze, Wesley Pegden, Gregory B. Sorkin, Tomasz Tkocz
2021	J	`jnl`	Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. Oper. Res. Lett. Alan M. Frieze, Tomasz Tkocz
2021	J	`jnl`	Shortest paths with a cost constraint: A probabilistic analysis. Discret. Appl. Math. Alan M. Frieze, Tomasz Tkocz
2021	J	`jnl`	Spanners in randomly weighted graphs: independent edge lengths. CoRR Alan M. Frieze, Wesley Pegden
2021	Misc	`conf`	The Concentration of the Maximum Degree in the Duplication-Divergence Models. COCOON Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
2021	J	`jnl`	The Effect of Adding Randomly Weighted Edges. SIAM J. Discret. Math. Alan M. Frieze
2020	A*	`conf`	A randomly weighted minimum spanning tree with a random cost constraint. SODA Alan M. Frieze, Tomasz Tkocz
2020	B	`conf`	Degree Distribution for Duplication-Divergence Graphs: Large Deviations. WG Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
2020	J	`jnl`	Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis. Random Struct. Algorithms Michael Anastos, Alan M. Frieze
2020	J	`jnl`	On random multi-dimensional assignment problems. Discret. Appl. Math. Alan M. Frieze, Wesley Pegden, Tomasz Tkocz
2020	J	`jnl`	On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph. Electron. J. Comb. Alan M. Frieze, Xavier Pérez-Giménez, Pawel Pralat
2020	J	`jnl`	On the connectivity of proper colorings of random graphs and hypergraphs. Random Struct. Algorithms Michael Anastos, Alan M. Frieze
2020	J	`jnl`	Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. CoRR Alan M. Frieze, Tomasz Tkocz
2020	J	`jnl`	Random Graphs with a Fixed Maximum Degree. SIAM J. Discret. Math. Alan M. Frieze, Tomasz Tkocz
2019	J	`jnl`	A Note on Log-Concave Random Graphs. Electron. J. Comb. Alan M. Frieze, Tomasz Tkocz
2019	J	`jnl`	A Random Variant of the Game of Plates and Olives. SIAM J. Discret. Math. Andrzej Dudek, Sean English, Alan M. Frieze
2019	J	`jnl`	A note on the localization number of random graphs: Diameter two case. Discret. Appl. Math. Andrzej Dudek, Alan M. Frieze, Wesley Pegden
2019	J	`jnl`	A randomly weighted minimum arborescence with a random cost constraint. CoRR Alan M. Frieze, Tomasz Tkocz
2019	J	`jnl`	How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? J. Graph Theory Michael Anastos, Alan M. Frieze
2019	J	`jnl`	Minors of a random binary matroid. Random Struct. Algorithms Colin Cooper, Alan M. Frieze, Wesley Pegden
2019	J	`jnl`	Notes on growing a tree in a graph. Random Struct. Algorithms Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed
2019	—	`conf`	On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs. APPROX-RANDOM Michael Anastos, Alan M. Frieze
2019	J	`jnl`	On random multi-dimensional assignment problems. CoRR Alan M. Frieze, Wesley Pegden, Tomasz Tkocz
2019	J	`jnl`	On the Cover Time of Dense Graphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze, Wesley Pegden
2019	J	`jnl`	On the Rank of a Random Binary Matrix. Electron. J. Comb. Colin Cooper, Alan M. Frieze, Wesley Pegden
2019	J	`jnl`	On the insertion time of random walk cuckoo hashing. Random Struct. Algorithms Alan M. Frieze, Tony Johansson
2019	A*	`conf`	On the rank of a random binary matrix. SODA Colin Cooper, Alan M. Frieze, Wesley Pegden
2019	J	`jnl`	Pattern Colored Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. Michael Anastos, Alan M. Frieze
2019	J	`jnl`	Perfect matchings and Hamiltonian cycles in the preferential attachment model. Random Struct. Algorithms Alan M. Frieze, Xavier Pérez-Giménez, Pawel Pralat, Benjamin Reiniger
2019	J	`jnl`	Traveling in randomly embedded random graphs. Random Struct. Algorithms Alan M. Frieze, Wesley Pegden
2018	J	`jnl`	A greedy algorithm for finding a large 2-matching on a random cubic graph. J. Graph Theory Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
2018	J	`jnl`	A note on dispersing particles on a line. Random Struct. Algorithms Alan M. Frieze, Wesley Pegden
2018	J	`jnl`	Balanced allocation through random walk. Inf. Process. Lett. Alan M. Frieze, Samantha Petti
2018	J	`jnl`	Constraining the Clustering Transition for Colorings of Sparse Random Graphs. Electron. J. Comb. Michael Anastos, Alan M. Frieze, Wesley Pegden
2018	J	`jnl`	Discordant Voting Processes on Finite Graphs. SIAM J. Discret. Math. Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolás Rivera
2018	J	`jnl`	Elegantly Colored Paths and Cycles in Edge Colored Random Graphs. SIAM J. Discret. Math. Lisa Espig, Alan M. Frieze, Michael Krivelevich
2018	J	`jnl`	On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph. Comb. Probab. Comput. Alan M. Frieze, Tony Johansson
2018	J	`jnl`	On Rainbow Hamilton Cycles in Random Hypergraphs. Electron. J. Comb. Andrzej Dudek, Sean English, Alan M. Frieze
2018	J	`jnl`	On the connectivity threshold for colorings of random graphs and hypergraphs. CoRR Michael Anastos, Alan M. Frieze
2018	J	`jnl`	On the cover time of dense graphs. CoRR Colin Cooper, Alan M. Frieze, Wesley Pegden
2018	J	`jnl`	Online purchasing under uncertainty. Random Struct. Algorithms Alan M. Frieze, Wesley Pegden
2018	J	`jnl`	Packing Hamilton Cycles Online. Comb. Probab. Comput. Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2018	C	`conf`	The Cover Time of a Biased Random Walk on a Random Cubic Graph. AofA Colin Cooper, Alan M. Frieze, Tony Johansson
2018	J	`jnl`	The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights. SIAM J. Discret. Math. Alan M. Frieze, Wesley Pegden, Gregory B. Sorkin
2018	—	`conf`	The cover time of a biased random walk on ANALCO Colin Cooper, Alan M. Frieze, Samantha Petti
2018	J	`jnl`	The cover time of a biased random walk on a random cubic graph. CoRR Colin Cooper, Alan M. Frieze, Tony Johansson
2017	J	`jnl`	Balanced Allocation Through Random Walk. CoRR Alan M. Frieze, Samantha Petti
2017	J	`jnl`	Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. J. Comb. Theory B Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
2017	J	`jnl`	Minimum Cost Matching in a Random Graph with Random Costs. SIAM J. Discret. Math. Alan M. Frieze, Tony Johansson
2017	J	`jnl`	Notes on Growing a Tree in a Graph. CoRR Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed
2017	J	`jnl`	On random Random Struct. Algorithms Alan M. Frieze, Tony Johansson
2017	A*	`conf`	On the insertion time of random walk cuckoo hashing. SODA Alan M. Frieze, Tony Johansson
2017	J	`jnl`	Randomly coloring simple hypergraphs with fewer colors. CoRR Michael Anastos, Alan M. Frieze
2017	J	`jnl`	Randomly coloring simple hypergraphs with fewer colors. Inf. Process. Lett. Alan M. Frieze, Michael Anastos
2017	J	`jnl`	Separating subadditive euclidean functionals. Random Struct. Algorithms Alan M. Frieze, Wesley Pegden
2017	J	`jnl`	The covertime of a biased random walk on G CoRR Colin Cooper, Alan M. Frieze, Samantha Petti
2017	—	`conf`	Traveling in Randomly Embedded Random Graphs. APPROX-RANDOM Alan M. Frieze, Wesley Pegden
2016	A*	`conf`	Discordant Voting Processes on Finite Graphs. ICALP Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
2016	J	`jnl`	Discordant voting processes on finite graphs. CoRR Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
2016	J	`jnl`	On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer
2016	J	`jnl`	On the insertion time of random walk cuckoo hashing. CoRR Alan M. Frieze, Tony Johansson
2016	J	`jnl`	Online purchasing under uncertainty. CoRR Alan M. Frieze, Wesley Pegden
2016	J	`jnl`	Rainbow Arborescence in Random Digraphs. J. Graph Theory Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat
2016	J	`jnl`	Rainbow matchings and Hamilton cycles in random graphs. Random Struct. Algorithms Deepak Bal, Alan M. Frieze
2016	J	`jnl`	Scalefree hardness of average-case Euclidean TSP approximation. CoRR Alan M. Frieze, Wesley Pegden
2016	A*	`conf`	Separating subadditive euclidean functionals. STOC Alan M. Frieze, Wesley Pegden
2016	J	`jnl`	Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2016	J	`jnl`	Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs. Electron. J. Comb. Patrick Bennett, Andrzej Dudek, Alan M. Frieze, Laars Helenius
2015	J	`jnl`	An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three. Random Struct. Algorithms Alan M. Frieze, Simi Haber
2015	J	`jnl`	Between 2- and 3-Colorability. Electron. J. Comb. Alan M. Frieze, Wesley Pegden
2015	J	`jnl`	Efficient algorithms for three-dimensional axial and planar random assignment problems. Random Struct. Algorithms Alan M. Frieze, Gregory B. Sorkin
2015	J	`jnl`	Long Paths in Random Apollonian Networks. Internet Math. Colin Cooper, Alan M. Frieze
2015	J	`jnl`	Loose Hamilton Cycles in Regular Hypergraphs. Comb. Probab. Comput. Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
2015	J	`jnl`	On the chromatic number of a random hypergraph. J. Comb. Theory B Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
2015	J	`jnl`	On-line List Colouring of Random Graphs. Electron. J. Comb. Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
2015	J	`jnl`	On-line list colouring of random graphs. CoRR Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
2015	J	`jnl`	Power of k Choices and Rainbow Spanning Trees in Random Graphs. Electron. J. Comb. Deepak Bal, Patrick Bennett, Alan M. Frieze, Pawel Pralat
2015	J	`jnl`	Rainbow Connection of Random Regular Graphs. SIAM J. Discret. Math. Andrzej Dudek, Alan M. Frieze, Charalampos E. Tsourakakis
2015	J	`jnl`	Separating subadditive Euclidean functionals. CoRR Alan M. Frieze, Wesley Pegden
2015	J	`jnl`	Walker-Breaker Games. SIAM J. Discret. Math. Lisa Espig, Alan M. Frieze, Michael Krivelevich, Wesley Pegden
2014	J	`jnl`	Analyzing Walksat on Random Formulas. SIAM J. Comput. Amin Coja-Oghlan, Alan M. Frieze
2014	J	`jnl`	Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. Random Struct. Algorithms Colin Cooper, Alan M. Frieze, Eyal Lubetzky
2014	J	`jnl`	Expanders via Random Spanning Trees. SIAM J. Comput. Alan M. Frieze, Navin Goyal, Luis Rademacher, Santosh S. Vempala
2014	J	`jnl`	Looking for vertex number one. CoRR Alan M. Frieze, Wesley Pegden
2014	J	`jnl`	Maker-breaker games on random geometric graphs. Random Struct. Algorithms Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller, Milos Stojakovic
2014	J	`jnl`	On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three. Random Struct. Algorithms Alan M. Frieze
2014	J	`jnl`	Packing Tree Factors in Random and Pseudo-random Graphs. Electron. J. Comb. Deepak Bal, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2014	J	`jnl`	Rainbow hamilton cycles in random graphs. Random Struct. Algorithms Alan M. Frieze, Po-Shen Loh
2014	J	`jnl`	Some Properties of Random Apollonian Networks. Internet Math. Alan M. Frieze, Charalampos E. Tsourakakis
2014	J	`jnl`	Some Typical Properties of the Spatial Preferred Attachment Model. Internet Math. Colin Cooper, Alan M. Frieze, Pawel Pralat
2014	J	`jnl`	The Topology of Competitively Constructed Graphs. Electron. J. Comb. Alan M. Frieze, Wesley Pegden
2014	J	`jnl`	The height of random Random Struct. Algorithms Colin Cooper, Alan M. Frieze, Ryuhei Uehara
2014	J	`jnl`	The t-Tone Chromatic Number of Random Graphs. Graphs Comb. Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze
2013	A*	`conf`	Algorithmic techniques for modeling and mining large graphs (AMAzING). KDD Alan M. Frieze, Aristides Gionis, Charalampos E. Tsourakakis
2013	J	`jnl`	Approximate counting of regular hypergraphs. Inf. Process. Lett. Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
2013	J	`jnl`	Coloring simple hypergraphs. J. Comb. Theory B Alan M. Frieze, Dhruv Mubayi
2013	J	`jnl`	Component structure of the vacant set induced by a random walk on a random graph. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2013	J	`jnl`	On the Game Chromatic Number of Sparse Random Graphs. SIAM J. Discret. Math. Alan M. Frieze, Simcha Haber, Mikhail Lavrov
2013	J	`jnl`	On the Non-Planarity of a Random Subgraph. Comb. Probab. Comput. Alan M. Frieze, Michael Krivelevich
2013	J	`jnl`	Randomly coloring constant degree graphs. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
2013	J	`jnl`	Special Issue on Algorithms and Models for the Web Graph. Internet Math. Alan M. Frieze, Paul Horn, Pawel Pralat
2013	J	`jnl`	Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). SIAM J. Comput. Chris Peikert, Robert Kleinberg, Aravind Srinivasan, Alan M. Frieze, Alexander Russell, Leonard J. Schulman
2013	J	`jnl`	The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci. Colin Cooper, Alan M. Frieze, Tomasz Radzik
2013	J	`jnl`	Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms Andrzej Dudek, Alan M. Frieze
2012	J	`jnl`	A greedy algorithm for finding a large 2-matching on a random cubic graph CoRR Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
2012	—	`conf`	Analyzing Walksat on Random Formulas. ANALCO Amin Coja-Oghlan, Alan M. Frieze
2012	J	`jnl`	Cops and Robbers on Geometric Graphs. Comb. Probab. Comput. Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller
2012	J	`jnl`	Cover time of a random graph with given degree sequence. Discret. Math. Mohammed Amin Abdullah, Colin Cooper, Alan M. Frieze
2012	J	`jnl`	Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables. Random Struct. Algorithms Alan M. Frieze, Páll Melsted
2012	C	`conf`	On Certain Properties of Random Apollonian Networks. WAW Alan M. Frieze, Charalampos E. Tsourakakis
2012	J	`jnl`	On the chromatic number of a random hypergraph CoRR Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
2012	J	`jnl`	Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. Electron. J. Comb. Andrzej Dudek, Alan M. Frieze, Po-Shen Loh, Shelley Speiss
2012	J	`jnl`	Packing Tight Hamilton Cycles in Uniform Hypergraphs. SIAM J. Discret. Math. Deepak Bal, Alan M. Frieze
2012	J	`jnl`	Packing hamilton cycles in random and pseudo-random hypergraphs. Random Struct. Algorithms Alan M. Frieze, Michael Krivelevich
2012	J	`jnl`	Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2012	J	`jnl`	Rainbow Connection of Sparse Random Graphs. Electron. J. Comb. Alan M. Frieze, Charalampos E. Tsourakakis
2012	—	`conf`	Rainbow Connectivity of Sparse Random Graphs. APPROX-RANDOM Alan M. Frieze, Charalampos E. Tsourakakis
2012	J	`jnl`	Rainbow Connectivity of Sparse Random Graphs. CoRR Alan M. Frieze, Charalampos E. Tsourakakis
2012	J	`jnl`	Rainbow Hamilton Cycles in Uniform Hypergraphs. Electron. J. Comb. Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski
2012	C	`conf`	Some Typical Properties of the Spatial Preferred Attachment Model. WAW Colin Cooper, Alan M. Frieze, Pawel Pralat
2012	J	`jnl`	Stationary distribution and cover time of random walks on random digraphs. J. Comb. Theory B Colin Cooper, Alan M. Frieze
2012	J	`jnl`	Variations on cops and robbers. J. Graph Theory Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2011	C	`ed.`	Algorithms and Models for the Web Graph - 8th International Workshop, WAW 2011, Atlanta, GA, USA, May 27-29, 2011. Proceedings WAW Alan M. Frieze, Paul Horn, Pawel Pralat
2011	J	`jnl`	An Analysis of Random-Walk Cuckoo Hashing. SIAM J. Comput. Alan M. Frieze, Páll Melsted, Michael Mitzenmacher
2011	J	`jnl`	Analyzing Walksat on random formulas CoRR Amin Coja-Oghlan, Alan M. Frieze
2011	A*	`conf`	Component structure of the vacant set induced by a random walk on a random graph. SODA Colin Cooper, Alan M. Frieze
2011	J	`jnl`	Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). Dagstuhl Reports Martin E. Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski
2011	J	`jnl`	High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks CoRR Alan M. Frieze, Charalampos E. Tsourakakis
2011	J	`jnl`	Karp-Sipser on Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. Tom Bohman, Alan M. Frieze
2011	J	`jnl`	Loose Hamilton Cycles in Random Uniform Hypergraphs. Electron. J. Comb. Andrzej Dudek, Alan M. Frieze
2011	A*	`conf`	Packing tight Hamilton cycles in 3-uniform hypergraphs. SODA Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2011	J	`jnl`	Ramsey games with giants. Random Struct. Algorithms Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov
2011	J	`jnl`	Random greedy triangle-packing beyond the 7/4 barrier CoRR Tom Bohman, Alan M. Frieze, Eyal Lubetzky
2011	J	`jnl`	Randomly coloring simple hypergraphs. Inf. Process. Lett. Alan M. Frieze, Páll Melsted
2011	J	`jnl`	Stationary distribution and cover time of random walks on random digraphs CoRR Colin Cooper, Alan M. Frieze
2011	B	`conf`	The Cover Times of Random Walks on Hypergraphs. SIROCCO Colin Cooper, Alan M. Frieze, Tomasz Radzik
2011	J	`jnl`	The cover time of random geometric graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2010	J	`jnl`	A note on the random greedy triangle-packing algorithm CoRR Tom Bohman, Alan M. Frieze, Eyal Lubetzky
2010	J	`jnl`	An Efficient Sparse Regularity Concept. SIAM J. Discret. Math. Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze
2010	J	`jnl`	Anti-Ramsey properties of random graphs. J. Comb. Theory B Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliff Smyth
2010	J	`jnl`	Average case performance of heuristics for multi-dimensional assignment problems CoRR Alan M. Frieze, Gregory B. Sorkin
2010	J	`jnl`	Average-case performance of heuristics for three-dimensional assignment problems CoRR Alan M. Frieze, Gregory B. Sorkin
2010	J	`jnl`	Coloring H-free hypergraphs. Random Struct. Algorithms Tom Bohman, Alan M. Frieze, Dhruv Mubayi
2010	J	`jnl`	Component structure induced by a random walk on a random graph CoRR Colin Cooper, Alan M. Frieze
2010	J	`jnl`	Finding a maximum matching in a sparse random graph in J. ACM Prasad Chebolu, Alan M. Frieze, Páll Melsted
2010	J	`jnl`	Flips in Graphs. SIAM J. Discret. Math. Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko
2010	J	`jnl`	Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze, Michael Krivelevich
2010	J	`jnl`	Hypergraphs with independent neighborhoods. Comb. Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko
2010	J	`jnl`	Logconcave Random Graphs. Electron. J. Comb. Alan M. Frieze, Santosh S. Vempala, Juan Vera
2010	J	`jnl`	Loose Hamilton Cycles in Random 3-Uniform Hypergraphs. Electron. J. Comb. Alan M. Frieze
2010	J	`jnl`	Random Walks with Look-Ahead in Scale-Free Random Graphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2010	J	`jnl`	Randomly coloring random graphs. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze
2009	—	`conf`	An Analysis of Random-Walk Cuckoo Hashing. APPROX-RANDOM Alan M. Frieze, Páll Melsted, Michael Mitzenmacher
2009	A*	`conf`	An efficient sparse regularity concept. SODA Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze
2009	—	`conf`	Average-Case Analyses of Vickrey Costs. APPROX-RANDOM Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin
2009	J	`jnl`	Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2009	J	`jnl`	Hamilton cycles in 3-out. Random Struct. Algorithms Tom Bohman, Alan M. Frieze
2009	J	`jnl`	Line-of-Sight Networks. Comb. Probab. Comput. Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany
2009	J	`jnl`	Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables CoRR Alan M. Frieze, Páll Melsted
2009	J	`jnl`	Memoryless Rules for Achlioptas Processes. SIAM J. Discret. Math. Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko
2009	—	`conf`	Multiple Random Walks and Interacting Particle Systems. ICALP (2) Colin Cooper, Alan M. Frieze, Tomasz Radzik
2009	J	`jnl`	Multiple Random Walks in Random Regular Graphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze, Tomasz Radzik
2009	A*	`conf`	On smoothed SODA Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik
2009	J	`jnl`	Randomly colouring simple hypergraphs CoRR Alan M. Frieze, Páll Melsted
2009	A*	`conf`	The cover time of random geometric graphs. SODA Colin Cooper, Alan M. Frieze
2008	—	`conf`	A new approach to the planted clique problem. FSTTCS Alan M. Frieze, Ravi Kannan
2008	—	`conf`	Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. ICALP (1) Prasad Chebolu, Alan M. Frieze, Páll Melsted
2008	J	`jnl`	Game chromatic index of graphs with given restrictions on degrees. Theor. Comput. Sci. Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko
2008	J	`jnl`	Hamilton Cycles in Random Lifts of Directed Graphs. SIAM J. Discret. Math. Prasad Chebolu, Alan M. Frieze
2008	A*	`conf`	Logconcave random graphs. STOC Alan M. Frieze, Santosh S. Vempala, Juan Vera
2008	J	`jnl`	On Rainbow Trees and Cycles. Electron. J. Comb. Alan M. Frieze, Michael Krivelevich
2008	J	`jnl`	On the Chromatic Number of Simple Triangle-Free Triple Systems. Electron. J. Comb. Alan M. Frieze, Dhruv Mubayi
2008	—	`conf`	Random Walks on Random Graphs. NanoNet Colin Cooper, Alan M. Frieze
2008	J	`jnl`	Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k. Electron. J. Comb. Amin Coja-Oghlan, Alan M. Frieze
2008	J	`jnl`	The cover time of the giant component of a random graph. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2008	J	`jnl`	The game chromatic number of random graphs. Random Struct. Algorithms Tom Bohman, Alan M. Frieze, Benny Sudakov
2007	C	`conf`	A Geometric Preferential Attachment Model of Networks II. WAW Abraham D. Flaxman, Alan M. Frieze, Juan Vera
2007	J	`jnl`	A Geometric Preferential Attachment Model of Networks II. Internet Math. Abraham D. Flaxman, Alan M. Frieze, Juan Vera
2007	J	`jnl`	A Geometric Preferential Attachment Model of Networks. Internet Math. Abraham D. Flaxman, Alan M. Frieze, Juan Vera
2007	J	`jnl`	Adversarial Deletion in a Scale-Free Random Graph Process. Comb. Probab. Comput. Abraham D. Flaxman, Alan M. Frieze, Juan Vera
2007	J	`jnl`	Codes identifying sets of vertices in random networks. Discret. Math. Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth
2007	J	`jnl`	First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky
2007	A*	`conf`	Line-of-sight networks. SODA Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany
2007	J	`jnl`	On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. Comb. Probab. Comput. Abraham D. Flaxman, Alan M. Frieze, Juan Carlos Vera
2007	J	`jnl`	On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. Alan M. Frieze, Michael Krivelevich, Cliff Smyth
2007	J	`jnl`	Random 2-SAT with Prescribed Literal Degrees. Algorithmica Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
2007	J	`jnl`	Randomly generated intersecting hypergraphs II. Random Struct. Algorithms Tom Bohman, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó, Cliff Smyth
2007	B	`conf`	Separating Populations with Wide Data: A Spectral Analysis. ISAAC Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou
2007	—	`conf`	The Cover Time of Random Digraphs. APPROX-RANDOM Colin Cooper, Alan M. Frieze
2007	J	`jnl`	The Influence of Search Engines on Preferential Attachment. Internet Math. Alan M. Frieze, Juan Vera, Soumen Chakrabarti
2007	J	`jnl`	The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. SIAM J. Comput. Alan M. Frieze, Gregory B. Sorkin
2007	J	`jnl`	The cover time of sparse random graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2007	J	`jnl`	The cover time of the preferential attachment graph. J. Comb. Theory B Colin Cooper, Alan M. Frieze
2007	J	`jnl`	The diameter of randomly perturbed digraphs and some applications. Random Struct. Algorithms Abraham D. Flaxman, Alan M. Frieze
2006	J	`jnl`	Almost universal graphs. Random Struct. Algorithms Alan M. Frieze, Michael Krivelevich
2006	J	`jnl`	Hamilton cycles in random lifts of graphs. Eur. J. Comb. K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze
2006	J	`jnl`	On randomly colouring locally sparse graphs. Discret. Math. Theor. Comput. Sci. Alan M. Frieze, Juan Vera
2006	J	`jnl`	On the random 2-stage minimum spanning tree. Random Struct. Algorithms Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich
2006	A*	`conf`	Random graphs. SODA Alan M. Frieze
2006	J	`jnl`	Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda
2006	J	`jnl`	The satisfiability threshold for randomly generated binary constraint satisfaction problems. Random Struct. Algorithms Alan M. Frieze, Michael Molloy
2005	A*	`conf`	Adversarial deletion in a scale free random graph process. SODA Abraham Flaxman, Alan M. Frieze, Juan Vera
2005	J	`jnl`	High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Math. Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner
2005	B	`conf`	Identifying codes in random networks. ISIT Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth
2005	J	`jnl`	On packing Hamilton cycles in ?-regular graphs. J. Comb. Theory B Alan M. Frieze, Michael Krivelevich
2005	A*	`conf`	On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. STOC Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
2005	A*	`conf`	On the random 2-stage minimum spanning tree. SODA Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich
2005	J	`jnl`	Perfect matchings in random bipartite graphs with minimal degree at least 2. Random Struct. Algorithms Alan M. Frieze
2005	J	`jnl`	Random Comb. Alan M. Frieze, Nicholas C. Wormald
2005	J	`jnl`	The Cover Time of Random Regular Graphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2005	J	`jnl`	The Strong Chromatic Index of Random Graphs. SIAM J. Discret. Math. Alan M. Frieze, Michael Krivelevich, Benny Sudakov
2005	A*	`conf`	The cover time of two classes of random graphs. SODA Colin Cooper, Alan M. Frieze
2005	A*	`conf`	The influence of search engines on preferential attachment. SODA Soumen Chakrabarti, Alan M. Frieze, Juan Vera
2004	C	`conf`	A Geometric Preferential Attachment Model of Networks. WAW Abraham Flaxman, Alan M. Frieze, Juan Vera
2004	J	`jnl`	Adding random edges to dense graphs. Random Struct. Algorithms Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan R. Martin
2004	J	`jnl`	Avoidance of a giant component in half the edge set of a random graph. Random Struct. Algorithms Tom Bohman, Alan M. Frieze, Nicholas C. Wormald
2004	J	`jnl`	Clustering Large Graphs via the Singular Value Decomposition. Mach. Learn. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala, V. Vinay
2004	J	`jnl`	Efficient communication in an ad-hoc network. J. Algorithms Abraham Flaxman, Alan M. Frieze, Eli Upfal
2004	J	`jnl`	Fast monte-carlo algorithms for finding low-rank approximations. J. ACM Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
2004	J	`jnl`	On Random Symmetric Travelling Salesman Problems. Math. Oper. Res. Alan M. Frieze
2004	J	`jnl`	On the b-Independence Number of Sparse Random Graphs. Comb. Probab. Comput. Geoffrey Atkinson, Alan M. Frieze
2004	A*	`conf`	Randomly Coloring Constant Degree Graphs. FOCS Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
2004	J	`jnl`	Randomly coloring constant degree graphs Electron. Colloquium Comput. Complex. Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
2004	—	`conf`	The Diameter of Randomly Perturbed Digraphs and Some Applications.. APPROX-RANDOM Abraham Flaxman, Alan M. Frieze
2004	J	`jnl`	The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze
2004	J	`jnl`	The emergence of a giant component in random subgraphs of pseudo-random graphs. Random Struct. Algorithms Alan M. Frieze, Michael Krivelevich, Ryan R. Martin
2003	J	`jnl`	A general model of web graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2003	J	`jnl`	A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theor. Comput. Sci. Martin E. Dyer, Alan M. Frieze, Michael Molloy
2003	—	`ch.`	Analytic Graph Theory. Handbook of Graph Theory Béla Bollobás, Vladimir Nikiforov, Nicholas C. Wormald, Ralph J. Faudree, Alan M. Frieze
2003	J	`jnl`	Arc-Disjoint Paths in Expander Digraphs. SIAM J. Comput. Tom Bohman, Alan M. Frieze
2003	J	`jnl`	Crawling on Simple Models of Web Graphs. Internet Math. Colin Cooper, Alan M. Frieze
2003	—	`conf`	High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. RANDOM-APPROX Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner
2003	J	`jnl`	How many random edges make a dense graph hamiltonian? Random Struct. Algorithms Tom Bohman, Alan M. Frieze, Ryan R. Martin
2003	J	`jnl`	On Randomly Generated Intersecting Hypergraphs. Electron. J. Comb. Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó
2003	A*	`conf`	Perfect matchings in random graphs with prescribed minimal degree. SODA Alan M. Frieze, Boris G. Pittel
2003	J	`jnl`	Random Deletion in a Scale-Free Random Graph Process. Internet Math. Colin Cooper, Alan M. Frieze, Juan Vera
2003	J	`jnl`	Randomly coloring graphs with lower bounds on girth and maximum degree. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze
2003	—	`conf`	The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. RANDOM-APPROX Alan M. Frieze, Michael Molloy
2003	A*	`conf`	The cover time of sparse random graphs. SODA Colin Cooper, Alan M. Frieze
2002	J	`jnl`	A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program. Sanjeev Arora, Alan M. Frieze, Haim Kaplan
2002	A*	`conf`	A note on random 2-SAT with prescribed literal degrees. SODA Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
2002	J	`jnl`	Addendum to avoiding a giant component. Random Struct. Algorithms Tom Bohman, Alan M. Frieze
2002	A*	`conf`	Balls and bins models with feedback. SODA Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher
2002	A*	`conf`	Crawling on web graphs. STOC Colin Cooper, Alan M. Frieze
2002	J	`jnl`	Hamilton cycles in random subgraphs of pseudo-random graphs. Discret. Math. Alan M. Frieze, Michael Krivelevich
2002	J	`jnl`	Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze
2002	J	`jnl`	On Counting Independent Sets in Sparse Graphs. SIAM J. Comput. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
2002	A*	`conf`	On Random Symmetric Travelling Salesman Problems. FOCS Alan M. Frieze
2002	J	`jnl`	On graph irregularity strength. J. Graph Theory Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender
2002	J	`jnl`	Optimal Sequencing by Hybridization in Rounds. J. Comput. Biol. Alan M. Frieze, Bjarni V. Halldórsson
2002	J	`jnl`	Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Bruce A. Reed
2002	J	`jnl`	Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan
2001	A	`conf`	A General Model of Undirected Web Graphs. ESA Colin Cooper, Alan M. Frieze
2001	J	`jnl`	A general approach to dynamic packet routing with bounded buffers. J. ACM Andrei Z. Broder, Alan M. Frieze, Eli Upfal
2001	A*	`conf`	Arc-Disjoint Paths in Expander Digraphs. FOCS Tom Bohman, Alan M. Frieze
2001	J	`jnl`	Avoiding a giant component. Random Struct. Algorithms Tom Bohman, Alan M. Frieze
2001	J	`jnl`	G-Intersecting Families. Comb. Probab. Comput. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
2001	J	`jnl`	Hamilton cycles in the union of random permutations. Random Struct. Algorithms Alan M. Frieze
2001	J	`jnl`	On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms Colin Cooper, Martin E. Dyer, Alan M. Frieze
2001	B	`conf`	Optimal sequencing by hybridization in rounds. RECOMB Alan M. Frieze, Bjarni V. Halldórsson
2001	A*	`conf`	Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. FOCS Martin E. Dyer, Alan M. Frieze
2001	A*	`conf`	The probabilistic relationship between the assignment and asymmetric traveling salesman problems. SODA Alan M. Frieze, Gregory B. Sorkin
2001	J	`jnl`	Vertex Covers by Edge Disjoint Cliques. Comb. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
2000	J	`jnl`	A Note on Random Minimum Length Spanning Trees. Electron. J. Comb. Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
2000	J	`jnl`	Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
2000	J	`jnl`	Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least J. Graph Theory Béla Bollobás, Colin Cooper, Trevor I. Fenner, Alan M. Frieze
2000	J	`jnl`	Edge-Disjoint Paths in Expander Graphs. SIAM J. Comput. Alan M. Frieze
2000	A*	`conf`	Edge-disjoint paths in expander graphs. SODA Alan M. Frieze
2000	J	`jnl`	Hamilton cycles in random graphs and directed graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2000	J	`jnl`	Min-Wise Independent Linear Permutations. Electron. J. Comb. Tom Bohman, Colin Cooper, Alan M. Frieze
2000	J	`jnl`	Min-Wise Independent Permutations. J. Comput. Syst. Sci. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
2000	J	`jnl`	Note on Sparse Random Graphs and Cover Graphs. Electron. J. Comb. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
2000	J	`jnl`	On the Number of Perfect Matchings and Hamilton Cycles in e-Regular Non-bipartite Graphs. Electron. J. Comb. Alan M. Frieze
2000	J	`jnl`	Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs. Comb. Probab. Comput. Alan M. Frieze, Lei Zhao
1999	J	`jnl`	A Simple Algorithm for Constructing Szemere'di's Regularity Partition. Electron. J. Comb. Alan M. Frieze, Ravi Kannan
1999	A*	`conf`	Clustering in Large Graphs and Matrices. SODA Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala, V. Vinay
1999	J	`jnl`	Mixing properties of the Swendsen-Wang process on classes of graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
1999	A*	`conf`	On Counting Independent Sets in Sparse Graphs. FOCS Martin E. Dyer, Alan M. Frieze, Mark Jerrum
1999	J	`jnl`	On Perfect Matchings and Hamilton Cycles in Sums of Random Trees. SIAM J. Discret. Math. Alan M. Frieze, Michal Karonski, Lubos Thoma
1999	B	`conf`	On the power of universal bases in sequencing by hybridization. RECOMB Franco P. Preparata, Alan M. Frieze, Eli Upfal
1999	A*	`conf`	Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs. SODA Alan M. Frieze, Lei Zhao
1999	J	`jnl`	Optimal Reconstruction of a Sequence from its Probes. J. Comput. Biol. Alan M. Frieze, Franco P. Preparata, Eli Upfal
1999	J	`jnl`	Quick Approximation to Matrices and Applications. Comb. Alan M. Frieze, Ravi Kannan
1999	J	`jnl`	Splitting an Expander Graph. J. Algorithms Alan M. Frieze, Michael Molloy
1999	J	`jnl`	Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Random Struct. Algorithms Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1999	A*	`conf`	Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. FOCS Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu
1998	J	`jnl`	A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
1998	J	`jnl`	Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM J. Comput. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
1998	J	`jnl`	Average-Case Analysis of the Merging Algorithm of Hwang and Lin. Algorithmica Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha
1998	—	`conf`	Disjoint Paths in Expander Graphs via Random Walks: A Short Survey. RANDOM Alan M. Frieze
1998	B	`conf`	Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1998	A*	`conf`	Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. FOCS Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
1998	J	`jnl`	Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. Algorithmica Alan M. Frieze, Wojciech Szpankowski
1998	J	`jnl`	Maximum matchings in sparse random graphs: Karp-Sipser revisited. Random Struct. Algorithms Jonathan Aronson, Alan M. Frieze, Boris G. Pittel
1998	A*	`conf`	Min-Wise Independent Permutations (Extended Abstract). STOC Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
1998	—	`conf`	On Balls and Bins with Deletions. RANDOM Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal
1998	J	`jnl`	Optimal Construction of Edge-Disjoint Paths in Random Graphs. SIAM J. Comput. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
1998	J	`jnl`	Random Minimum Length Spanning Trees in Regular Graphs. Comb. Andrew Beveridge, Alan M. Frieze, Colin McDiarmid
1997	J	`jnl`	Algorithmic theory of random graphs. Random Struct. Algorithms Alan M. Frieze, Colin McDiarmid
1997	—	`conf`	Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. RANDOM Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
1997	J	`jnl`	Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Algorithmica Alan M. Frieze, Mark Jerrum
1997	A*	`conf`	Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). STOC Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1996	A*	`conf`	A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1996	A*	`conf`	A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. FOCS Sanjeev Arora, Alan M. Frieze, Haim Kaplan
1996	A*	`conf`	A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. FOCS Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
1996	A*	`conf`	An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. SODA Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
1996	J	`jnl`	Analysis of Two Simple Heuristics on a Random Instance of k-SAT. J. Algorithms Alan M. Frieze, Stephen Suen
1996	J	`jnl`	Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph. Random Struct. Algorithms Hui Chen, Alan M. Frieze
1996	B	`conf`	Coloring Bipartite Hypergraphs. IPCO Hui Chen, Alan M. Frieze
1996	J	`jnl`	Generating and Counting Hamilton Cycles in Random Regular Graphs. J. Algorithms Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald
1996	A	`conf`	Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. ESA Alan M. Frieze, Wojciech Szpankowski
1996	A*	`conf`	Learning Linear Transformations. FOCS Alan M. Frieze, Mark Jerrum, Ravi Kannan
1996	J	`jnl`	On the Best Case of Heapsort. J. Algorithms Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
1996	J	`jnl`	Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed
1996	A*	`conf`	The Regularity Lemma and Approximation Schemes for Dense Problems. FOCS Alan M. Frieze, Ravi Kannan
1995	J	`jnl`	An Analysis of a Monte Carlo Algorithm for Estimating the Permanent. Comb. Alan M. Frieze, Mark Jerrum
1995	J	`jnl`	Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. Comb. Probab. Comput. Alan M. Frieze, A. J. Radcliffe, Stephen Suen
1995	J	`jnl`	Balanced Allocations for Tree-Like Inputs. Inf. Process. Lett. Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven J. Phillips, Nick Reingold
1995	J	`jnl`	Covering the Edges of a Random Graph by Cliques. Comb. Alan M. Frieze, Bruce A. Reed
1995	B	`conf`	Improved Approximation Algorithms for MAX IPCO Alan M. Frieze, Mark Jerrum
1995	J	`jnl`	Multicoloured Hamilton Cycles. Electron. J. Comb. Michael H. Albert, Alan M. Frieze, Bruce A. Reed
1995	J	`jnl`	Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. Electron. J. Comb. Colin Cooper, Alan M. Frieze
1995	J	`jnl`	On Key Storage in Secure Networks. J. Cryptol. Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason
1995	J	`jnl`	On the Connectivity of Random k-th Nearest Neighbour Graphs. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze
1995	J	`jnl`	Ordering Clone Libraries in Computational Biology. J. Comput. Biol. Martin E. Dyer, Alan M. Frieze, Stephen Suen
1995	J	`jnl`	Perfect Matchings in Random s-Uniform Hypergraphs. Random Struct. Algorithms Alan M. Frieze, Svante Janson
1995	J	`jnl`	Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Random Struct. Algorithms Noga Alon, Alan M. Frieze, Dominic Welsh
1995	J	`jnl`	Randomized Greedy Matching II. Random Struct. Algorithms Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
1995	J	`jnl`	The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal
1995	J	`jnl`	When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? SIAM J. Comput. Alan M. Frieze, Richard M. Karp, Bruce A. Reed
1994	A*	`conf`	Approximately Counting Hamilton Cycles in Dense Graphs. SODA Martin E. Dyer, Alan M. Frieze, Mark Jerrum
1994	J	`jnl`	Broadcasting in Random Graphs. Discret. Appl. Math. Alan M. Frieze, Michael Molloy
1994	J	`jnl`	Existence and Construction of Edge-Disjoint Paths on Expander Graphs. SIAM J. Comput. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1994	J	`jnl`	Finding Hidden Hamiltonian Cycles. Random Struct. Algorithms Andrei Z. Broder, Alan M. Frieze, Eli Shamir
1994	J	`jnl`	Hamilton Cycles in Random Regular Digraphs. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Michael Molloy
1994	J	`jnl`	Hamilton Cycles in a Class of Random Directed Graphs. J. Comb. Theory B Colin Cooper, Alan M. Frieze
1994	J	`jnl`	Introduction. Random Struct. Algorithms Alan M. Frieze, Svante Janson, Tomasz Luczak
1994	J	`jnl`	Multicolored Trees in Random Graphs. Random Struct. Algorithms Alan M. Frieze, Brendan D. McKay
1994	J	`jnl`	Near-perfect Token Distribution. Random Struct. Algorithms Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
1994	J	`jnl`	On the Complexity of Computing the Diameter of a Polytope. Comput. Complex. Alan M. Frieze, Shang-Hua Teng
1994	A*	`conf`	On the Greedy Heuristic for Matchings. SODA Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
1994	J	`jnl`	On the Independence Number of Random Cubic Graphs. Random Struct. Algorithms Alan M. Frieze, Stephen Suen
1994	J	`jnl`	On the Problem of Approximating the Number of Bases of a Matroid. Inf. Process. Lett. Yossi Azar, Andrei Z. Broder, Alan M. Frieze
1994	A*	`conf`	Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
1994	J	`jnl`	Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case Electron. Colloquium Comput. Complex. Noga Alon, Alan M. Frieze, Dominic Welsh
1994	A*	`conf`	Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs FOCS Noga Alon, Alan M. Frieze, Dominic Welsh
1994	J	`jnl`	Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Math. Program. Martin E. Dyer, Alan M. Frieze
1994	J	`jnl`	The Probability of Unique Solutions of Sequencing by Hybridization. J. Comput. Biol. Martin E. Dyer, Alan M. Frieze, Stephen Suen
1993	J	`jnl`	A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Comb. Probab. Comput. Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani
1993	A*	`conf`	Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. SODA Alan M. Frieze, A. J. Radcliffe, Stephen Suen
1993	A*	`conf`	On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1993	J	`jnl`	Polychromatic Hamilton cycles. Discret. Math. Alan M. Frieze, Bruce A. Reed
1992	J	`jnl`	Counting the Number of Hamilton Cycles in Random Digraphs. Random Struct. Algorithms Alan M. Frieze, Stephen Suen
1992	A*	`conf`	Existence and Construction of Edge Disjoint Paths on Expander Graphs STOC Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1992	A*	`conf`	Near-perfect Token Distribution. ICALP Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
1992	J	`jnl`	On Subgraph Sizes in Random Graphs. Comb. Probab. Comput. Neil J. Calkin, Alan M. Frieze, Brendan D. McKay
1992	J	`jnl`	On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. Random Struct. Algorithms Neil J. Calkin, Alan M. Frieze, Ludek Kucera
1992	J	`jnl`	On the independence and chromatic numbers of random regular graphs. J. Comb. Theory B Alan M. Frieze, Tomasz Luczak
1992	J	`jnl`	Probabilistic analysis of the generalised assignment problem. Math. Program. Martin E. Dyer, Alan M. Frieze
1992	B	`conf`	Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. IPCO Martin E. Dyer, Alan M. Frieze
1992	B	`conf`	Separator Based Parallel Divide and Conquer in Computational Geometry. SPAA Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
1992	B	`conf`	When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? IPCO Alan M. Frieze, Richard M. Karp, Bruce A. Reed
1991	J	`jnl`	A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. J. ACM Martin E. Dyer, Alan M. Frieze, Ravi Kannan
1991	A*	`conf`	Finding Hidden Hamiltonian Cycles (Extended Abstract) STOC Andrei Z. Broder, Alan M. Frieze, Eli Shamir
1991	J	`jnl`	Occupancy problems and random algebras. Discret. Math. Michael H. Albert, Alan M. Frieze
1991	J	`jnl`	Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze
1991	J	`jnl`	Randomized Greedy Matching. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze
1991	J	`jnl`	Spanning Maximal Planar Subgraphs of Random Graphs. Random Struct. Algorithms Béla Bollobás, Alan M. Frieze
1990	J	`jnl`	Greedy Matching on the Line. SIAM J. Comput. Alan M. Frieze, Colin McDiarmid, Bruce A. Reed
1990	J	`jnl`	On Patching Algorithms for Random Asymmetric Travelling Salesman Problems. Math. Program. Martin E. Dyer, Alan M. Frieze
1990	J	`jnl`	On an optimization problem with nested constraints. Discret. Appl. Math. Martin E. Dyer, Alan M. Frieze
1990	J	`jnl`	On the independence number of random graphs. Discret. Math. Alan M. Frieze
1990	J	`jnl`	Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. Random Struct. Algorithms Neil J. Calkin, Alan M. Frieze
1990	B	`conf`	Probabilistic Analysis of the Generalised Assignment Problem. IPCO Martin E. Dyer, Alan M. Frieze
1990	J	`jnl`	The limiting probability that alpha-in, ß-out is strongly connected. J. Comb. Theory B Colin Cooper, Alan M. Frieze
1989	A*	`conf`	A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies STOC Martin E. Dyer, Alan M. Frieze, Ravi Kannan
1989	J	`jnl`	A randomized algorithm for fixed-dimensional linear programming. Math. Program. Martin E. Dyer, Alan M. Frieze
1989	J	`jnl`	Algorithms for assignment problems on an array processor. Parallel Comput. Alan M. Frieze, J. Yadegar, S. El-Horbaty, Dennis Parkinson
1989	J	`jnl`	On random minimum lenght spanning trees. Comb. Alan M. Frieze, Colin J. H. McDiarmid
1989	J	`jnl`	On the number of hamilton cycles in a random graph. J. Graph Theory Colin Cooper, Alan M. Frieze
1989	J	`jnl`	Probabilistic Analysis of the Multidimensional Knapsack Problem. Math. Oper. Res. Martin E. Dyer, Alan M. Frieze
1989	J	`jnl`	Survival time of a random graph. Comb. Alan M. Frieze
1989	J	`jnl`	The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. J. Algorithms Martin E. Dyer, Alan M. Frieze
1988	J	`jnl`	An Algorithm for Finding Hamilton Cycles in Random Directed Graphs. J. Algorithms Alan M. Frieze
1988	J	`jnl`	Edge-colouring random graphs. J. Comb. Theory B Alan M. Frieze, Bill Jackson, Colin J. H. McDiarmid, Bruce A. Reed
1988	J	`jnl`	Finding hamilton cycles in sparse random graphs. J. Comb. Theory B Alan M. Frieze
1988	J	`jnl`	On the Complexity of Computing the Volume of a Polyhedron. SIAM J. Comput. Martin E. Dyer, Alan M. Frieze
1988	J	`jnl`	On the Random Construction of Heaps. Inf. Process. Lett. Alan M. Frieze
1988	J	`jnl`	Partitioning random graphs into large cycles. Discret. Math. Alan M. Frieze
1988	J	`jnl`	Probabilistic Analysis of a Relaxation for the Math. Oper. Res. Sang Ahn, Colin Cooper, Gérard Cornuéjols, Alan M. Frieze
1988	J	`jnl`	Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAM J. Comput. Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir
1987	J	`jnl`	An algorithm for finding Hamilton cycles in a random graph. Comb. Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
1987	J	`jnl`	Large holes in sparse random graphs. Comb. Alan M. Frieze, Bill Jackson
1987	J	`jnl`	Large induced trees in sparse random graphs. J. Comb. Theory B Alan M. Frieze, Bill Jackson
1987	J	`jnl`	On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients. SIAM J. Comput. Alan M. Frieze
1987	J	`jnl`	Parallel Algorithms for Finding Hamilton Cycles in Random Graphs. Inf. Process. Lett. Alan M. Frieze
1986	A*	`conf`	Fast Solution of Some Random NP-Hard Problems FOCS Martin E. Dyer, Alan M. Frieze
1986	J	`jnl`	Maximum matchings in a class of random graphs. J. Comb. Theory B Alan M. Frieze
1986	J	`jnl`	On large matchings and cycles in sparse random graphs. Discret. Math. Alan M. Frieze
1986	J	`jnl`	On linear programs with random costs. Math. Program. Martin E. Dyer, Alan M. Frieze, Colin J. H. McDiarmid
1986	J	`jnl`	On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem. SIAM J. Comput. Alan M. Frieze
1986	J	`jnl`	Planar 3DM is NP-Complete. J. Algorithms Martin E. Dyer, Alan M. Frieze
1985	A*	`conf`	An Algorithm for Finding Hamilton Cycles in a Random Graph STOC Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
1985	J	`jnl`	An Algorithm for Finding a Matroid Basis which Maximizes the Products of the Weights of the Elements. BIT Trevor I. Fenner, Alan M. Frieze
1985	J	`jnl`	Limit Distribution for the Existence of Hamiltonian Cycles in Random Bipartite Graphs. Eur. J. Comb. Alan M. Frieze
1985	J	`jnl`	On the complexity of partitioning graphs into connected subgraphs. Discret. Appl. Math. Martin E. Dyer, Alan M. Frieze
1985	J	`jnl`	On the value of a random minimum spanning tree problem. Discret. Appl. Math. Alan M. Frieze
1985	J	`jnl`	The shortest-path problem for graphs with random arc-lengths. Discret. Appl. Math. Alan M. Frieze, Geoffrey R. Grimmett
1984	J	`jnl`	A Partitioning Algorithm for Minimum Weighted Euclidean Matching. Inf. Process. Lett. Martin E. Dyer, Alan M. Frieze
1984	J	`jnl`	Hamiltonian cycles in random regular graphs. J. Comb. Theory B Trevor I. Fenner, Alan M. Frieze
1984	A*	`conf`	Linear Congruential Generators Do Not Produce Random Sequences FOCS Alan M. Frieze, Ravi Kannan, J. C. Lagarias
1983	J	`jnl`	An extension of Christofides heuristic to the k-person travelling salesman problem. Discret. Appl. Math. Alan M. Frieze
1983	J	`jnl`	Corrigendum: Algebraic Linear Programming. Math. Oper. Res. Alan M. Frieze
1983	J	`jnl`	On the existence of Hamiltonian cycles in a class of random graphs. Discret. Math. Trevor I. Fenner, Alan M. Frieze
1983	J	`jnl`	On the quadratic assignment problem. Discret. Appl. Math. Alan M. Frieze, J. Yadegar
1982	J	`jnl`	Algebraic Linear Programming. Math. Oper. Res. Alan M. Frieze
1982	J	`jnl`	On the connectivity of random m-orientable graphs and digraphs. Comb. Trevor I. Fenner, Alan M. Frieze
1982	J	`jnl`	On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks Alan M. Frieze, Giulia Galbiati, Francesco Maffioli
1980	J	`jnl`	Probabilistic analysis of some euclidean clustering problems. Discret. Appl. Math. Alan M. Frieze
1979	J	`jnl`	An algorithm for algebraic assignment problems. Discret. Appl. Math. Alan M. Frieze
1976	J	`jnl`	Shortest path algorithms for knapsack type problems. Math. Program. Alan M. Frieze
1974	J	`jnl`	A bilinear programming formulation of the 3-dimensional assignment problem. Math. Program. Alan M. Frieze
1974	J	`jnl`	A cost function property for plant location problems. Math. Program. Alan M. Frieze