Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alan M. Frieze
2010 – today
- 2013
[j204]Alan M. Frieze, Paul Horn, Pawel Pralat: Special Issue on Algorithms and Models for the Web Graph. Internet Mathematics 9(1): 1-2 (2013)- [j203]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)
- [j202]Andrzej Dudek, Alan M. Frieze: Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms 42(3): 374-385 (2013)
- 2012
- [j201]Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski: Rainbow Hamilton Cycles in Uniform Hypergraphs. Electr. J. Comb. 19(1): P46 (2012)
- [j200]Andrzej Dudek, Alan M. Frieze, Po-Shen Loh, Shelley Speiss: Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. Electr. J. Comb. 19(4): P44 (2012)
- [j199]Alan M. Frieze, Charalampos E. Tsourakakis: Rainbow Connection of Sparse Random Graphs. Electr. J. Comb. 19(4): P5 (2012)
- [j198]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller: Cops and Robbers on Geometric Graphs. Combinatorics, Probability & Computing 21(6): 816-834 (2012)
- [j197]Mohammed Abdullah, Colin Cooper, Alan M. Frieze: Cover time of a random graph with given degree sequence. Discrete Mathematics 312(21): 3146-3163 (2012)
- [j196]Colin Cooper, Alan M. Frieze: Stationary distribution and cover time of random walks on random digraphs. J. Comb. Theory, Ser. B 102(2): 329-362 (2012)
- [j195]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh: Variations on cops and robbers. Journal of Graph Theory 69(4): 383-402 (2012)
- [j194]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh: Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms 40(3): 269-300 (2012)
- [j193]Alan M. Frieze, Michael Krivelevich: Packing hamilton cycles in random and pseudo-random hypergraphs. Random Struct. Algorithms 41(1): 1-22 (2012)
- [j192]Alan M. Frieze, Páll Melsted: Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables. Random Struct. Algorithms 41(3): 334-364 (2012)
- [j191]Deepak Bal, Alan M. Frieze: Packing Tight Hamilton Cycles in Uniform Hypergraphs. SIAM J. Discrete Math. 26(2): 435-451 (2012)
- [c82]
- [c81]Alan M. Frieze, Charalampos E. Tsourakakis: Rainbow Connectivity of Sparse Random Graphs. APPROX-RANDOM 2012: 541-552
- [c80]Colin Cooper, Alan M. Frieze, Pawel Pralat: Some Typical Properties of the Spatial Preferred Attachment Model. WAW 2012: 29-40
- [c79]Alan M. Frieze, Charalampos E. Tsourakakis: On Certain Properties of Random Apollonian Networks. WAW 2012: 93-112
- [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
- [j190]Andrzej Dudek, Alan M. Frieze: Loose Hamilton Cycles in Random Uniform Hypergraphs. Electr. J. Comb. 18(1) (2011)
- [j189]Tom Bohman, Alan M. Frieze: Karp-Sipser on Random Graphs with a Fixed Degree Sequence. Combinatorics, Probability & Computing 20(5): 721-741 (2011)
- [j188]Alan M. Frieze, Páll Melsted: Randomly coloring simple hypergraphs. Inf. Process. Lett. 111(17): 848-853 (2011)
- [j187]Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov: Ramsey games with giants. Random Struct. Algorithms 38(1-2): 1-32 (2011)
- [j186]Colin Cooper, Alan M. Frieze: The cover time of random geometric graphs. Random Struct. Algorithms 38(3): 324-349 (2011)
- [j185]Alan M. Frieze, Páll Melsted, Michael Mitzenmacher: An Analysis of Random-Walk Cuckoo Hashing. SIAM J. Comput. 40(2): 291-308 (2011)
- [c78]Colin Cooper, Alan M. Frieze, Tomasz Radzik: The Cover Times of Random Walks on Hypergraphs. SIROCCO 2011: 210-221
- [c77]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh: Packing tight Hamilton cycles in 3-uniform hypergraphs. SODA 2011: 913-932
- [c76]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 (Eds.): 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
- [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]
- [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
- [j184]Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko: Hypergraphs with independent neighborhoods. Combinatorica 30(3): 277-293 (2010)
- [j183]Alan M. Frieze: Loose Hamilton Cycles in Random 3-Uniform Hypergraphs. Electr. J. Comb. 17(1) (2010)
- [j182]
- [j181]Prasad Chebolu, Alan M. Frieze, Páll Melsted: Finding a maximum matching in a sparse random graph in O(n) expected time. J. ACM 57(4) (2010)
- [j180]Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Clifford D. Smyth: Anti-Ramsey properties of random graphs. J. Comb. Theory, Ser. B 100(3): 299-312 (2010)
- [j179]Tom Bohman, Alan M. Frieze, Dhruv Mubayi: Coloring H-free hypergraphs. Random Struct. Algorithms 36(1): 11-25 (2010)
- [j178]Martin E. Dyer, Alan M. Frieze: Randomly coloring random graphs. Random Struct. Algorithms 36(3): 251-272 (2010)
- [j177]Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze: An Efficient Sparse Regularity Concept. SIAM J. Discrete Math. 23(4): 2000-2034 (2010)
- [j176]Colin Cooper, Alan M. Frieze, Michael Krivelevich: Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discrete Math. 24(2): 558-569 (2010)
- [j175]Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko: Flips in Graphs. SIAM J. Discrete Math. 24(3): 1046-1055 (2010)
- [j174]Colin Cooper, Alan M. Frieze: Random Walks with Look-Ahead in Scale-Free Random Graphs. SIAM J. Discrete 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
- [j173]Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany: Line-of-Sight Networks. Combinatorics, Probability & Computing 18(1-2): 145-163 (2009)
- [j172]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)
- [j171]Tom Bohman, Alan M. Frieze: Hamilton cycles in 3-out. Random Struct. Algorithms 35(4): 393-417 (2009)
- [j170]Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko: Memoryless Rules for Achlioptas Processes. SIAM J. Discrete Math. 23(2): 993-1008 (2009)
- [j169]Colin Cooper, Alan M. Frieze, Tomasz Radzik: Multiple Random Walks in Random Regular Graphs. SIAM J. Discrete Math. 23(4): 1738-1761 (2009)
- [c75]Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin: Average-Case Analyses of Vickrey Costs. APPROX-RANDOM 2009: 434-447
- [c74]Alan M. Frieze, Páll Melsted, Michael Mitzenmacher: An Analysis of Random-Walk Cuckoo Hashing. APPROX-RANDOM 2009: 490-503
- [c73]Colin Cooper, Alan M. Frieze, Tomasz Radzik: Multiple Random Walks and Interacting Particle Systems. ICALP (2) 2009: 399-410
- [c72]
- [c71]Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze: An efficient sparse regularity concept. SODA 2009: 207-216
- [c70]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]
- [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
- [j168]Amin Coja-Oghlan, Alan M. Frieze: Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k. Electr. J. Comb. 15(1) (2008)
- [j167]
- [j166]Alan M. Frieze, Dhruv Mubayi: On the Chromatic Number of Simple Triangle-Free Triple Systems. Electr. J. Comb. 15(1) (2008)
- [j165]Tom Bohman, Alan M. Frieze, Benny Sudakov: The game chromatic number of random graphs. Random Struct. Algorithms 32(2): 223-235 (2008)
- [j164]Colin Cooper, Alan M. Frieze: The cover time of the giant component of a random graph. Random Struct. Algorithms 32(4): 401-439 (2008)
- [j163]Prasad Chebolu, Alan M. Frieze: Hamilton Cycles in Random Lifts of Directed Graphs. SIAM J. Discrete Math. 22(2): 520-540 (2008)
- [j162]Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko: Game chromatic index of graphs with given restrictions on degrees. Theor. Comput. Sci. 407(1-3): 242-249 (2008)
- [c69]
- [c68]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
- [c67]
- [c66]
- 2007
- [j161]Colin Cooper, Alan M. Frieze, Gregory B. Sorkin: Random 2-SAT with Prescribed Literal Degrees. Algorithmica 48(3): 249-265 (2007)
- [j160]Abraham D. Flaxman, Alan M. Frieze, Juan Vera: Adversarial Deletion in a Scale-Free Random Graph Process. Combinatorics, Probability & Computing 16(2): 261-270 (2007)
- [j159]Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky: First-Order Definability of Trees and Sparse Random Graphs. Combinatorics, Probability & Computing 16(3): 375-400 (2007)
- [j158]Abraham D. Flaxman, Alan M. Frieze, Juan Carlos Vera: On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. Combinatorics, Probability & Computing 16(5): 713-732 (2007)
- [j157]Alan M. Frieze, Michael Krivelevich, Clifford D. Smyth: On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. Combinatorics, Probability & Computing 16(5): 733-746 (2007)
- [j156]Alan M. Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth: Codes identifying sets of vertices in random networks. Discrete Mathematics 307(9-10): 1094-1107 (2007)
- [j155]Abraham D. Flaxman, Alan M. Frieze, Juan Vera: A Geometric Preferential Attachment Model of Networks. Internet Mathematics 3(2): 187-205 (2007)
- [j154]Alan M. Frieze, Juan Vera, Soumen Chakrabarti: The Influence of Search Engines on Preferential Attachment. Internet Mathematics 3(3): 361-381 (2007)
- [j153]Abraham D. Flaxman, Alan M. Frieze, Juan Vera: A Geometric Preferential Attachment Model of Networks II. Internet Mathematics 4(1): 87-111 (2007)
- [j152]Colin Cooper, Alan M. Frieze: The cover time of the preferential attachment graph. J. Comb. Theory, Ser. B 97(2): 269-290 (2007)
- [j151]Colin Cooper, Alan M. Frieze: The cover time of sparse random graphs. Random Struct. Algorithms 30(1-2): 1-16 (2007)
- [j150]Tom Bohman, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó, Clifford D. Smyth: Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30(1-2): 17-34 (2007)
- [j149]Abraham D. Flaxman, Alan M. Frieze: The diameter of randomly perturbed digraphs and some applications. Random Struct. Algorithms 30(4): 484-504 (2007)
- [j148]Alan M. Frieze, Gregory B. Sorkin: The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. SIAM J. Comput. 36(5): 1435-1452 (2007)
- [c65]
- [c64]Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou: Separating Populations with Wide Data: A Spectral Analysis. ISAAC 2007: 439-451
- [c63]Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany: Line-of-sight networks. SODA 2007: 968-977
- [c62]Abraham D. Flaxman, Alan M. Frieze, Juan Vera: A Geometric Preferential Attachment Model of Networks II. WAW 2007: 41-55
- 2006
- [j147]Alan M. Frieze, Juan Vera: On randomly colouring locally sparse graphs. Discrete Mathematics & Theoretical Computer Science 8(1): 121-128 (2006)
- [j146]K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze: Hamilton cycles in random lifts of graphs. Eur. J. Comb. 27(8): 1282-1293 (2006)
- [j145]Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich: On the random 2-stage minimum spanning tree. Random Struct. Algorithms 28(1): 24-36 (2006)
- [j144]Alan M. Frieze, Michael Molloy: The satisfiability threshold for randomly generated binary constraint satisfaction problems. Random Struct. Algorithms 28(3): 323-339 (2006)
- [j143]Alan M. Frieze, Michael Krivelevich: Almost universal graphs. Random Struct. Algorithms 28(4): 499-510 (2006)
- [j142]Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda: Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29(4): 450-465 (2006)
- [c61]
- 2005
- [j141]Alan M. Frieze, Nicholas C. Wormald: Random k-Sat: A Tight Threshold For Moderately Growing k. Combinatorica 25(3): 297-305 (2005)
- [j140]Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner: High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Mathematics 2(1): 1-19 (2005)
- [j139]Alan M. Frieze, Michael Krivelevich: On packing Hamilton cycles in ?-regular graphs. J. Comb. Theory, Ser. B 94(1): 159-172 (2005)
- [j138]Alan M. Frieze: Perfect matchings in random bipartite graphs with minimal degree at least 2. Random Struct. Algorithms 26(3): 319-358 (2005)
- [j137]Colin Cooper, Alan M. Frieze: The Cover Time of Random Regular Graphs. SIAM J. Discrete Math. 18(4): 728-740 (2005)
- [j136]Alan M. Frieze, Michael Krivelevich, Benny Sudakov: The Strong Chromatic Index of Random Graphs. SIAM J. Discrete Math. 19(3): 719-727 (2005)
- [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]
- [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
- [j135]Geoffrey Atkinson, Alan M. Frieze: On the b-Independence Number of Sparse Random Graphs. Combinatorics, Probability & Computing 13(3): 295-309 (2004)
- [j134]Colin Cooper, Alan M. Frieze: The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. Combinatorics, Probability & Computing 13(3): 319-337 (2004)
- [j133]Alan M. Frieze, Ravi Kannan, Santosh Vempala: Fast monte-carlo algorithms for finding low-rank approximations. J. ACM 51(6): 1025-1041 (2004)
- [j132]Abraham Flaxman, Alan M. Frieze, Eli Upfal: Efficient communication in an ad-hoc network. J. Algorithms 52(1): 1-7 (2004)
- [j131]Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay: Clustering Large Graphs via the Singular Value Decomposition. Machine Learning 56(1-3): 9-33 (2004)
- [j130]Alan M. Frieze: On Random Symmetric Travelling Salesman Problems. Math. Oper. Res. 29(4): 878-890 (2004)
- [j129]Alan M. Frieze, Michael Krivelevich, Ryan Martin: The emergence of a giant component in random subgraphs of pseudo-random graphs. Random Struct. Algorithms 24(1): 42-50 (2004)
- [j128]Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin: Adding random edges to dense graphs. Random Struct. Algorithms 24(2): 105-117 (2004)
- [j127]Tom Bohman, Alan M. Frieze, Nicholas C. Wormald: 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, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda: 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. Electronic Colloquium on Computational Complexity (ECCC)(009) (2004)
- 2003
- [j126]Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó: On Randomly Generated Intersecting Hypergraphs. Electr. J. Comb. 10 (2003)
- [j125]Colin Cooper, Alan M. Frieze: Crawling on Simple Models of Web Graphs. Internet Mathematics 1(1): 57-90 (2003)
- [j124]Colin Cooper, Alan M. Frieze, Juan Vera: Random Deletion in a Scale-Free Random Graph Process. Internet Mathematics 1(4): 463-483 (2003)
- [j123]Tom Bohman, Alan M. Frieze, Ryan Martin: How many random edges make a dense graph hamiltonian? Random Struct. Algorithms 22(1): 33-42 (2003)
- [j122]Colin Cooper, Alan M. Frieze: A general model of web graphs. Random Struct. Algorithms 22(3): 311-335 (2003)
- [j121]Martin E. Dyer, Alan M. Frieze: Randomly coloring graphs with lower bounds on girth and maximum degree. Random Struct. Algorithms 23(2): 167-179 (2003)
- [j120]Tom Bohman, Alan M. Frieze: Arc-Disjoint Paths in Expander Digraphs. SIAM J. Comput. 32(2): 326-344 (2003)
- [j119]Martin E. Dyer, Alan M. Frieze, Michael Molloy: 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]
- [c49]Alan M. Frieze, Boris Pittel: Perfect matchings in random graphs with prescribed minimal degree. SODA 2003: 148-157
- 2002
- [j118]Colin Cooper, Alan M. Frieze: Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. Combinatorics, Probability & Computing 11(2): 129-133 (2002)
- [j117]Colin Cooper, Alan M. Frieze, Bruce A. Reed: Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Combinatorics, Probability & Computing 11(3): 249-261 (2002)
- [j116]Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan: Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Combinatorics, Probability & Computing 11(4): 323-341 (2002)
- [j115]Alan M. Frieze, Michael Krivelevich: Hamilton cycles in random subgraphs of pseudo-random graphs. Discrete Mathematics 256(1-2): 137-150 (2002)
- [j114]Alan M. Frieze, Bjarni V. Halldórsson: Optimal Sequencing by Hybridization in Rounds. Journal of Computational Biology 9(2): 355-369 (2002)
- [j113]Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender: On graph irregularity strength. Journal of Graph Theory 41(2): 120-137 (2002)
- [j112]Sanjeev Arora, Alan M. Frieze, Haim Kaplan: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program. 92(1): 1-36 (2002)
- [j111]Tom Bohman, Alan M. Frieze: Addendum to avoiding a giant component. Random Struct. Algorithms 20(1): 126-130 (2002)
- [j110]Martin E. Dyer, Alan M. Frieze, Mark Jerrum: On Counting Independent Sets in Sparse Graphs. SIAM J. Comput. 31(5): 1527-1541 (2002)
- [c48]
- [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]
- 2001
- [j109]Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Vertex Covers by Edge Disjoint Cliques. Combinatorica 21(2): 171-197 (2001)
- [j108]Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: G-Intersecting Families. Combinatorics, Probability & Computing 10(5): 367-384 (2001)
- [j107]Andrei Z. Broder, Alan M. Frieze, Eli Upfal: A general approach to dynamic packet routing with bounded buffers. J. ACM 48(2): 324-349 (2001)
- [j106]Colin Cooper, Martin E. Dyer, Alan M. Frieze: On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms 39(1): 117-134 (2001)
- [j105]Alan M. Frieze: Hamilton cycles in the union of random permutations. Random Struct. Algorithms 18(1): 83-94 (2001)
- [j104]Tom Bohman, Alan M. Frieze: Avoiding a giant component. Random Struct. Algorithms 19(1): 75-85 (2001)
- [c44]
- [c43]
- [c42]Martin E. Dyer, Alan M. Frieze: 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
- [j103]Tom Bohman, Colin Cooper, Alan M. Frieze: Min-Wise Independent Linear Permutations. Electr. J. Comb. 7 (2000)
- [j102]Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Note on Sparse Random Graphs and Cover Graphs. Electr. J. Comb. 7 (2000)
- [j101]Alan M. Frieze: On the Number of Perfect Matchings and Hamilton Cycles in e-Regular Non-bipartite Graphs. Electr. J. Comb. 7 (2000)
- [j100]Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: A Note on Random Minimum Length Spanning Trees. Electr. J. Comb. 7 (2000)
- [j99]Alan M. Frieze, Lei Zhao: Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs. Combinatorics, Probability & Computing 9(3): 241-263 (2000)
- [j98]Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher: Min-Wise Independent Permutations. J. Comput. Syst. Sci. 60(3): 630-659 (2000)
- [j97]Béla Bollobás, Colin Cooper, Trevor I. Fenner, Alan M. Frieze: Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k. Journal of Graph Theory 34(1): 42-59 (2000)
- [j96]Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe: Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms 16(1): 33-46 (2000)
- [j95]Colin Cooper, Alan M. Frieze: Hamilton cycles in random graphs and directed graphs. Random Struct. Algorithms 16(4): 369-401 (2000)
- [j94]
- [c39]
1990 – 1999
- 1999
- [j93]Alan M. Frieze, Ravi Kannan: Quick Approximation to Matrices and Applications. Combinatorica 19(2): 175-220 (1999)
- [j92]Alan M. Frieze, Ravi Kannan: A Simple Algorithm for Constructing Szemere'di's Regularity Partition. Electr. J. Comb. 6 (1999)
- [j91]
- [j90]Alan M. Frieze, Franco P. Preparata, Eli Upfal: Optimal Reconstruction of a Sequence from its Probes. Journal of Computational Biology 6(3/4): 361-368 (1999)
- [j89]Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Random Struct. Algorithms 14(1): 87-109 (1999)
- [j88]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)
- [j87]Alan M. Frieze, Michal Karonski, Lubos Thoma: On Perfect Matchings and Hamilton Cycles in Sums of Random Trees. SIAM J. Discrete Math. 12(2): 208-216 (1999)
- [c38]Martin E. Dyer, Alan M. Frieze, Mark Jerrum: 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, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay: Clustering in Large Graphs and Matrices. SODA 1999: 291-299
- [c34]
- 1998
- [j86]Alan M. Frieze, Wojciech Szpankowski: Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. Algorithmica 21(1): 21-36 (1998)
- [j85]Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala: A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica 22(1/2): 35-52 (1998)
- [j84]Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha: Average-Case Analysis of the Merging Algorithm of Hwang and Lin. Algorithmica 22(4): 483-489 (1998)
- [j83]Andrew Beveridge, Alan M. Frieze, Colin McDiarmid: Random Minimum Length Spanning Trees in Regular Graphs. Combinatorica 18(3): 311-333 (1998)
- [j82]Jonathan Aronson, Alan M. Frieze, Boris Pittel: Maximum matchings in sparse random graphs: Karp-Sipser revisited. Random Struct. Algorithms 12(2): 111-177 (1998)
- [j81]Martin E. Dyer, Alan M. Frieze, Mark Jerrum: Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM J. Comput. 27(5): 1262-1272 (1998)
- [j80]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, Ravi Kannan, Santosh Vempala: Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. FOCS 1998: 370-378
- [c32]Andrei Z. Broder, Alan M. Frieze, Eli Upfal: 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, Alan M. Frieze, Michael Mitzenmacher: Min-Wise Independent Permutations (Extended Abstract). STOC 1998: 327-336
- 1997
- [j79]Alan M. Frieze, Mark Jerrum: Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18(1): 67-81 (1997)
- [j78]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
- [j77]Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed: Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Combinatorics, Probability & Computing 5: 1-14 (1996)
- [j76]Béla Bollobás, Trevor I. Fenner, Alan M. Frieze: On the Best Case of Heapsort. J. Algorithms 20(2): 205-217 (1996)
- [j75]Alan M. Frieze, Stephen Suen: Analysis of Two Simple Heuristics on a Random Instance of k-SAT. J. Algorithms 20(2): 312-355 (1996)
- [j74]Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald: Generating and Counting Hamilton Cycles in Random Regular Graphs. J. Algorithms 21(1): 176-198 (1996)
- [j73]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, Ravi Kannan: The Regularity Lemma and Approximation Schemes for Dense Problems. FOCS 1996: 12-20
- [c24]Sanjeev Arora, Alan M. Frieze, Haim Kaplan: 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, Ravi Kannan, Santosh Vempala: A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. FOCS 1996: 330-338
- [c22]
- [c21]Andrei Z. Broder, Alan M. Frieze, Eli Upfal: A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS 1996: 390-399
- [c20]
- [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
- [j72]Alan M. Frieze, Mark Jerrum: An Analysis of a Monte Carlo Algorithm for Estimating the Permanent. Combinatorica 15(1): 67-83 (1995)
- [j71]Alan M. Frieze, Bruce A. Reed: Covering the Edges of a Random Graph by Cliques. Combinatorica 15(4): 489-497 (1995)
- [j70]Michael H. Albert, Alan M. Frieze, Bruce A. Reed: Multicoloured Hamilton Cycles. Electr. J. Comb. 2 (1995)
- [j69]Colin Cooper, Alan M. Frieze: Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. Electr. J. Comb. 2 (1995)
- [j68]Alan M. Frieze, A. J. Radcliffe, Stephen Suen: Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. Combinatorics, Probability & Computing 4: 47-66 (1995)
- [j67]Colin Cooper, Alan M. Frieze: On the Connectivity of Random k-th Nearest Neighbour Graphs. Combinatorics, Probability & Computing 4: 343-362 (1995)
- [j66]Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven Phillips, Nick Reingold: Balanced Allocations for Tree-Like Inputs. Inf. Process. Lett. 55(6): 329-332 (1995)
- [j65]Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal: The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. 56(2): 79-81 (1995)
- [j64]Martin E. Dyer, Alan M. Frieze, Stephen Suen: Ordering Clone Libraries in Computational Biology. Journal of Computational Biology 2(2): 207-218 (1995)
- [j63]Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason: On Key Storage in Secure Networks. J. Cryptology 8(4): 189-200 (1995)
- [j62]Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen: Randomized Greedy Matching II. Random Struct. Algorithms 6(1): 55-74 (1995)
- [j61]Noga Alon, Alan M. Frieze, Dominic Welsh: Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Random Struct. Algorithms 6(4): 459-478 (1995)
- [j60]Alan M. Frieze, Svante Janson: Perfect Matchings in Random s-Uniform Hypergraphs. Random Struct. Algorithms 7(1): 41-58 (1995)
- [j59]Alan M. Frieze, Richard M. Karp, Bruce A. Reed: 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
- [j58]Alan M. Frieze, Shang-Hua Teng: On the Complexity of Computing the Diameter of a Polytope. Computational Complexity 4: 207-219 (1994)
- [j57]Colin Cooper, Alan M. Frieze, Michael Molloy: Hamilton Cycles in Random Regular Digraphs. Combinatorics, Probability & Computing 3: 39-49 (1994)
- [j56]Alan M. Frieze, Michael Molloy: Broadcasting in Random Graphs. Discrete Applied Mathematics 54(1): 77-79 (1994)
- [j55]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)
- [j54]Martin E. Dyer, Alan M. Frieze, Stephen Suen: The Probability of Unique Solutions of Sequencing by Hybridization. Journal of Computational Biology 1(2): 105-110 (1994)
- [j53]Colin Cooper, Alan M. Frieze: Hamilton Cycles in a Class of Random Directed Graphs. J. Comb. Theory, Ser. B 62(1): 151-163 (1994)
- [j52]Martin E. Dyer, Alan M. Frieze: Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Math. Program. 64: 1-16 (1994)
- [j51]Alan M. Frieze, Svante Janson, Tomasz Luczak: Introduction. Random Struct. Algorithms 5(1): 1-3 (1994)
- [j50]Alan M. Frieze, Brendan D. McKay: Multicolored Trees in Random Graphs. Random Struct. Algorithms 5(1): 45-56 (1994)
- [j49]Andrei Z. Broder, Alan M. Frieze, Eli Shamir: Finding Hidden Hamiltonian Cycles. Random Struct. Algorithms 5(3): 395-411 (1994)
- [j48]Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal: Near-perfect Token Distribution. Random Struct. Algorithms 5(4): 559-572 (1994)
- [j47]Alan M. Frieze, Stephen Suen: On the Independence Number of Random Cubic Graphs. Random Struct. Algorithms 5(5): 649-664 (1994)
- [j46]Andrei Z. Broder, Alan M. Frieze, Eli Upfal: 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. Electronic Colloquium on Computational Complexity (ECCC) 1(5) (1994)
- 1993
- [j45]Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani: A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Combinatorics, Probability & Computing 2: 271-284 (1993)
- [j44]Alan M. Frieze, Bruce A. Reed: Polychromatic Hamilton cycles. Discrete Mathematics 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
- [j43]Neil J. Calkin, Alan M. Frieze, Brendan D. McKay: On Subgraph Sizes in Random Graphs. Combinatorics, Probability & Computing 1: 123-134 (1992)
- [j42]Alan M. Frieze, Tomasz Luczak: On the independence and chromatic numbers of random regular graphs. J. Comb. Theory, Ser. B 54(1): 123-132 (1992)
- [j41]Martin E. Dyer, Alan M. Frieze: Probabilistic analysis of the generalised assignment problem. Math. Program. 55: 169-181 (1992)
- [j40]Neil J. Calkin, Alan M. Frieze, Ludek Kucera: 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)
- [j39]Alan M. Frieze, Stephen Suen: 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
- [j38]Michael H. Albert, Alan M. Frieze: Occupancy problems and random algebras. Discrete Mathematics 87(1): 1-8 (1991)
- [j37]Martin E. Dyer, Alan M. Frieze, Ravi Kannan: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. J. ACM 38(1): 1-17 (1991)
- [j36]Martin E. Dyer, Alan M. Frieze: Randomized Greedy Matching. Random Struct. Algorithms 2(1): 29-46 (1991)
- [j35]Béla Bollobás, Alan M. Frieze: Spanning Maximal Planar Subgraphs of Random Graphs. Random Struct. Algorithms 2(2): 225-232 (1991)
- [j34]Martin E. Dyer, Alan M. Frieze: 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
- [j33]Martin E. Dyer, Alan M. Frieze: On an optimization problem with nested constraints. Discrete Applied Mathematics 26(2-3): 159-173 (1990)
- [j32]Alan M. Frieze: On the independence number of random graphs. Discrete Mathematics 81(2): 171-175 (1990)
- [j31]Colin Cooper, Alan M. Frieze: The limiting probability that alpha-in, ß-out is strongly connected. J. Comb. Theory, Ser. B 48(1): 117-134 (1990)
- [j30]Martin E. Dyer, Alan M. Frieze: On Patching Algorithms for Random Asymmetric Travelling Salesman Problems. Math. Program. 46: 361-378 (1990)
- [j29]Neil J. Calkin, Alan M. Frieze: Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. Random Struct. Algorithms 1(1): 39-50 (1990)
- [j28]Alan M. Frieze, Colin McDiarmid, Bruce A. Reed: 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
- [j27]
- [j26]Alan M. Frieze, Colin J. H. McDiarmid: On random minimum lenght spanning trees. Combinatorica 9(4): 363-374 (1989)
- [j25]Martin E. Dyer, Alan M. Frieze: The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. J. Algorithms 10(4): 451-489 (1989)
- [j24]Colin Cooper, Alan M. Frieze: On the number of hamilton cycles in a random graph. Journal of Graph Theory 13(6): 719-735 (1989)
- [j23]Alan M. Frieze, J. Yadegar, S. El-Horbaty, D. Parkinson: Algorithms for assignment problems on an array processor. Parallel Computing 11(2): 151-162 (1989)
- [c4]Martin E. Dyer, Alan M. Frieze, Ravi Kannan: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. STOC 1989: 375-381
- 1988
- [j22]Alan M. Frieze: Partitioning random graphs into large cycles. Discrete Mathematics 70(2): 149-158 (1988)
- [j21]
- [j20]Alan M. Frieze: An Algorithm for Finding Hamilton Cycles in Random Directed Graphs. J. Algorithms 9(2): 181-204 (1988)
- [j19]Alan M. Frieze: Finding hamilton cycles in sparse random graphs. J. Comb. Theory, Ser. B 44(2): 230-250 (1988)
- [j18]Alan M. Frieze, B. Jackson, Colin J. H. McDiarmid, Bruce A. Reed: Edge-colouring random graphs. J. Comb. Theory, Ser. B 45(2): 135-149 (1988)
- [j17]Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir: Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAM J. Comput. 17(2): 262-280 (1988)
- [j16]Martin E. Dyer, Alan M. Frieze: On the Complexity of Computing the Volume of a Polyhedron. SIAM J. Comput. 17(5): 967-974 (1988)
- 1987
- [j15]
- [j14]Béla Bollobás, Trevor I. Fenner, Alan M. Frieze: An algorithm for finding Hamilton cycles in a random graph. Combinatorica 7(4): 327-341 (1987)
- [j13]Alan M. Frieze: Parallel Algorithms for Finding Hamilton Cycles in Random Graphs. Inf. Process. Lett. 25(2): 111-117 (1987)
- [j12]Alan M. Frieze, B. Jackson: Large induced trees in sparse random graphs. J. Comb. Theory, Ser. B 42(2): 181-195 (1987)
- [j11]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
- [j10]Alan M. Frieze: On large matchings and cycles in sparse random graphs. Discrete Mathematics 59(3): 243-256 (1986)
- [j9]
- [j8]Alan M. Frieze: Maximum matchings in a class of random graphs. J. Comb. Theory, Ser. B 40(2): 196-212 (1986)
- [j7]Alan M. Frieze: On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem. SIAM J. Comput. 15(2): 536-539 (1986)
- [c3]
- 1985
- [j6]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): 434-438 (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
- [j5]Martin E. Dyer, Alan M. Frieze: A Partitioning Algorithm for Minimum Weighted Euclidean Matching. Inf. Process. Lett. 18(2): 59-62 (1984)
- [j4]Trevor I. Fenner, Alan M. Frieze: Hamiltonian cycles in random regular graphs. J. Comb. Theory, Ser. 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
- [j3]Trevor I. Fenner, Alan M. Frieze: On the existence of Hamiltonian cycles in a class of random graphs. Discrete Mathematics 45(2-3): 301-305 (1983)
- 1982
- [j2]Trevor I. Fenner, Alan M. Frieze: On the connectivity of random m-orientable graphs and digraphs. Combinatorica 2(4): 347-359 (1982)
- [j1]Alan M. Frieze, Giulia Galbiati, Francesco Maffioli: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12(1): 23-39 (1982)
Coauthor Index
[j203] [j197] [j196] [c80] [j186] [c78] [c76] [i13] [j177] [j176] [j174] [i6] [j172] [j169] [c73] [c72] [c71] [j164] [c67] [j161] [j152] [j151] [c65] [j146] [j137] [c57] [j134] [j126] [j125] [j124] [j122] [c50] [j118] [j117] [j116] [c46] [c45] [j106] [c44] [j103] [j97] [j96] [j95] [j88] [c28] [j77] [j69] [j67] [j57] [j53] [j31] [j24]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-13 22:23 CEST by the dblp team