Alan M. Frieze - researchr alias

researchr

You are not signed in
Sign in
Sign up

2009

2008

Prasad Chebolu, Alan M. Frieze, Páll Melsted. Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. icalp 2008: 161-172 [doi]
Prasad Chebolu, Alan M. Frieze. Hamilton Cycles in Random Lifts of Directed Graphs. siamdm, 22(2):520-540, 2008. [doi]
Alan M. Frieze, Santosh Vempala, Juan Vera. Logconcave random graphs. stoc 2008: 779-788 [doi]
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko. Game chromatic index of graphs with given restrictions on degrees. TCS, 407(1-3):242-249, 2008. [doi]
Tom Bohman, Alan M. Frieze, Benny Sudakov. The game chromatic number of random graphs. rsa, 32(2):223-235, 2008. [doi]
Colin Cooper, Alan M. Frieze. The cover time of the giant component of a random graph. rsa, 32(4):401-439, 2008. [doi]
Alan M. Frieze, Ravi Kannan. A new approach to the planted clique problem. fsttcs 2008: [doi]

2007

Abraham D. Flaxman, Alan M. Frieze, Juan Vera. Adversarial Deletion in a Scale-Free Random Graph Process. cpc, 16(2):261-270, 2007. [doi]
Tom Bohman, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó, Clifford D. Smyth. Randomly generated intersecting hypergraphs II. rsa, 30(1-2):17-34, 2007. [doi]
Colin Cooper, Alan M. Frieze, Gregory B. Sorkin. Random 2-SAT with Prescribed Literal Degrees. algorithmica, 48(3):249-265, 2007. [doi]
Alan M. Frieze, Juan Vera, Soumen Chakrabarti. The Influence of Search Engines on Preferential Attachment. im, 3(3), 2007.
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. cpc, 16(3):375-400, 2007. [doi]
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou. Separating Populations with Wide Data: A Spectral Analysis. isaac 2007: 439-451 [doi]
Abraham D. Flaxman, Alan M. Frieze, Juan Vera. A Geometric Preferential Attachment Model of Networks. im, 3(2), 2007.
Colin Cooper, Alan M. Frieze. The Cover Time of Random Digraphs. approx 2007: 422-435 [doi]
Colin Cooper, Alan M. Frieze. The cover time of sparse random graphs. rsa, 30(1-2):1-16, 2007. [doi]
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany. Line-of-sight networks. soda 2007: 968-977 [doi]
Alan M. Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth. Codes identifying sets of vertices in random networks. DM, 307(9-10):1094-1107, 2007. [doi]
Colin Cooper, Alan M. Frieze. The cover time of the preferential attachment graph. JCT, 97(2):269-290, 2007. [doi]
Abraham D. Flaxman, Alan M. Frieze. The diameter of randomly perturbed digraphs and some applications. rsa, 30(4):484-504, 2007. [doi]
Alan M. Frieze, Gregory B. Sorkin. The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. siamcomp, 36(5):1435-1452, 2007. [doi]
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. cpc, 16(5):713-732, 2007. [doi]
Alan M. Frieze, Michael Krivelevich, Clifford D. Smyth. On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. cpc, 16(5):733-746, 2007. [doi]
Abraham D. Flaxman, Alan M. Frieze, Juan Vera. A Geometric Preferential Attachment Model of Networks II. waw 2007: 41-55 [doi]

2006

Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich. On the random 2-stage minimum spanning tree. rsa, 28(1):24-36, 2006. [doi]
Alan M. Frieze, Michael Molloy. The satisfiability threshold for randomly generated binary constraint satisfaction problems. rsa, 28(3):323-339, 2006. [doi]
K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze. Hamilton cycles in random lifts of graphs. ejc, 27(8):1282-1293, 2006. [doi]
Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda. Randomly coloring sparse random graphs with fewer colors than the maximum degree. rsa, 29(4):450-465, 2006. [doi]
Alan M. Frieze, Michael Krivelevich. Almost universal graphs. rsa, 28(4):499-510, 2006. [doi]
Alan M. Frieze. Random graphs. soda 2006: 960 [doi]
Alan M. Frieze, Juan Vera. On randomly colouring locally sparse graphs. dmtcs, 8(1):121-128, 2006. [doi]

2005

Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich. On the random 2-stage minimum spanning tree. soda 2005: 919-926 [doi]
Alan M. Frieze. Perfect matchings in random bipartite graphs with minimal degree at least 2. rsa, 26(3):319-358, 2005. [doi]
Alan M. Frieze, Michael Krivelevich, Benny Sudakov. The Strong Chromatic Index of Random Graphs. siamdm, 19(3):719-727, 2005. [doi]
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 [doi]
Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner. High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. im, 2(1), 2005.
Abraham Flaxman, Alan M. Frieze, Juan Vera. Adversarial deletion in a scale free random graph process. soda 2005: 287-292 [doi]
Colin Cooper, Alan M. Frieze. The Cover Time of Random Regular Graphs. siamdm, 18(4):728-740, 2005. [doi]
Alan M. Frieze, Michael Krivelevich. On packing Hamilton cycles in ?-regular graphs. JCT, 94(1):159-172, 2005. [doi]
Soumen Chakrabarti, Alan M. Frieze, Juan Vera. The influence of search engines on preferential attachment. soda 2005: 293-300 [doi]
Alan M. Frieze, Nicholas C. Wormald. Random ::::k::::-Sat: A Tight Threshold For Moderately Growing ::::k::::. combinatorica, 25(3):297-305, 2005. [doi]
Colin Cooper, Alan M. Frieze. The cover time of two classes of random graphs. soda 2005: 961-970 [doi]

2004

Abraham Flaxman, Alan M. Frieze. The Diameter of Randomly Perturbed Digraphs and Some Applications.. approx 2004: 345-356 [doi]
Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin. Adding random edges to dense graphs. rsa, 24(2):105-117, 2004. [doi]
Abraham Flaxman, Alan M. Frieze, Juan Vera. A Geometric Preferential Attachment Model of Networks. waw 2004: 44-55 [doi]
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda. Randomly Coloring Constant Degree Graphs. focs 2004: 582-589 [doi]
Geoffrey Atkinson, Alan M. Frieze. On the b-Independence Number of Sparse Random Graphs. cpc, 13(3):295-309, 2004.
Alan M. Frieze, Ravi Kannan, Santosh Vempala. Fast monte-carlo algorithms for finding low-rank approximations. JACM, 51(6):1025-1041, 2004. [doi]
Alan M. Frieze. On Random Symmetric Travelling Salesman Problems. mor, 29(4):878-890, 2004. [doi]
Alan M. Frieze, Michael Krivelevich, Ryan Martin. The emergence of a giant component in random subgraphs of pseudo-random graphs. rsa, 24(1):42-50, 2004. [doi]
Colin Cooper, Alan M. Frieze. The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. cpc, 13(3):319-337, 2004.
Abraham Flaxman, Alan M. Frieze, Eli Upfal. Efficient communication in an ad-hoc network. jal, 52(1):1-7, 2004. [doi]
Tom Bohman, Alan M. Frieze, Nicholas C. Wormald. Avoidance of a giant component in half the edge set of a random graph. rsa, 25(4):432-449, 2004. [doi]
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda. Randomly coloring constant degree graphs. eccc, (009), 2004. [doi]
Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay. Clustering Large Graphs via the Singular Value Decomposition. ml, 56(1-3):9-33, 2004. [doi]

2003

Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner. High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. random 2003: 264-274 [doi]
Martin E. Dyer, Alan M. Frieze. Randomly coloring graphs with lower bounds on girth and maximum degree. rsa, 23(2):167-179, 2003. [doi]
Alan M. Frieze, Michael Molloy. The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. random 2003: 275-289 [doi]
Martin E. Dyer, Alan M. Frieze, Michael Molloy. A probabilistic analysis of randomly generated binary constraint satisfaction problems. TCS, 290(3):1815-1828, 2003.
Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó. On Randomly Generated Intersecting Hypergraphs. combinatorics, 10, 2003. [doi]
Tom Bohman, Alan M. Frieze. Arc-Disjoint Paths in Expander Digraphs. siamcomp, 32(2):326-344, 2003. [doi]
Colin Cooper, Alan M. Frieze, Juan Vera. Random Deletion in a Scale-Free Random Graph Process. im, 1(4), 2003.
Colin Cooper, Alan M. Frieze. The cover time of sparse random graphs. soda 2003: 140-147 [doi]
Tom Bohman, Alan M. Frieze, Ryan Martin. How many random edges make a dense graph hamiltonian?. rsa, 22(1):33-42, 2003. [doi]
Alan M. Frieze, Boris Pittel. Perfect matchings in random graphs with prescribed minimal degree. soda 2003: 148-157 [doi]
Colin Cooper, Alan M. Frieze. Crawling on Simple Models of Web Graphs. im, 1(1), 2003.
Colin Cooper, Alan M. Frieze. A general model of web graphs. rsa, 22(3):311-335, 2003. [doi]

2002

Colin Cooper, Alan M. Frieze. Crawling on web graphs. stoc 2002: 419-427 [doi]
Alan M. Frieze. On Random Symmetric Travelling Salesman Problems. focs 2002: 789-798 [doi]
Colin Cooper, Alan M. Frieze, Gregory B. Sorkin. A note on random 2-SAT with prescribed literal degrees. soda 2002: 316-320 [doi]
Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan. Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. cpc, 11(4), 2002.
Colin Cooper, Alan M. Frieze. Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. cpc, 11(2), 2002.
Alan M. Frieze, Michael Krivelevich. Hamilton cycles in random subgraphs of pseudo-random graphs. DM, 256(1-2):137-150, 2002. [doi]
Tom Bohman, Alan M. Frieze. Addendum to avoiding a giant component. rsa, 20(1):126-130, 2002.
Alan M. Frieze, Bjarni V. Halldórsson. Optimal Sequencing by Hybridization in Rounds. jcb, 9(2):355-369, 2002.
Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher. Balls and bins models with feedback. soda 2002: 308-315 [doi]
Colin Cooper, Alan M. Frieze, Bruce A. Reed. Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. cpc, 11(3), 2002.
Martin E. Dyer, Alan M. Frieze, Mark Jerrum. On Counting Independent Sets in Sparse Graphs. siamcomp, 31(5):1527-1541, 2002. [doi]

2001

Alan M. Frieze, Bjarni V. Halldórsson. Optimal sequencing by hybridization in rounds. recomb 2001: 141-148 [doi]
Martin E. Dyer, Alan M. Frieze. Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. focs 2001: 579-587
Alan M. Frieze, Gregory B. Sorkin. The probabilistic relationship between the assignment and asymmetric traveling salesman problems. soda 2001: 652-660 [doi]
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma. G-Intersecting Families. cpc, 10(5), 2001.
Colin Cooper, Martin E. Dyer, Alan M. Frieze. On Markov Chains for Randomly H-Coloring a Graph. jal, 39(1):117-134, 2001.
Tom Bohman, Alan M. Frieze. Arc-Disjoint Paths in Expander Digraphs. focs 2001: 558-567
Colin Cooper, Alan M. Frieze. A General Model of Undirected Web Graphs. esa 2001: 500-511 [doi]
Alan M. Frieze. Hamilton cycles in the union of random permutations. rsa, 18(1):83-94, 2001.
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma. Vertex Covers by Edge Disjoint Cliques. combinatorica, 21(2):171-197, 2001. [doi]
Tom Bohman, Alan M. Frieze. Avoiding a giant component. rsa, 19(1):75-85, 2001.
Andrei Z. Broder, Alan M. Frieze, Eli Upfal. A general approach to dynamic packet routing with bounded buffers. JACM, 48(2):324-349, 2001. [doi]

PreviousNext