default search action
Alan M. Frieze
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
- award (1991): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j316]Alan M. Frieze, Patrick Bennett, Andrew Newman, Wesley Pegden:
On the Intersecting Family Process. Electron. J. Comb. 31(4) (2024) - [j315]Alan M. Frieze, Wesley Pegden:
The Bright Side of Simple Heuristics for the TSP. Electron. J. Comb. 31(4) (2024) - [j314]Tolson Bell
, Alan M. Frieze
Rainbow powers of a Hamilton cycle in Gn,p. J. Graph Theory 105(4): 491-500 (2024) - [j313]Alan M. Frieze, Xavier Pérez-Giménez:
Rainbow Hamilton cycles in random geometric graphs. Random Struct. Algorithms 64(4): 878-898 (2024) - [j312]Deepak Bal, Alan M. Frieze
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\). SIAM J. Discret. Math. 38(1): 867-882 (2024) - [j311]Alan M. Frieze
On the Concentration of the Maximum Degree in the Duplication-Divergence Models. SIAM J. Discret. Math. 38(1): 988-1006 (2024) - [j310]Patrick Bennett, Alan M. Frieze
On the Chromatic Number of Random Regular Hypergraphs. SIAM J. Discret. Math. 38(2): 1369-1380 (2024) - [j309]Tolson Bell, Alan M. Frieze
Rainbow Thresholds. SIAM J. Discret. Math. 38(3): 2361-2369 (2024) - [c98]Tolson Bell, Alan M. Frieze:
O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold. FOCS 2024: 106-119 - [i40]Tolson Bell
O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold. CoRR abs/2401.14394 (2024) - 2023
- [j308]Alan M. Frieze, Wesley Pegden
Multitrees in Random Graphs. Electron. J. Comb. 30(1) (2023) - [j307]Alan M. Frieze
Spanners in randomly weighted graphs: Euclidean case. J. Graph Theory 104(1): 87-103 (2023) - [j306]Debsoumya Chakraborti, Alan M. Frieze
Colorful Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. 37(1): 51-64 (2023) - [c97]Alan M. Frieze, Wesley Pegden
Subexponential mixing for partition chains on grid-like graphs. SODA 2023: 3317-3329 - [i39]Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
On the concentration of the maximum degree in the duplication-divergence models. CoRR abs/2308.04336 (2023) - [i38]Alan M. Frieze, Wesley Pegden:
The bright side of simple heuristics for the TSP. CoRR abs/2310.03222 (2023) - [i37]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 abs/2311.05533 (2023) - 2022
- [j305]Alan M. Frieze
Spanners in randomly weighted graphs: Independent edge lengths. Discret. Appl. Math. 309: 68-74 (2022) - [j304]Andrzej Dudek, Sean English
Localization game for random graphs. Discret. Appl. Math. 309: 202-214 (2022) - [j303]Hüseyin Acan
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. J. Appl. Probab. 59(2): 299-324 (2022) - [j302]Alan M. Frieze
A Randomly Weighted Minimum Arborescence with a Random Cost Constraint. Math. Oper. Res. 47(2): 1664-1680 (2022) - [j301]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): 3-24 (2022) - [j300]Alan M. Frieze
On the Cover Time of the Emerging Giant. SIAM J. Discret. Math. 36(3): 1687-1710 (2022) - [j299]Colin Cooper
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs. SIAM J. Discret. Math. 36(3): 2238-2257 (2022) - [c96]C. J. Argue, Alan M. Frieze, Anupam Gupta, Christopher Seiler:
Learning from a Sample in Online Algorithms. NeurIPS 2022 - [i36]Alan M. Frieze, Wesley Pegden:
Subexponential mixing for partition chains on grid-like graphs. CoRR abs/2206.00579 (2022) - [i35]Deepak Bal, Alan M. Frieze, Pawel Pralat:
Rainbow spanning trees in randomly coloured Gk-out. CoRR abs/2210.01327 (2022) - 2021
- [j298]Alan M. Frieze, Wesley Pegden
Minimum-Weight Combinatorial Structures Under Random Cost-Constraints. Electron. J. Comb. 28(1): 1 (2021) - [j297]Alan M. Frieze, Tomasz Tkocz:
A Randomly Weighted Minimum Spanning Tree with a Random Cost Constraint. Electron. J. Comb. 28(1): 1 (2021) - [j296]Alan M. Frieze
Shortest paths with a cost constraint: A probabilistic analysis. Discret. Appl. Math. 302: 46-53 (2021) - [j295]Debsoumya Chakraborti, Alan M. Frieze, Simi Haber
Isomorphism for random k-uniform hypergraphs. Inf. Process. Lett. 166: 106039 (2021) - [j294]Michael Anastos
A scaling limit for the length of the longest cycle in a sparse random graph. J. Comb. Theory B 148: 184-208 (2021) - [j293]Alan M. Frieze
Maker Breaker on digraphs. J. Graph Theory 98(4): 653-661 (2021) - [j292]Alan M. Frieze, Tomasz Tkocz
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. Oper. Res. Lett. 49(3): 400-404 (2021) - [j291]Michael Anastos, Alan M. Frieze:
Finding maximum matchings in random regular graphs in linear expected time. Random Struct. Algorithms 58(3): 390-429 (2021) - [j290]Alan M. Frieze:
The Effect of Adding Randomly Weighted Edges. SIAM J. Discret. Math. 35(2): 1182-1200 (2021) - [j289]Michael Anastos, Alan M. Frieze, Pu Gao:
Hamiltonicity of Random Graphs in the Stochastic Block Model. SIAM J. Discret. Math. 35(3): 1854-1880 (2021) - [c95]Alan M. Frieze
The Concentration of the Maximum Degree in the Duplication-Divergence Models. COCOON 2021: 413-424 - [i34]Alan M. Frieze, Wesley Pegden:
Spanners in randomly weighted graphs: independent edge lengths. CoRR abs/2105.01718 (2021) - 2020
- [j288]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): 4 (2020) - [j287]Alan M. Frieze, Wesley Pegden
On random multi-dimensional assignment problems. Discret. Appl. Math. 287: 1-9 (2020) - [j286]Michael Anastos, Alan M. Frieze:
On the connectivity of proper colorings of random graphs and hypergraphs. Random Struct. Algorithms 56(4): 988-997 (2020) - [j285]Michael Anastos, Alan M. Frieze:
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis. Random Struct. Algorithms 57(4): 865-878 (2020) - [j284]Alan M. Frieze, Tomasz Tkocz:
Random Graphs with a Fixed Maximum Degree. SIAM J. Discret. Math. 34(1): 53-61 (2020) - [c94]Alan M. Frieze, Tomasz Tkocz:
A randomly weighted minimum spanning tree with a random cost constraint. SODA 2020: 670-689 - [c93]Alan M. Frieze
Degree Distribution for Duplication-Divergence Graphs: Large Deviations. WG 2020: 226-237 - [i33]Alan M. Frieze, Tomasz Tkocz:
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. CoRR abs/2009.03416 (2020)
2010 – 2019
- 2019
- [j283]Alan M. Frieze, Tomasz Tkocz:
A Note on Log-Concave Random Graphs. Electron. J. Comb. 26(3): 3 (2019) - [j282]Colin Cooper, Alan M. Frieze, Wesley Pegden
On the Rank of a Random Binary Matrix. Electron. J. Comb. 26(4): 4 (2019) - [j281]Andrzej Dudek, Alan M. Frieze, Wesley Pegden
A note on the localization number of random graphs: Diameter two case. Discret. Appl. Math. 254: 107-112 (2019) - [j280]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): 405-414 (2019) - [j279]Alan M. Frieze, Xavier Pérez-Giménez
Perfect matchings and Hamiltonian cycles in the preferential attachment model. Random Struct. Algorithms 54(2): 258-288 (2019) - [j278]Alan M. Frieze, Tony Johansson:
On the insertion time of random walk cuckoo hashing. Random Struct. Algorithms 54(4): 721-729 (2019) - [j277]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin
Notes on growing a tree in a graph. Random Struct. Algorithms 55(2): 290-312 (2019) - [j276]Alan M. Frieze, Wesley Pegden
Traveling in randomly embedded random graphs. Random Struct. Algorithms 55(3): 649-676 (2019) - [j275]Colin Cooper, Alan M. Frieze, Wesley Pegden
Minors of a random binary matroid. Random Struct. Algorithms 55(4): 865-880 (2019) - [j274]Michael Anastos, Alan M. Frieze:
Pattern Colored Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. 33(1): 528-545 (2019) - [j273]Andrzej Dudek, Sean English
A Random Variant of the Game of Plates and Olives. SIAM J. Discret. Math. 33(3): 1216-1227 (2019) - [j272]Colin Cooper, Alan M. Frieze, Wesley Pegden
On the Cover Time of Dense Graphs. SIAM J. Discret. Math. 33(3): 1374-1389 (2019) - [c92]Michael Anastos, Alan M. Frieze:
On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs. APPROX-RANDOM 2019: 36:1-36:10 - [c91]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the rank of a random binary matrix. SODA 2019: 946-955 - [i32]Alan M. Frieze, Wesley Pegden, Tomasz Tkocz:
On random multi-dimensional assignment problems. CoRR abs/1901.07167 (2019) - [i31]Alan M. Frieze, Tomasz Tkocz:
A randomly weighted minimum arborescence with a random cost constraint. CoRR abs/1907.03375 (2019) - 2018
- [j271]Michael Anastos, Alan M. Frieze, Wesley Pegden
Constraining the Clustering Transition for Colorings of Sparse Random Graphs. Electron. J. Comb. 25(1): 1 (2018) - [j270]Andrzej Dudek, Sean English
On Rainbow Hamilton Cycles in Random Hypergraphs. Electron. J. Comb. 25(2): 2 (2018) - [j269]Alan M. Frieze, Tony Johansson:
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph. Comb. Probab. Comput. 27(2): 228-244 (2018) - [j268]Joseph Briggs
Packing Hamilton Cycles Online. Comb. Probab. Comput. 27(4): 475-495 (2018) - [j267]Alan M. Frieze, Samantha Petti
Balanced allocation through random walk. Inf. Process. Lett. 131: 39-43 (2018) - [j266]Deepak Bal
A greedy algorithm for finding a large 2-matching on a random cubic graph. J. Graph Theory 88(3): 449-481 (2018) - [j265]Alan M. Frieze, Wesley Pegden
Online purchasing under uncertainty. Random Struct. Algorithms 53(2): 327-351 (2018) - [j264]Alan M. Frieze, Wesley Pegden
A note on dispersing particles on a line. Random Struct. Algorithms 53(4): 586-591 (2018) - [j263]Lisa Espig, Alan M. Frieze, Michael Krivelevich:
Elegantly Colored Paths and Cycles in Edge Colored Random Graphs. SIAM J. Discret. Math. 32(3): 1585-1618 (2018) - [j262]Alan M. Frieze, Wesley Pegden
The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights. SIAM J. Discret. Math. 32(3): 2115-2133 (2018) - [j261]Colin Cooper
Discordant Voting Processes on Finite Graphs. SIAM J. Discret. Math. 32(4): 2398-2420 (2018) - [c90]Colin Cooper, Alan M. Frieze, Samantha Petti
The cover time of a biased random walk on Gn, p. ANALCO 2018: 158-167 - [c89]Colin Cooper, Alan M. Frieze, Tony Johansson:
The Cover Time of a Biased Random Walk on a Random Cubic Graph. AofA 2018: 16:1-16:12 - [i30]Colin Cooper, Alan M. Frieze, Tony Johansson:
The cover time of a biased random walk on a random cubic graph. CoRR abs/1801.00760 (2018) - [i29]Michael Anastos, Alan M. Frieze:
On the connectivity threshold for colorings of random graphs and hypergraphs. CoRR abs/1803.05246 (2018) - [i28]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the cover time of dense graphs. CoRR abs/1810.04772 (2018) - 2017
- [j260]Alan M. Frieze, Michael Anastos:
Randomly coloring simple hypergraphs with fewer colors. Inf. Process. Lett. 126: 39-42 (2017) - [j259]Andrzej Dudek, Alan M. Frieze
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. J. Comb. Theory B 122: 719-740 (2017) - [j258]Alan M. Frieze, Tony Johansson:
On random k-out subgraphs of large graphs. Random Struct. Algorithms 50(2): 143-157 (2017) - [j257]Alan M. Frieze, Wesley Pegden
Separating subadditive euclidean functionals. Random Struct. Algorithms 51(3): 375-403 (2017) - [j256]Alan M. Frieze, Tony Johansson:
Minimum Cost Matching in a Random Graph with Random Costs. SIAM J. Discret. Math. 31(1): 489-510 (2017) - [c88]Alan M. Frieze, Wesley Pegden:
Traveling in Randomly Embedded Random Graphs. APPROX-RANDOM 2017: 45:1-45:17 - [c87]Alan M. Frieze, Tony Johansson:
On the insertion time of random walk cuckoo hashing. SODA 2017: 1497-1502 - [i27]Michael Anastos, Alan M. Frieze:
Randomly coloring simple hypergraphs with fewer colors. CoRR abs/1703.05173 (2017) - [i26]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on Growing a Tree in a Graph. CoRR abs/1707.00083 (2017) - [i25]Colin Cooper, Alan M. Frieze, Samantha Petti:
The covertime of a biased random walk on Gn, p. CoRR abs/1708.04908 (2017) - [i24]Alan M. Frieze, Samantha Petti:
Balanced Allocation Through Random Walk. CoRR abs/1708.04945 (2017) - 2016
- [j255]Patrick Bennett
Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs. Electron. J. Comb. 23(2): 2 (2016) - [j254]Colin Cooper, Alan M. Frieze
On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. 25(1): 89-107 (2016) - [j253]Deepak Bal
Rainbow Arborescence in Random Digraphs. J. Graph Theory 83(3): 251-265 (2016) - [j252]Deepak Bal
Rainbow matchings and Hamilton cycles in random graphs. Random Struct. Algorithms 48(3): 503-523 (2016) - [j251]Colin Cooper, Alan M. Frieze
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. SIAM J. Discret. Math. 30(1): 166-205 (2016) - [c86]Colin Cooper, Martin E. Dyer
Discordant Voting Processes on Finite Graphs. ICALP 2016: 145:1-145:13 - [c85]Alan M. Frieze, Wesley Pegden
Separating subadditive euclidean functionals. STOC 2016: 22-35 - [i23]Alan M. Frieze, Tony Johansson:
On the insertion time of random walk cuckoo hashing. CoRR abs/1602.04652 (2016) - [i22]Alan M. Frieze, Wesley Pegden:
Scalefree hardness of average-case Euclidean TSP approximation. CoRR abs/1604.04549 (2016) - [i21]Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera:
Discordant voting processes on finite graphs. CoRR abs/1604.06884 (2016) - [i20]Alan M. Frieze, Wesley Pegden:
Online purchasing under uncertainty. CoRR abs/1605.06072 (2016) - 2015
- [j250]Deepak Bal
Power of k Choices and Rainbow Spanning Trees in Random Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j249]Alan M. Frieze, Wesley Pegden:
Between 2- and 3-Colorability. Electron. J. Comb. 22(1): 1 (2015) - [j248]Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
On-line List Colouring of Random Graphs. Electron. J. Comb. 22(2): 2 (2015) - [j247]Andrzej Dudek, Alan M. Frieze
Loose Hamilton Cycles in Regular Hypergraphs. Comb. Probab. Comput. 24(1): 179-194 (2015) - [j246]Colin Cooper, Alan M. Frieze
Long Paths in Random Apollonian Networks. Internet Math. 11(4-5): 308-318 (2015) - [j245]Martin E. Dyer
On the chromatic number of a random hypergraph. J. Comb. Theory B 113: 68-122 (2015) - [j244]Alan M. Frieze
Efficient algorithms for three-dimensional axial and planar random assignment problems. Random Struct. Algorithms 46(1): 160-196 (2015) - [j243]Alan M. Frieze
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three. Random Struct. Algorithms 47(1): 73-98 (2015) - [j242]Lisa Espig, Alan M. Frieze
Walker-Breaker Games. SIAM J. Discret. Math. 29(3): 1476-1485 (2015) - [j241]Andrzej Dudek, Alan M. Frieze
Rainbow Connection of Random Regular Graphs. SIAM J. Discret. Math. 29(4): 2255-2266 (2015) - [i19]Alan M. Frieze, Wesley Pegden:
Separating subadditive Euclidean functionals. CoRR abs/1501.01944 (2015) - [i18]Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
On-line list colouring of random graphs. CoRR abs/1501.07469 (2015) - 2014
- [j240]Deepak Bal
Packing Tree Factors in Random and Pseudo-random Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j239]Alan M. Frieze, Wesley Pegden:
The Topology of Competitively Constructed Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j238]Deepak Bal, Patrick Bennett
The t-Tone Chromatic Number of Random Graphs. Graphs Comb. 30(5): 1073-1086 (2014) - [j237]Colin Cooper, Alan M. Frieze, Pawel Pralat:
Some Typical Properties of the Spatial Preferred Attachment Model. Internet Math. 10(1-2): 116-136 (2014) - [j236]Alan M. Frieze, Charalampos E. Tsourakakis
Some Properties of Random Apollonian Networks. Internet Math. 10(1-2): 162-187 (2014) - [j235]Alan M. Frieze
Rainbow hamilton cycles in random graphs. Random Struct. Algorithms 44(3): 328-354 (2014) - [j234]Alan M. Frieze
On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three. Random Struct. Algorithms 45(3): 443-497 (2014) - [j233]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze
Maker-breaker games on random geometric graphs. Random Struct. Algorithms 45(4): 553-607 (2014) - [j232]Colin Cooper, Alan M. Frieze
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. Random Struct. Algorithms 45(4): 627-674 (2014) - [j231]Colin Cooper, Alan M. Frieze
The height of random k-trees and related branching processes. Random Struct. Algorithms 45(4): 675-702 (2014) - [j230]Alan M. Frieze
Expanders via Random Spanning Trees. SIAM J. Comput. 43(2): 497-513 (2014) - [j229]Amin Coja-Oghlan, Alan M. Frieze
Analyzing Walksat on Random Formulas. SIAM J. Comput. 43(4): 1456-1485 (2014) - [i17]Alan M. Frieze, Wesley Pegden:
Looking for vertex number one. CoRR abs/1408.6821 (2014) - 2013
- [j228]Alan M. Frieze
On the Non-Planarity of a Random Subgraph. Comb. Probab. Comput. 22(5): 722-732 (2013) - [j227]Alan M. Frieze, Paul Horn, Pawel Pralat:
Special Issue on Algorithms and Models for the Web Graph. Internet Math. 9(1): 1-2 (2013) - [j226]Andrzej Dudek, Alan M. Frieze
Approximate counting of regular hypergraphs. Inf. Process. Lett. 113(19-21): 785-788 (2013) - [j225]Alan M. Frieze
Coloring simple hypergraphs. J. Comb. Theory B 103(6): 767-794 (2013) - [j224]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) - [j223]Andrzej Dudek, Alan M. Frieze
Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms 42(3): 374-385 (2013) - [j222]Martin E. Dyer
Randomly coloring constant degree graphs. Random Struct. Algorithms 43(2): 181-200 (2013) - [j221]Chris Peikert, Robert Kleinberg, Aravind Srinivasan, Alan M. Frieze
Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). SIAM J. Comput. 42(3): 1216-1217 (2013) - [j220]Alan M. Frieze
On the Game Chromatic Number of Sparse Random Graphs. SIAM J. Discret. Math. 27(2): 768-790 (2013) - [j219]Colin Cooper, Alan M. Frieze
The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci. 509: 51-69 (2013) - [c84]Alan M. Frieze, Aristides Gionis, Charalampos E. Tsourakakis
Algorithmic techniques for modeling and mining large graphs (AMAzING). KDD 2013: 1523 - 2012
- [j218]Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski
Rainbow Hamilton Cycles in Uniform Hypergraphs. Electron. J. Comb. 19(1): 46 (2012) - [j217]Alan M. Frieze, Charalampos E. Tsourakakis
Rainbow Connection of Sparse Random Graphs. Electron. J. Comb. 19(4): 5 (2012) - [j216]Andrzej Dudek, Alan M. Frieze, Po-Shen Loh
Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. Electron. J. Comb. 19(4): 44 (2012) - [j215]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze
Cops and Robbers on Geometric Graphs. Comb. Probab. Comput. 21(6): 816-834 (2012) - [j214]Mohammed Amin Abdullah, Colin Cooper, Alan M. Frieze
Cover time of a random graph with given degree sequence. Discret. Math. 312(21): 3146-3163 (2012) - [j213]Colin Cooper, Alan M. Frieze
Stationary distribution and cover time of random walks on random digraphs. J. Comb. Theory B 102(2): 329-362 (2012) - [j212]Alan M. Frieze
Variations on cops and robbers. J. Graph Theory 69(4): 383-402 (2012) - [j211]Alan M. Frieze
Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms 40(3): 269-300 (2012) - [j210]Alan M. Frieze
Packing hamilton cycles in random and pseudo-random hypergraphs. Random Struct. Algorithms 41(1): 1-22 (2012) - [j209]Alan M. Frieze
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables. Random Struct. Algorithms 41(3): 334-364 (2012) - [j208]Deepak Bal
Packing Tight Hamilton Cycles in Uniform Hypergraphs. SIAM J. Discret. Math. 26(2): 435-451 (2012) - [c83]Amin Coja-Oghlan, Alan M. Frieze:
Analyzing Walksat on Random Formulas. ANALCO 2012: 48-55 - [c82]Alan M. Frieze, Charalampos E. Tsourakakis:
Rainbow Connectivity of Sparse Random Graphs. APPROX-RANDOM 2012: 541-552 - [c81]Colin Cooper, Alan M. Frieze, Pawel Pralat:
Some Typical Properties of the Spatial Preferred Attachment Model. WAW 2012: 29-40 - [c80]Alan M. Frieze, Charalampos E. Tsourakakis:
On Certain Properties of Random Apollonian Networks. WAW 2012: 93-112 - [i16]Alan M. Frieze, Charalampos E. Tsourakakis:
Rainbow Connectivity of Sparse Random Graphs. CoRR abs/1201.4603 (2012) - [i15]Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill:
On the chromatic number of a random hypergraph. CoRR abs/1208.0812 (2012) - [i14]Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze:
A greedy algorithm for finding a large 2-matching on a random cubic graph. CoRR abs/1209.6570 (2012) - 2011
- [j207]Andrzej Dudek, Alan M. Frieze:
Loose Hamilton Cycles in Random Uniform Hypergraphs. Electron. J. Comb. 18(1) (2011) - [j206]Tom Bohman
Karp-Sipser on Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. 20(5): 721-741 (2011) - [j205]Alan M. Frieze
Randomly coloring simple hypergraphs. Inf. Process. Lett. 111(17): 848-853 (2011) - [j204]Tom Bohman
Ramsey games with giants. Random Struct. Algorithms 38(1-2): 1-32 (2011) - [j203]Colin Cooper, Alan M. Frieze
The cover time of random geometric graphs. Random Struct. Algorithms 38(3): 324-349 (2011) - [j202]Alan M. Frieze
An Analysis of Random-Walk Cuckoo Hashing. SIAM J. Comput. 40(2): 291-308 (2011) - [c79]Colin Cooper, Alan M. Frieze, Tomasz Radzik
The Cover Times of Random Walks on Hypergraphs. SIROCCO 2011: 210-221 - [c78]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Packing tight Hamilton cycles in 3-uniform hypergraphs. SODA 2011: 913-932 - [c77]Colin Cooper, Alan M. Frieze:
Component structure of the vacant set induced by a random walk on a random graph. SODA 2011: 1211-1221 - [e1]Alan M. Frieze, Paul Horn, Pawel Pralat:
Algorithms and Models for the Web Graph - 8th International Workshop, WAW 2011, Atlanta, GA, USA, May 27-29, 2011. Proceedings. Lecture Notes in Computer Science 6732, Springer 2011, ISBN 978-3-642-21285-7 [contents] - [i13]Colin Cooper, Alan M. Frieze:
Stationary distribution and cover time of random walks on random digraphs. CoRR abs/1103.4317 (2011) - [i12]Alan M. Frieze, Charalampos E. Tsourakakis:
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks. CoRR abs/1104.5259 (2011) - [i11]Amin Coja-Oghlan, Alan M. Frieze:
Analyzing Walksat on random formulas. CoRR abs/1106.0120 (2011) - [i10]Tom Bohman, Alan M. Frieze, Eyal Lubetzky:
Random greedy triangle-packing beyond the 7/4 barrier. CoRR abs/1108.1781 (2011) - [i9]Martin E. Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski:
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). Dagstuhl Reports 1(6): 24-53 (2011) - 2010
- [j201]Tom Bohman
Hypergraphs with independent neighborhoods. Comb. 30(3): 277-293 (2010) - [j200]Alan M. Frieze:
Loose Hamilton Cycles in Random 3-Uniform Hypergraphs. Electron. J. Comb. 17(1) (2010) - [j199]Alan M. Frieze, Santosh S. Vempala, Juan Vera:
Logconcave Random Graphs. Electron. J. Comb. 17(1) (2010) - [j198]Prasad Chebolu, Alan M. Frieze
Finding a maximum matching in a sparse random graph in O(n) expected time. J. ACM 57(4): 24:1-24:27 (2010) - [j197]Tom Bohman
Anti-Ramsey properties of random graphs. J. Comb. Theory B 100(3): 299-312 (2010) - [j196]Tom Bohman
Coloring H-free hypergraphs. Random Struct. Algorithms 36(1): 11-25 (2010) - [j195]Martin E. Dyer
Randomly coloring random graphs. Random Struct. Algorithms 36(3): 251-272 (2010) - [j194]Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze
An Efficient Sparse Regularity Concept. SIAM J. Discret. Math. 23(4): 2000-2034 (2010) - [j193]Colin Cooper, Alan M. Frieze
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. 24(2): 558-569 (2010) - [j192]Tom Bohman
Flips in Graphs. SIAM J. Discret. Math. 24(3): 1046-1055 (2010) - [j191]Colin Cooper, Alan M. Frieze
Random Walks with Look-Ahead in Scale-Free Random Graphs. SIAM J. Discret. Math. 24(3): 1162-1176 (2010) - [i8]Tom Bohman, Alan M. Frieze, Eyal Lubetzky:
A note on the random greedy triangle-packing algorithm. CoRR abs/1004.2418 (2010) - [i7]Alan M. Frieze, Gregory B. Sorkin:
Average case performance of heuristics for multi-dimensional assignment problems. CoRR abs/1004.4239 (2010) - [i6]Colin Cooper, Alan M. Frieze:
Component structure induced by a random walk on a random graph. CoRR abs/1005.1564 (2010) - [i5]Alan M. Frieze, Gregory B. Sorkin:
Average-case performance of heuristics for three-dimensional assignment problems. CoRR abs/1008.0390 (2010)
2000 – 2009
- 2009
- [j190]Alan M. Frieze
Line-of-Sight Networks. Comb. Probab. Comput. 18(1-2): 145-163 (2009) - [j189]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) - [j188]Tom Bohman
Hamilton cycles in 3-out. Random Struct. Algorithms 35(4): 393-417 (2009) - [j187]Andrew Beveridge, Tom Bohman
Memoryless Rules for Achlioptas Processes. SIAM J. Discret. Math. 23(2): 993-1008 (2009) - [j186]Colin Cooper, Alan M. Frieze
Multiple Random Walks in Random Regular Graphs. SIAM J. Discret. Math. 23(4): 1738-1761 (2009) - [c76]Prasad Chebolu, Alan M. Frieze, Páll Melsted
Average-Case Analyses of Vickrey Costs. APPROX-RANDOM 2009: 434-447 - [c75]Alan M. Frieze, Páll Melsted
An Analysis of Random-Walk Cuckoo Hashing. APPROX-RANDOM 2009: 490-503 - [c74]Colin Cooper, Alan M. Frieze, Tomasz Radzik:
Multiple Random Walks and Interacting Particle Systems. ICALP (2) 2009: 399-410 - [c73]Colin Cooper, Alan M. Frieze:
The cover time of random geometric graphs. SODA 2009: 48-57 - [c72]Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze:
An efficient sparse regularity concept. SODA 2009: 207-216 - [c71]Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik:
On smoothed k-CNF formulas and the Walksat algorithm. SODA 2009: 451-460 - [i4]Alan M. Frieze, Páll Melsted:
Randomly colouring simple hypergraphs. CoRR abs/0901.3699 (2009) - [i3]Alan M. Frieze, Páll Melsted:
Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables. CoRR abs/0910.5535 (2009) - 2008
- [j185]Amin Coja-Oghlan, Alan M. Frieze:
Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k. Electron. J. Comb. 15(1) (2008) - [j184]Alan M. Frieze, Michael Krivelevich:
On Rainbow Trees and Cycles. Electron. J. Comb. 15(1) (2008) - [j183]Alan M. Frieze, Dhruv Mubayi:
On the Chromatic Number of Simple Triangle-Free Triple Systems. Electron. J. Comb. 15(1) (2008) - [j182]Tom Bohman
The game chromatic number of random graphs. Random Struct. Algorithms 32(2): 223-235 (2008) - [j181]Colin Cooper, Alan M. Frieze
The cover time of the giant component of a random graph. Random Struct. Algorithms 32(4): 401-439 (2008) - [j180]Prasad Chebolu, Alan M. Frieze
Hamilton Cycles in Random Lifts of Directed Graphs. SIAM J. Discret. Math. 22(2): 520-540 (2008) - [j179]Andrew Beveridge, Tom Bohman
Game chromatic index of graphs with given restrictions on degrees. Theor. Comput. Sci. 407(1-3): 242-249 (2008) - [c70]Alan M. Frieze, Ravi Kannan:
A new approach to the planted clique problem. FSTTCS 2008: 187-198 - [c69]Prasad Chebolu, Alan M. Frieze, Páll Melsted
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. ICALP (1) 2008: 161-172 - [c68]Colin Cooper, Alan M. Frieze:
Random Walks on Random Graphs. NanoNet 2008: 95-106 - [c67]Alan M. Frieze, Santosh S. Vempala, Juan Vera:
Logconcave random graphs. STOC 2008: 779-788 - 2007
- [j178]Colin Cooper, Alan M. Frieze
Random 2-SAT with Prescribed Literal Degrees. Algorithmica 48(3): 249-265 (2007) - [j177]Abraham D. Flaxman, Alan M. Frieze
Adversarial Deletion in a Scale-Free Random Graph Process. Comb. Probab. Comput. 16(2): 261-270 (2007) - [j176]Tom Bohman
First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. 16(3): 375-400 (2007) - [j175]Abraham D. Flaxman, Alan M. Frieze
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. Comb. Probab. Comput. 16(5): 713-732 (2007) - [j174]Alan M. Frieze
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. 16(5): 733-746 (2007) - [j173]Alan M. Frieze
Codes identifying sets of vertices in random networks. Discret. Math. 307(9-10): 1094-1107 (2007) - [j172]Abraham D. Flaxman, Alan M. Frieze, Juan Vera
A Geometric Preferential Attachment Model of Networks. Internet Math. 3(2): 187-205 (2007) - [j171]Alan M. Frieze, Juan Vera
The Influence of Search Engines on Preferential Attachment. Internet Math. 3(3): 361-381 (2007) - [j170]Abraham D. Flaxman, Alan M. Frieze, Juan Vera
A Geometric Preferential Attachment Model of Networks II. Internet Math. 4(1): 87-111 (2007) - [j169]Colin Cooper, Alan M. Frieze
The cover time of the preferential attachment graph. J. Comb. Theory B 97(2): 269-290 (2007) - [j168]Colin Cooper, Alan M. Frieze
The cover time of sparse random graphs. Random Struct. Algorithms 30(1-2): 1-16 (2007) - [j167]Tom Bohman
Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30(1-2): 17-34 (2007) - [j166]Abraham D. Flaxman, Alan M. Frieze
The diameter of randomly perturbed digraphs and some applications. Random Struct. Algorithms 30(4): 484-504 (2007) - [j165]Alan M. Frieze
The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. SIAM J. Comput. 36(5): 1435-1452 (2007) - [c66]Colin Cooper, Alan M. Frieze:
The Cover Time of Random Digraphs. APPROX-RANDOM 2007: 422-435 - [c65]Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou:
Separating Populations with Wide Data: A Spectral Analysis. ISAAC 2007: 439-451 - [c64]Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany:
Line-of-sight networks. SODA 2007: 968-977 - [c63]Abraham D. Flaxman, Alan M. Frieze, Juan Vera
A Geometric Preferential Attachment Model of Networks II. WAW 2007: 41-55 - 2006
- [j164]Alan M. Frieze
On randomly colouring locally sparse graphs. Discret. Math. Theor. Comput. Sci. 8(1): 121-128 (2006) - [j163]K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze
Hamilton cycles in random lifts of graphs. Eur. J. Comb. 27(8): 1282-1293 (2006) - [j162]Abraham D. Flaxman, Alan M. Frieze
On the random 2-stage minimum spanning tree. Random Struct. Algorithms 28(1): 24-36 (2006) - [j161]Alan M. Frieze
The satisfiability threshold for randomly generated binary constraint satisfaction problems. Random Struct. Algorithms 28(3): 323-339 (2006) - [j160]Alan M. Frieze
Almost universal graphs. Random Struct. Algorithms 28(4): 499-510 (2006) - [j159]Martin E. Dyer
Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29(4): 450-465 (2006) - [c62]Alan M. Frieze:
Random graphs. SODA 2006: 960 - 2005
- [j158]Alan M. Frieze
Random k-Sat: A Tight Threshold For Moderately Growing k. Comb. 25(3): 297-305 (2005) - [j157]Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner:
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Math. 2(1): 1-19 (2005) - [j156]Alan M. Frieze
On packing Hamilton cycles in ?-regular graphs. J. Comb. Theory B 94(1): 159-172 (2005) - [j155]Alan M. Frieze
Perfect matchings in random bipartite graphs with minimal degree at least 2. Random Struct. Algorithms 26(3): 319-358 (2005) - [j154]Colin Cooper, Alan M. Frieze
The Cover Time of Random Regular Graphs. SIAM J. Discret. Math. 18(4): 728-740 (2005) - [j153]Alan M. Frieze
The Strong Chromatic Index of Random Graphs. SIAM J. Discret. Math. 19(3): 719-727 (2005) - [c61]Alan M. Frieze, Ryan R. Martin
Identifying codes in random networks. ISIT 2005: 1464-1467 - [c60]Abraham Flaxman, Alan M. Frieze, Juan Vera:
Adversarial deletion in a scale free random graph process. SODA 2005: 287-292 - [c59]Soumen Chakrabarti, Alan M. Frieze, Juan Vera:
The influence of search engines on preferential attachment. SODA 2005: 293-300 - [c58]Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich:
On the random 2-stage minimum spanning tree. SODA 2005: 919-926 - [c57]Colin Cooper, Alan M. Frieze:
The cover time of two classes of random graphs. SODA 2005: 961-970 - [c56]Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. STOC 2005: 441-449 - 2004
- [j152]Geoffrey Atkinson, Alan M. Frieze
On the b-Independence Number of Sparse Random Graphs. Comb. Probab. Comput. 13(3): 295-309 (2004) - [j151]Colin Cooper, Alan M. Frieze
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. Comb. Probab. Comput. 13(3): 319-337 (2004) - [j150]Alan M. Frieze
Fast monte-carlo algorithms for finding low-rank approximations. J. ACM 51(6): 1025-1041 (2004) - [j149]Abraham Flaxman, Alan M. Frieze
Efficient communication in an ad-hoc network. J. Algorithms 52(1): 1-7 (2004) - [j148]Petros Drineas
Clustering Large Graphs via the Singular Value Decomposition. Mach. Learn. 56(1-3): 9-33 (2004) - [j147]Alan M. Frieze
On Random Symmetric Travelling Salesman Problems. Math. Oper. Res. 29(4): 878-890 (2004) - [j146]Alan M. Frieze
The emergence of a giant component in random subgraphs of pseudo-random graphs. Random Struct. Algorithms 24(1): 42-50 (2004) - [j145]Tom Bohman
Adding random edges to dense graphs. Random Struct. Algorithms 24(2): 105-117 (2004) - [j144]Tom Bohman
Avoidance of a giant component in half the edge set of a random graph. Random Struct. Algorithms 25(4): 432-449 (2004) - [c55]Abraham Flaxman, Alan M. Frieze:
The Diameter of Randomly Perturbed Digraphs and Some Applications.. APPROX-RANDOM 2004: 345-356 - [c54]Martin E. Dyer
Randomly Coloring Constant Degree Graphs. FOCS 2004: 582-589 - [c53]Abraham Flaxman, Alan M. Frieze, Juan Vera:
A Geometric Preferential Attachment Model of Networks. WAW 2004: 44-55 - [i2]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j143]Tom Bohman
On Randomly Generated Intersecting Hypergraphs. Electron. J. Comb. 10 (2003) - [j142]Colin Cooper, Alan M. Frieze:
Crawling on Simple Models of Web Graphs. Internet Math. 1(1): 57-90 (2003) - [j141]Colin Cooper, Alan M. Frieze, Juan Vera
Random Deletion in a Scale-Free Random Graph Process. Internet Math. 1(4): 463-483 (2003) - [j140]Tom Bohman
How many random edges make a dense graph hamiltonian? Random Struct. Algorithms 22(1): 33-42 (2003) - [j139]Colin Cooper, Alan M. Frieze
A general model of web graphs. Random Struct. Algorithms 22(3): 311-335 (2003) - [j138]Martin E. Dyer
Randomly coloring graphs with lower bounds on girth and maximum degree. Random Struct. Algorithms 23(2): 167-179 (2003) - [j137]Tom Bohman
Arc-Disjoint Paths in Expander Digraphs. SIAM J. Comput. 32(2): 326-344 (2003) - [j136]Martin E. Dyer
A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theor. Comput. Sci. 290(3): 1815-1828 (2003) - [c52]Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner:
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. RANDOM-APPROX 2003: 264-274 - [c51]Alan M. Frieze, Michael Molloy:
The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. RANDOM-APPROX 2003: 275-289 - [c50]Colin Cooper, Alan M. Frieze:
The cover time of sparse random graphs. SODA 2003: 140-147 - [c49]Alan M. Frieze, Boris G. Pittel:
Perfect matchings in random graphs with prescribed minimal degree. SODA 2003: 148-157 - [p1]Béla Bollobás, Vladimir Nikiforov, Nicholas C. Wormald, Ralph J. Faudree, Alan M. Frieze:
Analytic Graph Theory. Handbook of Graph Theory 2003: 787-871 - 2002
- [j135]Colin Cooper, Alan M. Frieze
Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. Comb. Probab. Comput. 11(2): 129-133 (2002) - [j134]Colin Cooper, Alan M. Frieze
Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Comb. Probab. Comput. 11(3): 249-261 (2002) - [j133]Colin Cooper, Alan M. Frieze
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Comb. Probab. Comput. 11(4): 323-341 (2002) - [j132]Alan M. Frieze
Hamilton cycles in random subgraphs of pseudo-random graphs. Discret. Math. 256(1-2): 137-150 (2002) - [j131]Alan M. Frieze
Optimal Sequencing by Hybridization in Rounds. J. Comput. Biol. 9(2): 355-369 (2002) - [j130]Alan M. Frieze
On graph irregularity strength. J. Graph Theory 41(2): 120-137 (2002) - [j129]Sanjeev Arora, Alan M. Frieze
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program. 92(1): 1-36 (2002) - [j128]Tom Bohman
Addendum to avoiding a giant component. Random Struct. Algorithms 20(1): 126-130 (2002) - [j127]Martin E. Dyer
On Counting Independent Sets in Sparse Graphs. SIAM J. Comput. 31(5): 1527-1541 (2002) - [c48]Alan M. Frieze:
On Random Symmetric Travelling Salesman Problems. FOCS 2002: 789-798 - [c47]Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher:
Balls and bins models with feedback. SODA 2002: 308-315 - [c46]Colin Cooper, Alan M. Frieze, Gregory B. Sorkin:
A note on random 2-SAT with prescribed literal degrees. SODA 2002: 316-320 - [c45]Colin Cooper, Alan M. Frieze:
Crawling on web graphs. STOC 2002: 419-427 - 2001
- [j126]Tom Bohman
Vertex Covers by Edge Disjoint Cliques. Comb. 21(2): 171-197 (2001) - [j125]Tom Bohman
G-Intersecting Families. Comb. Probab. Comput. 10(5): 367-384 (2001) - [j124]Andrei Z. Broder, Alan M. Frieze
A general approach to dynamic packet routing with bounded buffers. J. ACM 48(2): 324-349 (2001) - [j123]Colin Cooper, Martin E. Dyer
On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms 39(1): 117-134 (2001) - [j122]Alan M. Frieze
Hamilton cycles in the union of random permutations. Random Struct. Algorithms 18(1): 83-94 (2001) - [j121]Tom Bohman
Avoiding a giant component. Random Struct. Algorithms 19(1): 75-85 (2001) - [c44]Colin Cooper, Alan M. Frieze:
A General Model of Undirected Web Graphs. ESA 2001: 500-511 - [c43]Tom Bohman
Arc-Disjoint Paths in Expander Digraphs. FOCS 2001: 558-567 - [c42]Martin E. Dyer
Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. FOCS 2001: 579-587 - [c41]Alan M. Frieze, Bjarni V. Halldórsson:
Optimal sequencing by hybridization in rounds. RECOMB 2001: 141-148 - [c40]Alan M. Frieze, Gregory B. Sorkin:
The probabilistic relationship between the assignment and asymmetric traveling salesman problems. SODA 2001: 652-660 - 2000
- [j120]Tom Bohman
Min-Wise Independent Linear Permutations. Electron. J. Comb. 7 (2000) - [j119]Tom Bohman
Note on Sparse Random Graphs and Cover Graphs. Electron. J. Comb. 7 (2000) - [j118]Alan M. Frieze:
On the Number of Perfect Matchings and Hamilton Cycles in e-Regular Non-bipartite Graphs. Electron. J. Comb. 7 (2000) - [j117]Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma:
A Note on Random Minimum Length Spanning Trees. Electron. J. Comb. 7 (2000) - [j116]Alan M. Frieze, Lei Zhao:
Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs. Comb. Probab. Comput. 9(3): 241-263 (2000) - [j115]Andrei Z. Broder, Moses Charikar
Min-Wise Independent Permutations. J. Comput. Syst. Sci. 60(3): 630-659 (2000) - [j114]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. J. Graph Theory 34(1): 42-59 (2000) - [j113]Colin Cooper, Alan M. Frieze
Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms 16(1): 33-46 (2000) - [j112]Colin Cooper, Alan M. Frieze
Hamilton cycles in random graphs and directed graphs. Random Struct. Algorithms 16(4): 369-401 (2000) - [j111]Alan M. Frieze
Edge-Disjoint Paths in Expander Graphs. SIAM J. Comput. 30(6): 1790-1801 (2000) - [c39]Alan M. Frieze:
Edge-disjoint paths in expander graphs. SODA 2000: 717-725
1990 – 1999
- 1999
- [j110]Alan M. Frieze
Quick Approximation to Matrices and Applications. Comb. 19(2): 175-220 (1999) - [j109]Alan M. Frieze, Ravi Kannan:
A Simple Algorithm for Constructing Szemere'di's Regularity Partition. Electron. J. Comb. 6 (1999) - [j108]Alan M. Frieze
Splitting an Expander Graph. J. Algorithms 33(1): 166-172 (1999) - [j107]Alan M. Frieze
Optimal Reconstruction of a Sequence from its Probes. J. Comput. Biol. 6(3/4): 361-368 (1999) - [j106]Andrei Z. Broder, Alan M. Frieze
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Random Struct. Algorithms 14(1): 87-109 (1999) - [j105]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) - [j104]Alan M. Frieze
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees. SIAM J. Discret. Math. 12(2): 208-216 (1999) - [c38]Martin E. Dyer
On Counting Independent Sets in Sparse Graphs. FOCS 1999: 210-217 - [c37]Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu:
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. FOCS 1999: 218-229 - [c36]Franco P. Preparata, Alan M. Frieze, Eli Upfal:
On the power of universal bases in sequencing by hybridization. RECOMB 1999: 295-301 - [c35]Petros Drineas
Clustering in Large Graphs and Matrices. SODA 1999: 291-299 - [c34]Alan M. Frieze, Lei Zhao:
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs. SODA 1999: 346-355 - 1998
- [j103]Alan M. Frieze
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. Algorithmica 21(1): 21-36 (1998) - [j102]Avrim Blum, Alan M. Frieze
A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica 22(1/2): 35-52 (1998) - [j101]Wenceslas Fernandez de la Vega, Alan M. Frieze
Average-Case Analysis of the Merging Algorithm of Hwang and Lin. Algorithmica 22(4): 483-489 (1998) - [j100]Andrew Beveridge, Alan M. Frieze
Random Minimum Length Spanning Trees in Regular Graphs. Comb. 18(3): 311-333 (1998) - [j99]Jonathan Aronson, Alan M. Frieze, Boris G. Pittel:
Maximum matchings in sparse random graphs: Karp-Sipser revisited. Random Struct. Algorithms 12(2): 111-177 (1998) - [j98]Martin E. Dyer
Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM J. Comput. 27(5): 1262-1272 (1998) - [j97]Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal:
Optimal Construction of Edge-Disjoint Paths in Random Graphs. SIAM J. Comput. 28(2): 541-573 (1998) - [c33]Alan M. Frieze
Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. FOCS 1998: 370-378 - [c32]Andrei Z. Broder, Alan M. Frieze
Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN 1998: 273-281 - [c31]Alan M. Frieze:
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey. RANDOM 1998: 1-14 - [c30]Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal
On Balls and Bins with Deletions. RANDOM 1998: 145-158 - [c29]Andrei Z. Broder, Moses Charikar
Min-Wise Independent Permutations (Extended Abstract). STOC 1998: 327-336 - 1997
- [j96]Alan M. Frieze
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18(1): 67-81 (1997) - [j95]Alan M. Frieze, Colin McDiarmid:
Algorithmic theory of random graphs. Random Struct. Algorithms 10(1-2): 5-42 (1997) - [c28]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 - [c27]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). STOC 1997: 531-539 - 1996
- [j94]Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed:
Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Comb. Probab. Comput. 5: 1-14 (1996) - [j93]Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
On the Best Case of Heapsort. J. Algorithms 20(2): 205-217 (1996) - [j92]Alan M. Frieze
Analysis of Two Simple Heuristics on a Random Instance of k-SAT. J. Algorithms 20(2): 312-355 (1996) - [j91]Alan M. Frieze
Generating and Counting Hamilton Cycles in Random Regular Graphs. J. Algorithms 21(1): 176-198 (1996) - [j90]Hui Chen, Alan M. Frieze
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph. Random Struct. Algorithms 9(4): 359-377 (1996) - [c26]Alan M. Frieze, Wojciech Szpankowski:
Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. ESA 1996: 194-207 - [c25]Alan M. Frieze
The Regularity Lemma and Approximation Schemes for Dense Problems. FOCS 1996: 12-20 - [c24]Sanjeev Arora, Alan M. Frieze
A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. FOCS 1996: 21-30 - [c23]Avrim Blum, Alan M. Frieze
A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. FOCS 1996: 330-338 - [c22]Alan M. Frieze
Learning Linear Transformations. FOCS 1996: 359-368 - [c21]Andrei Z. Broder, Alan M. Frieze
A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS 1996: 390-399 - [c20]Hui Chen, Alan M. Frieze:
Coloring Bipartite Hypergraphs. IPCO 1996: 345-358 - [c19]Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal:
An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. SODA 1996: 261-268 - 1995
- [j89]Alan M. Frieze
An Analysis of a Monte Carlo Algorithm for Estimating the Permanent. Comb. 15(1): 67-83 (1995) - [j88]Alan M. Frieze
Covering the Edges of a Random Graph by Cliques. Comb. 15(4): 489-497 (1995) - [j87]Michael H. Albert, Alan M. Frieze, Bruce A. Reed:
Multicoloured Hamilton Cycles. Electron. J. Comb. 2 (1995) - [j86]Colin Cooper, Alan M. Frieze:
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. Electron. J. Comb. 2 (1995) - [j85]Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. Comb. Probab. Comput. 4: 47-66 (1995) - [j84]Colin Cooper, Alan M. Frieze:
On the Connectivity of Random k-th Nearest Neighbour Graphs. Comb. Probab. Comput. 4: 343-362 (1995) - [j83]Andrei Z. Broder, Alan M. Frieze
Balanced Allocations for Tree-Like Inputs. Inf. Process. Lett. 55(6): 329-332 (1995) - [j82]Andrei Z. Broder, Martin E. Dyer
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. 56(2): 79-81 (1995) - [j81]Martin E. Dyer
Ordering Clone Libraries in Computational Biology. J. Comput. Biol. 2(2): 207-218 (1995) - [j80]Martin E. Dyer
On Key Storage in Secure Networks. J. Cryptol. 8(4): 189-200 (1995) - [j79]Jonathan Aronson, Martin E. Dyer
Randomized Greedy Matching II. Random Struct. Algorithms 6(1): 55-74 (1995) - [j78]Noga Alon, Alan M. Frieze
Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Random Struct. Algorithms 6(4): 459-478 (1995) - [j77]Alan M. Frieze
Perfect Matchings in Random s-Uniform Hypergraphs. Random Struct. Algorithms 7(1): 41-58 (1995) - [j76]Alan M. Frieze
When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? SIAM J. Comput. 24(3): 484-493 (1995) - [c18]Alan M. Frieze, Mark Jerrum:
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. IPCO 1995: 1-13 - 1994
- [j75]Alan M. Frieze, Shang-Hua Teng:
On the Complexity of Computing the Diameter of a Polytope. Comput. Complex. 4: 207-219 (1994) - [j74]Colin Cooper, Alan M. Frieze, Michael Molloy:
Hamilton Cycles in Random Regular Digraphs. Comb. Probab. Comput. 3: 39-49 (1994) - [j73]Alan M. Frieze
Broadcasting in Random Graphs. Discret. Appl. Math. 54(1): 77-79 (1994) - [j72]Yossi Azar, Andrei Z. Broder, Alan M. Frieze
On the Problem of Approximating the Number of Bases of a Matroid. Inf. Process. Lett. 50(1): 9-11 (1994) - [j71]Martin E. Dyer
The Probability of Unique Solutions of Sequencing by Hybridization. J. Comput. Biol. 1(2): 105-110 (1994) - [j70]Colin Cooper, Alan M. Frieze
Hamilton Cycles in a Class of Random Directed Graphs. J. Comb. Theory B 62(1): 151-163 (1994) - [j69]Martin E. Dyer
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Math. Program. 64: 1-16 (1994) - [j68]Alan M. Frieze
Introduction. Random Struct. Algorithms 5(1): 1-3 (1994) - [j67]Alan M. Frieze
Multicolored Trees in Random Graphs. Random Struct. Algorithms 5(1): 45-56 (1994) - [j66]Andrei Z. Broder, Alan M. Frieze
Finding Hidden Hamiltonian Cycles. Random Struct. Algorithms 5(3): 395-411 (1994) - [j65]Andrei Z. Broder, Alan M. Frieze
Near-perfect Token Distribution. Random Struct. Algorithms 5(4): 559-572 (1994) - [j64]Alan M. Frieze
On the Independence Number of Random Cubic Graphs. Random Struct. Algorithms 5(5): 649-664 (1994) - [j63]Andrei Z. Broder, Alan M. Frieze
Existence and Construction of Edge-Disjoint Paths on Expander Graphs. SIAM J. Comput. 23(5): 976-989 (1994) - [c17]Noga Alon, Alan M. Frieze, Dominic Welsh:
Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs. FOCS 1994: 24-35 - [c16]Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen:
On the Greedy Heuristic for Matchings. SODA 1994: 141-149 - [c15]Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
Approximately Counting Hamilton Cycles in Dense Graphs. SODA 1994: 336-343 - [c14]Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal:
Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA 1994: 603-612 - [i1]Noga Alon, Alan M. Frieze, Dominic Welsh:
Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Electron. Colloquium Comput. Complex. TR94 (1994) - 1993
- [j62]Martin E. Dyer
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Comb. Probab. Comput. 2: 271-284 (1993) - [j61]Alan M. Frieze
Polychromatic Hamilton cycles. Discret. Math. 118(1-3): 69-74 (1993) - [c13]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA 1993: 322-330 - [c12]Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. SODA 1993: 341-351 - 1992
- [j60]Neil J. Calkin
On Subgraph Sizes in Random Graphs. Comb. Probab. Comput. 1: 123-134 (1992) - [j59]Alan M. Frieze
On the independence and chromatic numbers of random regular graphs. J. Comb. Theory B 54(1): 123-132 (1992) - [j58]Martin E. Dyer
Probabilistic analysis of the generalised assignment problem. Math. Program. 55: 169-181 (1992) - [j57]Neil J. Calkin
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. Random Struct. Algorithms 3(2): 215-222 (1992) - [j56]Alan M. Frieze
Counting the Number of Hamilton Cycles in Random Digraphs. Random Struct. Algorithms 3(3): 235-242 (1992) - [c11]Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
Near-perfect Token Distribution. ICALP 1992: 308-317 - [c10]Martin E. Dyer, Alan M. Frieze:
Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. IPCO 1992: 72-84 - [c9]Alan M. Frieze, Richard M. Karp, Bruce A. Reed:
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? IPCO 1992: 453-461 - [c8]Alan M. Frieze, Gary L. Miller, Shang-Hua Teng:
Separator Based Parallel Divide and Conquer in Computational Geometry. SPAA 1992: 420-429 - [c7]Andrei Z. Broder, Alan M. Frieze, Eli Upfal
Existence and Construction of Edge Disjoint Paths on Expander Graphs. STOC 1992: 140-149 - 1991
- [j55]Michael H. Albert, Alan M. Frieze
Occupancy problems and random algebras. Discret. Math. 87(1): 1-8 (1991) - [j54]Martin E. Dyer
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. J. ACM 38(1): 1-17 (1991) - [j53]Martin E. Dyer
Randomized Greedy Matching. Random Struct. Algorithms 2(1): 29-46 (1991) - [j52]Béla Bollobás, Alan M. Frieze:
Spanning Maximal Planar Subgraphs of Random Graphs. Random Struct. Algorithms 2(2): 225-232 (1991) - [j51]Martin E. Dyer
Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. Random Struct. Algorithms 2(2): 233-240 (1991) - [c6]Andrei Z. Broder, Alan M. Frieze, Eli Shamir:
Finding Hidden Hamiltonian Cycles (Extended Abstract). STOC 1991: 182-189 - 1990
- [j50]Martin E. Dyer
On an optimization problem with nested constraints. Discret. Appl. Math. 26(2-3): 159-173 (1990) - [j49]Alan M. Frieze
On the independence number of random graphs. Discret. Math. 81(2): 171-175 (1990) - [j48]Colin Cooper, Alan M. Frieze
The limiting probability that alpha-in, ß-out is strongly connected. J. Comb. Theory B 48(1): 117-134 (1990) - [j47]Martin E. Dyer
On Patching Algorithms for Random Asymmetric Travelling Salesman Problems. Math. Program. 46: 361-378 (1990) - [j46]Neil J. Calkin
Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. Random Struct. Algorithms 1(1): 39-50 (1990) - [j45]Alan M. Frieze
Greedy Matching on the Line. SIAM J. Comput. 19(4): 666-672 (1990) - [c5]Martin E. Dyer, Alan M. Frieze:
Probabilistic Analysis of the Generalised Assignment Problem. IPCO 1990: 189-200
1980 – 1989
- 1989
- [j44]Alan M. Frieze
Survival time of a random graph. Comb. 9(2): 133-143 (1989) - [j43]Alan M. Frieze
On random minimum lenght spanning trees. Comb. 9(4): 363-374 (1989) - [j42]Martin E. Dyer
The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. J. Algorithms 10(4): 451-489 (1989) - [j41]Colin Cooper, Alan M. Frieze
On the number of hamilton cycles in a random graph. J. Graph Theory 13(6): 719-735 (1989) - [j40]Martin E. Dyer, Alan M. Frieze
Probabilistic Analysis of the Multidimensional Knapsack Problem. Math. Oper. Res. 14(1): 162-176 (1989) - [j39]Martin E. Dyer
A randomized algorithm for fixed-dimensional linear programming. Math. Program. 44(1-3): 203-212 (1989) - [j38]Alan M. Frieze
Algorithms for assignment problems on an array processor. Parallel Comput. 11(2): 151-162 (1989) - [c4]Martin E. Dyer
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. STOC 1989: 375-381 - 1988
- [j37]Alan M. Frieze
Partitioning random graphs into large cycles. Discret. Math. 70(2): 149-158 (1988) - [j36]Alan M. Frieze
On the Random Construction of Heaps. Inf. Process. Lett. 27(2): 103-109 (1988) - [j35]Alan M. Frieze
An Algorithm for Finding Hamilton Cycles in Random Directed Graphs. J. Algorithms 9(2): 181-204 (1988) - [j34]Alan M. Frieze
Finding hamilton cycles in sparse random graphs. J. Comb. Theory B 44(2): 230-250 (1988) - [j33]Alan M. Frieze
Edge-colouring random graphs. J. Comb. Theory B 45(2): 135-149 (1988) - [j32]Sang Ahn, Colin Cooper, Gérard Cornuéjols, Alan M. Frieze
Probabilistic Analysis of a Relaxation for the k-Median Problem. Math. Oper. Res. 13(1): 1-31 (1988) - [j31]Alan M. Frieze
Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAM J. Comput. 17(2): 262-280 (1988) - [j30]Martin E. Dyer
On the Complexity of Computing the Volume of a Polyhedron. SIAM J. Comput. 17(5): 967-974 (1988) - 1987
- [j29]Alan M. Frieze
Large holes in sparse random graphs. Comb. 7(3): 265-274 (1987) - [j28]Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
An algorithm for finding Hamilton cycles in a random graph. Comb. 7(4): 327-341 (1987) - [j27]Alan M. Frieze
Parallel Algorithms for Finding Hamilton Cycles in Random Graphs. Inf. Process. Lett. 25(2): 111-117 (1987) - [j26]Alan M. Frieze
Large induced trees in sparse random graphs. J. Comb. Theory B 42(2): 181-195 (1987) - [j25]Alan M. Frieze
On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients. SIAM J. Comput. 16(6): 1052-1072 (1987) - 1986
- [j24]Alan M. Frieze
On large matchings and cycles in sparse random graphs. Discret. Math. 59(3): 243-256 (1986) - [j23]Martin E. Dyer
Planar 3DM is NP-Complete. J. Algorithms 7(2): 174-184 (1986) - [j22]Alan M. Frieze
Maximum matchings in a class of random graphs. J. Comb. Theory B 40(2): 196-212 (1986) - [j21]Martin E. Dyer
On linear programs with random costs. Math. Program. 35(1): 3-16 (1986) - [j20]Alan M. Frieze
On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem. SIAM J. Comput. 15(2): 536-539 (1986) - [c3]Martin E. Dyer
Fast Solution of Some Random NP-Hard Problems. FOCS 1986: 331-336 - 1985
- [j19]Trevor I. Fenner, Alan M. Frieze:
An Algorithm for Finding a Matroid Basis which Maximizes the Products of the Weights of the Elements. BIT 25(3): 433-438 (1985) - [j18]Alan M. Frieze
On the value of a random minimum spanning tree problem. Discret. Appl. Math. 10(1): 47-56 (1985) - [j17]Alan M. Frieze
The shortest-path problem for graphs with random arc-lengths. Discret. Appl. Math. 10(1): 57-77 (1985) - [j16]Martin E. Dyer
On the complexity of partitioning graphs into connected subgraphs. Discret. Appl. Math. 10(2): 139-153 (1985) - [j15]Alan M. Frieze:
Limit Distribution for the Existence of Hamiltonian Cycles in Random Bipartite Graphs. Eur. J. Comb. 6(4): 327-334 (1985) - [c2]Béla Bollobás, Trevor I. Fenner, Alan M. Frieze:
An Algorithm for Finding Hamilton Cycles in a Random Graph. STOC 1985: 430-439 - 1984
- [j14]Martin E. Dyer
A Partitioning Algorithm for Minimum Weighted Euclidean Matching. Inf. Process. Lett. 18(2): 59-62 (1984) - [j13]Trevor I. Fenner, Alan M. Frieze
Hamiltonian cycles in random regular graphs. J. Comb. Theory B 37(2): 103-112 (1984) - [c1]Alan M. Frieze, Ravi Kannan, J. C. Lagarias:
Linear Congruential Generators Do Not Produce Random Sequences. FOCS 1984: 480-484 - 1983
- [j12]Alan M. Frieze
On the quadratic assignment problem. Discret. Appl. Math. 5(1): 89-98 (1983) - [j11]Alan M. Frieze
An extension of Christofides heuristic to the k-person travelling salesman problem. Discret. Appl. Math. 6(1): 79-83 (1983) - [j10]Trevor I. Fenner, Alan M. Frieze
On the existence of Hamiltonian cycles in a class of random graphs. Discret. Math. 45(2-3): 301-305 (1983) - [j9]Alan M. Frieze
Corrigendum: Algebraic Linear Programming. Math. Oper. Res. 8(3): 477 (1983) - 1982
- [j8]Trevor I. Fenner, Alan M. Frieze
On the connectivity of random m-orientable graphs and digraphs. Comb. 2(4): 347-359 (1982) - [j7]Alan M. Frieze
Algebraic Linear Programming. Math. Oper. Res. 7(2): 172-182 (1982) - [j6]Alan M. Frieze
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12(1): 23-39 (1982) - 1980
- [j5]Alan M. Frieze
Probabilistic analysis of some euclidean clustering problems. Discret. Appl. Math. 2(4): 295-309 (1980)
1970 – 1979
- 1979
- [j4]Alan M. Frieze
An algorithm for algebraic assignment problems. Discret. Appl. Math. 1(4): 253-259 (1979) - 1976
- [j3]Alan M. Frieze
Shortest path algorithms for knapsack type problems. Math. Program. 11(1): 150-157 (1976) - 1974
- [j2]Alan M. Frieze:
A cost function property for plant location problems. Math. Program. 7(1): 245-248 (1974) - [j1]Alan M. Frieze:
A bilinear programming formulation of the 3-dimensional assignment problem. Math. Program. 7(1): 376-379 (1974)
Coauthor Index
[j299] [j282] [j275] [j272] [c91] [j261] [c90] [c89] [i30] [i28] [i25] [j254] [j253] [j251] [c86] [i21] [j246] [j237] [j232] [j231] [j224] [j219] [j214] [j213] [c81] [j203] [c79] [c77] [i13] [j194] [j193] [j191] [i6] [j189] [j186] [c74] [c73] [c72] [j181] [c68] [j178] [j169] [j168] [c66] [j163] [j154] [c57] [j151] [j143] [j142] [j141] [j139] [c50] [j135] [j134] [j133] [c46] [c45] [j123] [c44] [j120] [j114] [j113] [j112] [j105] [c28] [j94] [j86] [j84] [j74] [j70] [j48] [j41] [j32]
Abraham D. Flaxman
aka: Abraham Flaxman
aka: Abraham Flaxman
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: