 | Abraham D. Flaxman, Alan Frieze: On the random 2-stage minimum spanning tree. SODA 2005 PDF |
| Abraham D. Flaxman, Alan M. Frieze, Juan C. Vera: On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. Stock 2005 PDF |
| Alan Frieze, M.Krivelevich, and R. Martin: The emergence of a giant component in a random subgraph of pseudo-random graphs. Random Structures and Algorithms 24, 42-50 PDF |
| A. Flaxman, A. M. Frieze, and J. Vera: A geometric preferential attachment model of networks. Third Workshop on Algorithms and Models for the Web-Graph WAW2004 PDF |
| C. Cooper, A.M. Frieze, and J. Vera: Random deletions in a scale free random graph process. To appear in Internet Mathematics 2004 PDF |
| M.E. Dyer, Alan M. Frieze: Randomly colouring graphs with lower bounds on girth and maximum degree. Random Structures and Algorithms 23, 167-179 PDF |
| C. Cooper and Alan Frieze: On a general model of web graphs. Random Structures and Algorithms 22, John Wiley and Sons, 311-335 PDF |
| T. Bohman and Alan Frieze: Arc-Disjoint Paths in Expander Digraphs. SIAM Journal on Computing 32, 326-344 PDF |
| Alan Frieze and M.Molloy: The satisfiability threshold for randomly generated binary constraint satisfaction problems. Proceedings of RANDOM 2003 PDF |
| T. Bohman, C.Cooper, Alan Frieze, R. Martin, and M. Ruszinko: On Randomly Generated Intersecting Hypergraphs. Electronic Journal on Combinatorics, R29 PDF |
| A. Flaxman, T. Fenner, and Alan Frieze: High degree vertices and eigenvalues in the preferential attachment graph. Proceedings of RANDOM 2003 PDF |
| M.E. Dyer, Alan Frieze, and M. Molloy: A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theoretical Computer Science 290, 1815-1828 PDF |
| C. Cooper and Alan Frieze: The cover time of sparse random graphs. Proceedings of SODA 2003, 140-147 PDF |
| Alan Frieze and B. Pittel: Perfect matchings in random graphs with prescribed minimal degree. Proceedings of SODA 2003, 148-157 PDF |
| T. Bohman, Alan Frieze and R. Martin: How many random edges make a dense graph Hamiltonian?. Random Structures and Algorithms 22, 33-42 PDF |
| Sanjeev Arora, Alan Frieze, H.Kaplan: A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. Mathematical Programming 2002, A 92, 1-36 PDF |
| C.Cooper, Alan Frieze: Crawling on web graphs. STOC 2002 PDF |
| C.Cooper, Alan Frieze, G. Sorkin: A note on random 2-SAT with prescribed literal degrees. SODA 2002, 316-320 PDF |
| Alan Frieze, N.C. Wormald: Random k-SAT: A tight threshold for moderately growing k. Proceedings of the Fifth International Symposium on Theory and Applications of Satisfiability Testing, 2002, 1-6 PDF |
| C.Cooper, Alan Frieze: Multi-coloured Hamilton cycles in randomly coloured random graphs Combinatorics. Probability and Computing 2002, 11, 129--134 PDF |
| E. Drinea, Alan Frieze, M. Mitzenmacher: Balls and Bins Models with Feedback. SODA 2002, 308-315 PDF |
| Alan Frieze, J.Yukich: Probabilistic analysis of the Traveling Salesman Problem.The traveling salesman problem and its variations. G. Gutin and A.P. , Kluwer Academic Publisher, 257-308, 2002 PDF |
| C.Cooper, Alan Frieze, B.Reed: Random regular graphs of non-constant degree: connectivity and Hamilton cycles. Combinatorics, Probability and Computing 11, 249-262, 2002 PDF |
| Alan Frieze: On random symmetric travelling salesman problems. to appear in FOCS 2002 PDF |
| Alan Frieze and M.Krivelevich: Hamilton Cycles in Random Subgraphs of Pseudo-Random Graphs. Discrete Mathematics 256, 137-150 PDF |
| Alan Frieze and R.J. Gould, M. Karonski, F. Pfender: On graph irregularity strength. Journal of Graph Theory 41, 120-137 PDF |
| Alan Frieze and J.Yukich: The traveling salesman problem and its variations. G. Gutin and A.P. Punnen (Eds.), Kluwer Academic Publisher PDF |
| Andrei Z. Broder, Alan M. Frieze, Eli Upfal: A general approach to dynamic packet routing with bounded buffers. JACM 48(2): 324-349 (2001) PDF / abs |
| Tom Bohman, Alan M. Frieze: Avoiding a giant component. Random Structures and Algorithms 19(1): 75-85 (2001) PDF |
| Colin Cooper, Alan M. Frieze: A General Model of Undirected Web Graphs. ESA 2001: 500-511 PDF / abs |
| Colin Cooper, Martin E. Dyer, Alan M. Frieze: On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms 39(1): 117-134 (2001) PDF |
| T. Bohman, Alan M. Frieze: Arc-Disjoint Paths in Expander Digraphs. Proceedings of FOCS 2001, 558-567 PDF |
| Alan M. Frieze: Hamilton cycles in the union of random permutations. Random Structures and Algorithms 18, John Wiley and Sons, 83-94 PDF |
| Alan M. Frieze, Bjarni V. Halldórsson: Optimal sequencing by hybridization in rounds. RECOMB 2001: 141-148 PDF / abs |
| Alan M. Frieze, Gregory B. Sorkin: The probabilistic relationship between the assignment and asymmetric traveling salesman problems. SODA 2001: 652-660 PDF / abs |
| T.Bohman, A. Frieze, M.Ruszinko, L.Thoma: Vertex covers by edge disjoint cliques. Combinatorica 2001 21 171-197 PDF |
| T.Bohman, A. Frieze, M.Ruszinko, L.Thoma: G-intersecting families. Combinatorics, Probability and Computing 2001, 10, 367-384 PDF |
| C.Cooper, M.E.Dyer, Alan M. Frieze, R.Rue: Mixing properties of the Swendsen-Wang process on classes of graphs II. Journal of Mathematical Physics 4, 1499-1527. PDF |
| C.Cooper, Alan M. Frieze: Hamilton cycles in random graphs and directed graphs. Random Structures and Algorithms 16,John Wiley and Sons,369-401. PDF |
| Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe: Average-case complexity of shortest-paths problems in the vertex-potential model. Random Structures and Algorithms 16(1): 33-46 (2000) PDF |
| Alan M. Frieze: On the number of perfect matchings and Hamilton cycles in epsilon-regular non-bipartite graphs. Electronic Journal of Combinatorics 7, R57. PDF |
| Alan M. Frieze, M.Ruszinko, L.Thoma: A note on random minimum length spanning trees. Electronic Journal of Combinatorics 7, R41. PDF |
| Alan M. Frieze, L. Zhao: Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs. Combinatorics, Probability and Computing 9, 241-264. PDF |
| B.Bollobas, C.Cooper, T.I.Fenner, Alan M. Frieze: On Hamilton cycles in sparse random graphs with minimum degree at least k. Journal of Graph Theory 34, John Wiley and Sons, 42-59. PDF |
| T. Bohman, Alan M. Frieze, M.Ruszinko, L.Thoma: A Note on Sparse Random Graphs and Cover Graphs. Electronic Journal of Combinatorics 7, R19 PDF |
| T. Bohman, C.Cooper,and Alan M. Frieze: Min-Wise independent linear permutations. Electronic Journal of Combinatorics 7, R26 PDF |
| Alan M. Frieze: Edge-disjoint paths in expander graphs. (1). SODA 2000: 717-725 ; (2). SIAM J. Comput. 30(6): 1790-1801 (2000) PDF / abs |
CENTER
Carnegie
Mellon 
Aladdin
