Alan M. Frieze

ORCID

Publication Activity (10 Years)

Years Active: 1974-2024
Publications (10 Years): 99

Top Venues

CoRR

Random Struct. Algorithms

SIAM J. Discret. Math.

Electron. J. Comb.

Publications

Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
On the Concentration of the Maximum Degree in the Duplication-Divergence Models. SIAM J. Discret. Math. 38 (1) (2024)
Deepak Bal, Alan M. Frieze, Pawel Pralat
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\). SIAM J. Discret. Math. 38 (1) (2024)
Alan M. Frieze, Xavier Pérez-Giménez
Rainbow Hamilton cycles in random geometric graphs. Random Struct. Algorithms 64 (4) (2024)
Tolson Bell, Alan M. Frieze
O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold. CoRR (2024)
Patrick Bennett, Alan M. Frieze
On the Chromatic Number of Random Regular Hypergraphs. SIAM J. Discret. Math. 38 (2) (2024)
Tolson Bell, Alan M. Frieze
. J. Graph Theory 105 (4) (2024)
Alan M. Frieze, Wesley Pegden
The bright side of simple heuristics for the TSP. CoRR (2023)
Alan M. Frieze, Wesley Pegden
Multitrees in Random Graphs. Electron. J. Comb. 30 (1) (2023)
Alan M. Frieze, Wesley Pegden
Subexponential mixing for partition chains on grid-like graphs. SODA (2023)
Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
On the concentration of the maximum degree in the duplication-divergence models. CoRR (2023)
Alan M. Frieze, Pu Gao, Calum MacRury, Pawel Pralat, Gregory B. Sorkin
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds. CoRR (2023)
Alan M. Frieze, Wesley Pegden
Spanners in randomly weighted graphs: Euclidean case. J. Graph Theory 104 (1) (2023)
Alan M. Frieze
On the expected efficiency of branch and bound for the asymmetric TSP. CoRR (2023)
Debsoumya Chakraborti, Alan M. Frieze, Mihir Hasabnis
Colorful Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. 37 (1) (2023)
Michael Anastos, Alan M. Frieze
A scaling limit for the length of the longest cycle in a sparse random digraph. Random Struct. Algorithms 60 (1) (2022)
Alan M. Frieze, Tomasz Tkocz
A Randomly Weighted Minimum Arborescence with a Random Cost Constraint. Math. Oper. Res. 47 (2) (2022)
Deepak Bal, Alan M. Frieze, Pawel Pralat
. CoRR (2022)
C. J. Argue, Alan M. Frieze, Anupam Gupta, Christopher Seiler
Learning from a Sample in Online Algorithms. NeurIPS (2022)
Hüseyin Acan, Alan M. Frieze, Boris G. Pittel
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. J. Appl. Probab. 59 (2) (2022)
Colin Cooper, Alan M. Frieze
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs. SIAM J. Discret. Math. 36 (3) (2022)
Alan M. Frieze, Wesley Pegden, Tomasz Tkocz
On the Cover Time of the Emerging Giant. SIAM J. Discret. Math. 36 (3) (2022)
Andrzej Dudek, Sean English, Alan M. Frieze, Calum MacRury, Pawel Pralat
Localization game for random graphs. Discret. Appl. Math. 309 (2022)
Alan M. Frieze, Wesley Pegden
Subexponential mixing for partition chains on grid-like graphs. CoRR (2022)
Alan M. Frieze, Wesley Pegden
Spanners in randomly weighted graphs: Independent edge lengths. Discret. Appl. Math. 309 (2022)
Alan M. Frieze, Wesley Pegden, Gregory B. Sorkin, Tomasz Tkocz
Minimum-Weight Combinatorial Structures Under Random Cost-Constraints. Electron. J. Comb. 28 (1) (2021)
Debsoumya Chakraborti, Alan M. Frieze, Simi Haber, Mihir Hasabnis
-uniform hypergraphs. Inf. Process. Lett. 166 (2021)
Michael Anastos, Alan M. Frieze
A scaling limit for the length of the longest cycle in a sparse random graph. J. Comb. Theory, Ser. B 148 (2021)
Alan M. Frieze, Wesley Pegden
Maker Breaker on digraphs. J. Graph Theory 98 (4) (2021)
Alan M. Frieze, Wesley Pegden
Spanners in randomly weighted graphs: independent edge lengths. CoRR (2021)
Alan M. Frieze, Tomasz Tkocz
A Randomly Weighted Minimum Spanning Tree with a Random Cost Constraint. Electron. J. Comb. 28 (1) (2021)
Michael Anastos, Alan M. Frieze
Finding maximum matchings in random regular graphs in linear expected time. Random Struct. Algorithms 58 (3) (2021)
Alan M. Frieze
The Effect of Adding Randomly Weighted Edges. SIAM J. Discret. Math. 35 (2) (2021)
Michael Anastos, Alan M. Frieze, Pu Gao
Hamiltonicity of Random Graphs in the Stochastic Block Model. SIAM J. Discret. Math. 35 (3) (2021)
Alan M. Frieze, Tomasz Tkocz
Shortest paths with a cost constraint: A probabilistic analysis. Discret. Appl. Math. 302 (2021)
Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
The Concentration of the Maximum Degree in the Duplication-Divergence Models. COCOON (2021)
Alan M. Frieze, Tomasz Tkocz
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. Oper. Res. Lett. 49 (3) (2021)
Alan M. Frieze, Wesley Pegden, Tomasz Tkocz
On random multi-dimensional assignment problems. Discret. Appl. Math. 287 (2020)
Michael Anastos, Alan M. Frieze
On the connectivity of proper colorings of random graphs and hypergraphs. Random Struct. Algorithms 56 (4) (2020)
Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
Degree Distribution for Duplication-Divergence Graphs: Large Deviations. WG (2020)
Alan M. Frieze, Xavier Pérez-Giménez, Pawel Pralat
On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph. Electron. J. Comb. 27 (4) (2020)
Alan M. Frieze, Tomasz Tkocz
Random Graphs with a Fixed Maximum Degree. SIAM J. Discret. Math. 34 (1) (2020)
Alan M. Frieze, Tomasz Tkocz
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. CoRR (2020)
Alan M. Frieze, Tomasz Tkocz
A randomly weighted minimum spanning tree with a random cost constraint. SODA (2020)
Michael Anastos, Alan M. Frieze
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis. Random Struct. Algorithms 57 (4) (2020)
Alan M. Frieze
Karp's patching algorithm on dense digraphs. CoRR (2020)
Michael Anastos, Alan M. Frieze
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? J. Graph Theory 92 (4) (2019)
Alan M. Frieze, Tomasz Tkocz
A Note on Log-Concave Random Graphs. Electron. J. Comb. 26 (3) (2019)
Colin Cooper, Alan M. Frieze, Wesley Pegden
On the rank of a random binary matrix. SODA (2019)
Andrzej Dudek, Sean English, Alan M. Frieze
A Random Variant of the Game of Plates and Olives. SIAM J. Discret. Math. 33 (3) (2019)
Alan M. Frieze, Tony Johansson
On the insertion time of random walk cuckoo hashing. Random Struct. Algorithms 54 (4) (2019)
Andrzej Dudek, Alan M. Frieze, Wesley Pegden
A note on the localization number of random graphs: Diameter two case. Discret. Appl. Math. 254 (2019)
Alan M. Frieze, Tomasz Tkocz
A randomly weighted minimum arborescence with a random cost constraint. CoRR (2019)
Colin Cooper, Alan M. Frieze, Wesley Pegden
On the Cover Time of Dense Graphs. SIAM J. Discret. Math. 33 (3) (2019)
Colin Cooper, Alan M. Frieze, Wesley Pegden
On the Rank of a Random Binary Matrix. Electron. J. Comb. 26 (4) (2019)
Alan M. Frieze, Wesley Pegden, Tomasz Tkocz
On random multi-dimensional assignment problems. CoRR (2019)
Alan M. Frieze, Xavier Pérez-Giménez, Pawel Pralat, Benjamin Reiniger
Perfect matchings and Hamiltonian cycles in the preferential attachment model. Random Struct. Algorithms 54 (2) (2019)
Michael Anastos, Alan M. Frieze
On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs. APPROX-RANDOM (2019)
Alan M. Frieze, Wesley Pegden
Traveling in randomly embedded random graphs. Random Struct. Algorithms 55 (3) (2019)
Colin Cooper, Alan M. Frieze, Wesley Pegden
Minors of a random binary matroid. Random Struct. Algorithms 55 (4) (2019)
Michael Anastos, Alan M. Frieze
Pattern Colored Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. 33 (1) (2019)
Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed
Notes on growing a tree in a graph. Random Struct. Algorithms 55 (2) (2019)
Colin Cooper, Alan M. Frieze, Tony Johansson
The cover time of a biased random walk on a random cubic graph. CoRR (2018)
Alan M. Frieze, Wesley Pegden, Gregory B. Sorkin
The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights. SIAM J. Discret. Math. 32 (3) (2018)
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
A greedy algorithm for finding a large 2-matching on a random cubic graph. J. Graph Theory 88 (3) (2018)
Colin Cooper, Alan M. Frieze, Tony Johansson
The Cover Time of a Biased Random Walk on a Random Cubic Graph. AofA (2018)
Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolás Rivera
Discordant Voting Processes on Finite Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Alan M. Frieze, Samantha Petti
Balanced allocation through random walk. Inf. Process. Lett. 131 (2018)
Andrzej Dudek, Sean English, Alan M. Frieze
On Rainbow Hamilton Cycles in Random Hypergraphs. Electron. J. Comb. 25 (2) (2018)
Alan M. Frieze, Wesley Pegden
Online purchasing under uncertainty. Random Struct. Algorithms 53 (2) (2018)
Alan M. Frieze, Tony Johansson
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph. Comb. Probab. Comput. 27 (2) (2018)
Michael Anastos, Alan M. Frieze, Wesley Pegden
Constraining the Clustering Transition for Colorings of Sparse Random Graphs. Electron. J. Comb. 25 (1) (2018)
Alan M. Frieze, Wesley Pegden
A note on dispersing particles on a line. Random Struct. Algorithms 53 (4) (2018)
Colin Cooper, Alan M. Frieze, Samantha Petti
. ANALCO (2018)
Lisa Espig, Alan M. Frieze, Michael Krivelevich
Elegantly Colored Paths and Cycles in Edge Colored Random Graphs. SIAM J. Discret. Math. 32 (3) (2018)
Colin Cooper, Alan M. Frieze, Wesley Pegden
On the cover time of dense graphs. CoRR (2018)
Michael Anastos, Alan M. Frieze
On the connectivity threshold for colorings of random graphs and hypergraphs. CoRR (2018)
Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Packing Hamilton Cycles Online. Comb. Probab. Comput. 27 (4) (2018)
Alan M. Frieze, Tony Johansson
-out subgraphs of large graphs. Random Struct. Algorithms 50 (2) (2017)
Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed
Notes on Growing a Tree in a Graph. CoRR (2017)
Michael Anastos, Alan M. Frieze
Randomly coloring simple hypergraphs with fewer colors. CoRR (2017)
Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. J. Comb. Theory, Ser. B 122 (2017)
Alan M. Frieze, Wesley Pegden
Traveling in Randomly Embedded Random Graphs. APPROX-RANDOM (2017)
Alan M. Frieze, Tony Johansson
Minimum Cost Matching in a Random Graph with Random Costs. SIAM J. Discret. Math. 31 (1) (2017)
Alan M. Frieze, Wesley Pegden
Separating subadditive euclidean functionals. Random Struct. Algorithms 51 (3) (2017)
Alan M. Frieze, Samantha Petti
Balanced Allocation Through Random Walk. CoRR (2017)
Colin Cooper, Alan M. Frieze, Samantha Petti
. CoRR (2017)
Alan M. Frieze, Michael Anastos
Randomly coloring simple hypergraphs with fewer colors. Inf. Process. Lett. 126 (2017)
Alan M. Frieze, Tony Johansson
On the insertion time of random walk cuckoo hashing. SODA (2017)
Patrick Bennett, Andrzej Dudek, Alan M. Frieze, Laars Helenius
Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs. Electron. J. Comb. 23 (2) (2016)
Colin Cooper, Alan M. Frieze
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. SIAM J. Discret. Math. 30 (1) (2016)
Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
Discordant Voting Processes on Finite Graphs. ICALP (2016)
Deepak Bal, Alan M. Frieze
Rainbow matchings and Hamilton cycles in random graphs. Random Struct. Algorithms 48 (3) (2016)
Alan M. Frieze, Wesley Pegden
Online purchasing under uncertainty. CoRR (2016)
Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
Discordant voting processes on finite graphs. CoRR (2016)
Alan M. Frieze, Tony Johansson
On the insertion time of random walk cuckoo hashing. CoRR (2016)
Alan M. Frieze, Wesley Pegden
Scalefree hardness of average-case Euclidean TSP approximation. CoRR (2016)
Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat
Rainbow Arborescence in Random Digraphs. J. Graph Theory 83 (3) (2016)
Alan M. Frieze, Wesley Pegden
Separating subadditive euclidean functionals. STOC (2016)
Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer
On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. 25 (1) (2016)
Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
Loose Hamilton Cycles in Regular Hypergraphs. Comb. Probab. Comput. 24 (1) (2015)

Alan M. Frieze.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alan M. Frieze