Alan M. Frieze

Q: What Schools Are Affiliated With Alan M. Frieze

Alan M. Frieze is affiliated with the following schools: University of Oxford, University College London, Carnegie Mellon University

Alan M. Frieze's AcademicInfluence.com Rankings

Alan M. Frieze

Mathematics

#1999

World Rank

#3157

Historical Rank

Measure Theory

#234

World Rank

#366

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Alan M. Frieze Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Alan M. Frieze is a professor in the Department of Mathematical Sciences at Carnegie Mellon University, Pittsburgh, United States. He graduated from the University of Oxford in 1966, and obtained his PhD from the University of London in 1975. His research interests lie in combinatorics, discrete optimisation and theoretical computer science. Currently, he focuses on the probabilistic aspects of these areas; in particular, the study of the asymptotic properties of random graphs, the average case analysis of algorithms, and randomised algorithms. His recent work has included approximate counting and volume computation via random walks; finding edge disjoint paths in expander graphs, and exploring anti-Ramsey theory and the stability of routing algorithms.

(See a Problem?)

Alan M. Frieze's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Random graphs (2006) (11091)
Min-Wise Independent Permutations (2000) (895)
A random polynomial-time algorithm for approximating the volume of convex bodies (1989) (790)
Fast Monte-Carlo algorithms for finding low-rank approximations (1998) (759)
Clustering Large Graphs via the Singular Value Decomposition (2004) (515)
Introduction to Random Graphs (2016) (497)
Quick Approximation to Matrices and Applications (1999) (475)
A general model of web graphs (2003) (386)
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION (1995) (369)
On the Complexity of Computing the Volume of a Polyhedron (1988) (340)
Min-wise independent permutations (extended abstract) (1998) (333)
The shortest-path problem for graphs with random arc-lengths (1985) (267)
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem (1982) (261)
Analysis of Two Simple Heuristics on a Random Instance of k-SAT (1996) (241)
Clustering in large graphs and matrices (1999) (223)
On the value of a random minimum spanning tree problem (1985) (216)
A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions (1996) (213)
The Solution of Some Random NP-Hard Problems in Polynomial Expected Time (1989) (210)
The regularity lemma and approximation schemes for dense problems (1996) (194)
A simple heuristic for the p-centre problem (1985) (181)
On counting independent sets in sparse graphs (1999) (178)
Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses (1984) (178)
On the satisfiability and maximum satisfiability of random 3-CNF formulas (1993) (164)
On the independence number of random graphs (1990) (159)
Improved approximation algorithms for MAXk-CUT and MAX BISECTION (1997) (158)
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (1996) (155)
Algorithmic theory of random graphs (1997) (150)
On the complexity of partitioning graphs into connected subgraphs (1985) (143)
The Cover Times of Random Walks on Hypergraphs (2011) (141)
Planar 3DM is NP-Complete (1986) (135)
On graph irregularity strength (2002) (132)
On key storage in secure networks (1995) (126)
An algorithm for finding hamilton paths and cycles in random graphs (1987) (123)
Maximum matchings in sparse random graphs: Karp-Sipser revisited (1998) (122)
A Geometric Preferential Attachment Model of Networks (2006) (122)
Multiple Random Walks in Random Regular Graphs (2009) (122)
Complexity of a 3-dimensional assignment problem (1983) (120)
Reconstructing Truncated Integer Variables Satisfying Linear Congruences (1988) (119)
Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics (1999) (113)
Avoiding a giant component (2001) (108)
An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice (1981) (103)
Randomly coloring sparse random graphs with fewer colors than the maximum degree (2006) (101)
On the quadratic assignment problem (1983) (100)
ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS (1988) (95)
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence (2004) (93)
Random Deletion in a Scale-Free Random Graph Process (2004) (90)
Multicoloured Hamilton Cycles (1995) (89)
The cover time of sparse random graphs (2003) (88)
The Cover Time of Random Regular Graphs (2005) (86)
How many random edges make a dense graph hamiltonian? (2003) (85)
Sampling from log-concave distributions (1994) (84)
Random Structures and Algorithms (2014) (84)
Randomly coloring constant degree graphs (2004) (83)
Assessing significance in a Markov chain without mixing (2016) (82)
On the independence and chromatic numbers of random regular graphs (1992) (79)
Optimal construction of edge-disjoint paths in random graphs (1994) (78)
A survey on the use of Markov chains to randomly sample colorings (2006) (77)
Variations on cops and robbers (2010) (76)
On two Hamilton cycle problems in random graphs (2008) (74)
Learning linear transformations (1996) (74)
On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem (1986) (74)
Randomized Greedy Matching (1991) (69)
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (1994) (67)
Perfect Matchings in Random r-regular, s-uniform Hypergraphs (1996) (67)
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables (2009) (67)
Existence and Construction of Edge-Disjoint Paths on Expander Graphs (1994) (65)
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph (2005) (65)
Probabilistic Analysis of a Relaxation for the k-Median Problem (1986) (64)
A General Model of Undirected Web Graphs (2001) (64)
The cover time of the preferential attachment graph (2007) (62)
Coloring Bipartite Hypergraphs (1996) (62)
Generating and Counting Hamilton Cycles in Random Regular Graphs (1996) (60)
On packing Hamilton cycles in ?-regular graphs (2005) (60)
Polychromatic Hamilton cycles (1993) (60)
Random k-Sat: A Tight Threshold For Moderately Growing k (2005) (59)
Mixing properties of the Swendsen-Wang process on classes of graphs (1999) (59)
On linear programs with random costs (1986) (58)
The Probability of Unique Solutions of Sequencing by Hybridization (1994) (57)
Avoidance of a giant component in half the edge set of a random graph (2004) (56)
A Simple Algorithm for Constructing Szemere'di's Regularity Partition (1999) (56)
An Analysis of Random-Walk Cuckoo Hashing (2009) (56)
Random Minimum Length Spanning Trees in Regular Graphs (1998) (56)
Randomly coloring graphs with lower bounds on girth and maximum degree (2003) (55)
Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case (1995) (55)
On the existence of Hamiltonian cycles in a class of random graphs (1983) (55)
An Algorithm for Finding Hamilton Cycles in Random Directed Graphs (1988) (55)
Existence and construction of edge disjoint paths on expander graphs (1992) (54)
A randomized algorithm for fixed-dimensional linear programming (1989) (53)
On the connectivity of randomm-orientable graphs and digraphs (1982) (52)
A bilinear programming formulation of the 3-dimensional assignment problem (1974) (51)
On Balls and Bins with Deletions (1998) (51)
Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity (2002) (51)
Balls and bins models with feedback (2002) (51)
Randomized Greedy Matching II (1995) (51)
Maximum matchings in a class of random graphs (1986) (50)
On the Length of the Longest Monotone Subsequence in a Random Permutation (1991) (50)
Finding hamilton cycles in sparse random graphs (1987) (50)
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (1993) (50)
A Geometric Preferential Attachment Model of Networks II (2007) (49)
Codes identifying sets of vertices in random networks (2007) (49)
A new approach to the planted clique problem (2008) (49)
Loose Hamilton Cycles in Random 3-Uniform Hypergraphs (2010) (49)
Log-Sobolev inequalities and sampling from log-concave distributions (1999) (49)
Adding random edges to dense graphs (2004) (49)
Random triangle removal (2012) (48)
The cover time of the giant component of a random graph (2008) (48)
Edge-disjoint paths in expander graphs (2000) (47)
On random minimum length spanning trees (1989) (47)
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (1999) (47)
On random symmetric travelling salesman problems (2002) (46)
On large matchings and cycles in sparse random graphs (1986) (45)
An algorithm for finding Hamilton cycles in random graphs (1985) (45)
Tight Hamilton cycles in random uniform hypergraphs (2011) (45)
An efficient sparse regularity concept (2009) (43)
On the connectivity of random m-orientable graphs and digraphs (1982) (43)
Perfect matchings in random graphs with prescribed minimal degree (2003) (42)
Hamiltonian cycles in random regular graphs (1984) (42)
Optimal Reconstruction of a Sequence from its Probes (1999) (41)
The influence of search engines on preferential attachment (2005) (41)
Hamilton cycles in 3‐out (2009) (41)
A cost function property for plant location problems (1974) (41)
Line-of-sight networks (2007) (39)
Finding hidden Hamiltonian cycles (1991) (39)
A general approach to dynamic packet routing with bounded buffers (1996) (39)
Randomly colouring graphs with lower bounds on girth and maximum degree (2001) (39)
The probabilistic relationship between the assignment and asymmetric traveling salesman problems (2001) (38)
Random graph orders (1989) (38)
On the chromatic number of a random hypergraph (2012) (38)
Adversarial deletion in a scale free random graph process (2005) (38)
On matchings and hamiltonian cycles in random graphs Annals of Discrete Mathematics 28 (1985) (38)
The average performance of the greedy matching algorithm (1993) (36)
Coloring simple hypergraphs (2008) (36)
Probabilistic Analysis of the Multidimensional Knapsack Problem (1989) (36)
The emergence of a giant component in random subgraphs of pseudo‐random graphs (2004) (35)
Rainbow hamilton cycles in random graphs (2010) (34)
On the power of universal bases in sequencing by hybridization (1999) (34)
Some Typical Properties of the Spatial Preferred Attachment Model (2012) (34)
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal (1996) (34)
Approximately Counting Hamilton Paths and Cycles in Dense Graphs (1998) (34)
Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids (2000) (34)
Fast solution of some random NP-hard problems (1986) (33)
Crawling on Simple Models of Web Graphs (2004) (33)
Differential Equations Method (2016) (32)
Rainbow matchings and Hamilton cycles in random graphs (2013) (32)
On the Independence Number of Random Cubic Graphs (1994) (32)
Multiple Random Walks and Interacting Particle Systems (2009) (31)
Splitting an Expander Graph (1999) (31)
Rainbow Connection of Random Regular Graphs (2013) (31)
Hamilton cycles in random graphs and directed graphs (2000) (31)
An extension of Christofides heuristic to the k-person travelling salesman problem (1983) (31)
Linear Congruential Generators Do Not Produce Random Sequences (1984) (31)
Analysis of heuristics for finding a maximum weight planar subgraph (1985) (31)
Crawling on web graphs (2002) (30)
Min-Wise Independent Linear Permutations (2000) (30)
On the random 2‐stage minimum spanning tree (2005) (30)
Hamilton Cycles in Random Regular Digraphs (1994) (30)
Packing hamilton cycles in random and pseudo‐random hypergraphs (2010) (30)
Stationary distribution and cover time of random walks on random digraphs (2011) (30)
The diameter of randomly perturbed digraphs and some applications (2007) (29)
The satisfiability threshold for randomly generated binary constraint satisfaction problems (2006) (29)
Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs (2012) (29)
Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs (2002) (28)
Packing tight Hamilton cycles in 3‐uniform hypergraphs (2010) (27)
Karp–Sipser on Random Graphs with a Fixed Degree Sequence (2011) (27)
Approximately counting Hamilton cycles in dense graphs (1994) (27)
On Rainbow Trees and Cycles (2008) (27)
An efficient algorithm for the vertex-disjoint paths problem in random graphs (1996) (26)
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity (2015) (26)
Cover time of a random graph with given degree sequence (2012) (26)
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number (2002) (26)
Limit Distribution for the Existence of Hamiltonian Cycles in Random Bipartite Graphs (1985) (26)
On Markov Chains for Randomly H-Coloring a Graph (2001) (25)
The game chromatic number of random graphs (2007) (25)
On randomly colouring locally sparse graphs (2006) (24)
Analyzing Walksat on Random Formulas (2011) (24)
Hamilton Cycles in a Class of Random Directed Graphs (1994) (24)
Parallel Algorithms for Finding Hamilton Cycles in Random Graphs (1987) (24)
Covering the edges of a random graph by cliques (1995) (24)
Bottleneck Linear Programming (1975) (23)
A probabilistic analysis of the next fit decreasing bin packing heuristic (1986) (23)
Rainbow Hamilton Cycles in Uniform Hypergraphs (2012) (23)
Average-case complexity of shortest-paths problems in the vertex-potential model (1997) (23)
Rainbow Connectivity of Sparse Random Graphs (2012) (23)
On patching algorithms for random asymmetric travelling salesman problems (1990) (23)
Probabilistic analysis of the generalised assignment problem (1990) (23)
Finding a maximum matching in a sparse random graph in O(n) expected time (2008) (23)
Hamilton cycles in random subgraphs of pseudo-random graphs (2002) (23)
Hamilton Cycles in Random Graphs: a bibliography (2019) (23)
Separator based parallel divide and conquer in computational geometry (1992) (22)
Algorithms for assignment problems on an array processor (1989) (22)
Analysis of a simple greedy matching algorithm on random cubic graphs (1995) (22)
On the Length of a Random Minimum Spanning Tree (2012) (22)
Optimal construction of edge-disjoint paths in random regular graphs (2000) (22)
Shortest path algorithms for knapsack type problems (1976) (22)
Ramsey games with giants (2009) (22)
On Certain Properties of Random Apollonian Networks (2012) (22)
A probabilistic analysis of randomly generated binary constraint satisfaction problems (2003) (21)
Broadcasting in Random Graphs (1994) (21)
Coloring H‐free hypergraphs (2009) (21)
A Note on Random Minimum Length Spanning Trees (2000) (21)
On the Number of Perfect Matchings and Hamilton Cycles in e-Regular Non-bipartite Graphs (2000) (21)
Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets (1990) (21)
Optimal sequencing by hybridization in rounds (2001) (20)
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height (1995) (20)
Probabilistic Analysis of an Algorithm in the Theory of Markets in Indivisible Goods (1995) (20)
On the number of hamilton cycles in a random graph (1989) (20)
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey (1998) (20)
Counting the Number of Hamilton Cycles in Random Digraphs (1992) (20)
Perfect Matchings in Random s-Uniform Hypergraphs (1995) (20)
The cover time of random geometric graphs (2009) (19)
Approximate counting of regular hypergraphs (2013) (19)
Random 2-SAT with Prescribed Literal Degrees (2007) (19)
Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs (1994) (19)
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? (1995) (19)
On smoothed k-CNF formulas and the Walksat algorithm (2009) (19)
Perfect matchings in random bipartite graphs with minimal degree at least 2 (2005) (18)
A note on the random greedy triangle-packing algorithm (2010) (18)
The cover times of random walks on random uniform hypergraphs (2013) (18)
Component structure of the vacant set induced by a random walk on a random graph (2010) (17)
Near-perfect Token Distribution (1992) (17)
Minimum Paths in Directed Graphs (1977) (16)
Rainbow Connection of Sparse Random Graphs (2012) (16)
Cops and Robbers on Geometric Graphs (2011) (16)
2 Proof of Theorem 1 (1997) (15)
On the Non-Planarity of a Random Subgraph (2012) (15)
Large holes in sparse random graphs (1987) (15)
Large induced trees in sparse random graphs (1987) (15)
A note on random 2-SAT with prescribed literal degrees (2002) (15)
Adding random edges to create the square of a Hamilton cycle (2017) (15)
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k (2000) (15)
A Partitioning Algorithm for Minimum Weighted Euclidean Matching (1984) (15)
Product rule wins a competitive game (2007) (15)
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three (2012) (14)
A new integer programming formulation for the permutation flowshop problem (1989) (14)
On a greedy 2‐matching algorithm and Hamilton cycles in random graphs with minimum degree at least three (2011) (14)
Multicolored Trees in Random Graphs (1994) (14)
Perfect matchings and Hamiltonian cycles in the preferential attachment model (2016) (14)
Walker-Breaker Games (2014) (14)
Some Properties of Random Apollonian Networks (2014) (14)
Hamilton cycles in random lifts of graphs (2006) (14)
Discordant voting processes on finite graphs (2016) (14)
On the Chromatic Number of Simple Triangle-Free Triple Systems (2008) (14)
On random k‐out subgraphs of large graphs (2014) (14)
Probabilistic Analysis of the TSP (2007) (14)
Impartial Redistricting: A Markov Chain Approach (2015) (13)
On the Connectivity of Random k-th Nearest Neighbour Graphs (1995) (13)
On the rank of a random binary matrix (2018) (13)
Anti-Ramsey properties of random graphs (2010) (13)
The Game of JumbleG (2005) (13)
Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs (2015) (13)
On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients (1987) (12)
On the insertion time of random walk cuckoo hashing (2016) (12)
A note on the localization number of random graphs: Diameter two case (2017) (12)
The Strong Chromatic Index of Random Graphs (2005) (12)
Efficient algorithms for three‐dimensional axial and planar random assignment problems (2010) (12)
Looking for vertex number one (2014) (12)
A scaling limit for the length of the longest cycle in a sparse random digraph (2019) (12)
On the Strength of Connectivity of Random Subgraphs of the n-Cube (1987) (12)
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (2005) (12)
On the Problem of Approximating the Number of Bases of a Matroid (1994) (12)
Elegantly Colored Paths and Cycles in Edge Colored Random Graphs (2014) (11)
Separating Effect From Significance in Markov Chain Tests (2019) (11)
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (2009) (11)
Edge disjoint spanning trees in random graphs (1990) (11)
The height of random k‐trees and related branching processes (2013) (11)
Game chromatic index of graphs with given restrictions on degrees (2008) (11)
Spectral Techniques, Semidefinite Programs, and Random Graphs (2005) (11)
Randomly coloring simple hypergraphs (2011) (11)
On small subgraphs of random graphs (1989) (11)
Probabilistic Analysis of Graph Algorithms (1990) (11)
On the random 2-stage minimum spanning tree (2006) (10)
Linear and combinatorial optimization in ordered algebraic structures: U. ZIMMERMANN Volume 10 in: Annals of Discrete Mathematics, North-Holland, Amsterdam, 1981, ix + 380 pages, Dfl. 125.00 (1982) (10)
Edge-colouring random graphs (1988) (10)
On the Game Chromatic Number of Sparse Random Graphs (2011) (10)
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach (1997) (10)
Average-Case Analysis of the Merging Algorithm of Hwang and Lin (1998) (10)
On an optimization problem with nested constraints (1990) (10)
Hamilton cycles in 3-out (2009) (10)
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence (2007) (10)
Random volumes in d-dimensional polytopes (2020) (9)
Random Walks on Random Graphs (2008) (9)
On the $b$-Independence Number of Sparse Random Graphs (2004) (9)
On the Random Construction of Heaps (1988) (9)
On Subgraph Sizes in Random Graphs (1992) (9)
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk (2014) (9)
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? (2018) (9)
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold (1995) (9)
On the complexity of computing the diameter of a polytope (1994) (8)
Greedy Matching on the Line (1990) (8)
Traveling in randomly embedded random graphs (2014) (8)
First-Order Definability of Trees and Sparse Random Graphs (2005) (8)
Balanced Allocations for Tree-Like Inputs (1995) (8)
The t-Tone Chromatic Number of Random Graphs (2012) (8)
Hypergraphs with independent neighborhoods (2010) (8)
Randomly generated intersecting hypergraphs II (2016) (8)
Pattern Colored Hamilton Cycles in Random Graphs (2017) (8)
Identifying codes in random networks (2005) (8)
Partitioning heuristics for two geometric maximization problems (1984) (8)
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees (1999) (7)
On a sparse random graph with minimum degree three: Likely Pósa sets are large (2011) (7)
Loose Hamilton Cycles in Regular Hypergraphs (2013) (7)
Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k (2008) (7)
Packing Hamilton Cycles Online (2016) (7)
Square of a Hamilton cycle in a random graph (2016) (7)
Hamilton cycles in the union of random permutations (2001) (7)
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis (2019) (7)
G-Intersecting Families (2001) (7)
Randomly coloring simple hypergraphs with fewer colors (2017) (7)
Randomly coloring random graphs (2010) (7)
Spanning Maximal Planar Subgraphs of Random Graphs (1991) (7)
Localization game for random graphs (2019) (6)
ON RANDOM REGULAR GRAPHS WITH NON-CONSTANT DEGREE (2005) (6)
Probabilistic analysis of some euclidean clustering problems (1980) (6)
Almost universal graphs (2006) (6)
Efficient communication in an ad-hoc network (2004) (6)
A Tribute to Paul Erdős: Hamilton cycles in random graphs of minimal degree at least k (1990) (6)
Packing Tree Factors in Random and Pseudo-random Graphs (2013) (6)
Hamilton Cycles in Random Lifts of Directed Graphs (2008) (6)
An algorithm for algebraic assignment problems (1979) (6)
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence (2010) (6)
Logconcave random graphs (2008) (6)
Random Vertex Deletion in a Scale Free Random Graph (2004) (6)
Probabilistic Analysis of Algorithms (1998) (6)
Separating Populations with Wide Data: A Spectral Analysis (2007) (6)
20th Annual ACM-SIAM Symposium on Discrete Algorithms (2009) (6)
On Rainbow Hamilton Cycles in Random Hypergraphs (2017) (6)
The cover time of a biased random walk on a random cubic graph (2018) (5)
Average-Case Analyses of Vickrey Costs (2009) (5)
A randomly weighted minimum arborescence with a random cost constraint (2019) (5)
On the trace of random walks on random graphs (2015) (5)
Maker‐breaker games on random geometric graphs (2013) (5)
On Randomly Generated Intersecting Hypergraphs (2003) (5)
Memoryless Rules for Achlioptas Processes (2009) (5)
Power of k Choices and Rainbow Spanning Trees in Random Graphs (2014) (5)
Coloring H-free hypergraphs (2010) (5)
Long Paths in Random Apollonian Networks (2014) (5)
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two (2014) (5)
The cover time of two classes of random graphs (2005) (4)
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph (1992) (4)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France (2016) (4)
Rainbow Arborescence in Random Digraphs (2014) (4)
Minimum Cost Matching in a Random Graph with Random Costs (2015) (4)
Addendum to ‘avoiding a giant component’ (2002) (4)
Arc-disjoint paths in expander digraphs (2001) (4)
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph (2015) (4)
The limiting probability that alpha-in, ß-out is strongly connected (1990) (4)
Between 2- and 3-Colorability (2014) (4)
Separating subadditive euclidean functionals (2015) (4)
Degree Distribution for Duplication-Divergence Graphs: Large Deviations (2020) (4)
Online purchasing under uncertainty (2016) (4)
The Effect of Adding Randomly Weighted Edges (2020) (4)
On the Best Case of Heapsort (1996) (4)
Rainbow Connectivity of $G(n,p)$ at the connectivity threshold (2012) (4)
Dynamic Packet Routing on Arrays with Bounded Buffers (1998) (4)
Practical tests for significance in Markov Chains (2019) (4)
Finding perfect matchings in random cubic graphs in linear time (2018) (4)
Algebraic Linear Programming (1982) (4)
Assignment Problems with Application (1981) (3)
A note on the vacant set of random walks on the hypercube and other regular graphs of high degree (2014) (3)
Partitioning random graphs into large cycles (1988) (3)
Random regular graphs of non-onstant degree (2000) (3)
A randomly weighted minimum spanning tree with a random cost constraint (2019) (3)
A Greedy Algorithm for the Shortest Common Superstring is Asymptotically Optimal (1995) (3)
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks (2011) (3)
Probabilistic analysis of the Traveling Salesman Problem to appear as a chapter in a forthcoming book on the TSP (2002) (3)
Understanding Our Markov Chain Significance Test: A Reply to Cho and Rubinstein-Salzedo (2019) (3)
An efficient regularity concept for sparse graphs and matrices (2009) (3)
An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (1985) (3)
Minimum-Weight Combinatorial Structures Under Random Cost-Constraints (2019) (3)
Constraining the Clustering Transition for Colorings of Sparse Random Graphs (2017) (3)
On-line List Colouring of Random Graphs (2015) (3)
Shortest paths with a cost constraint: A probabilistic analysis (2020) (3)
A note on dispersing particles on a line (2017) (3)
A note on spanning Kr-cycles in random graphs (2019) (3)
Algorithmic techniques for modeling and mining large graphs (AMAzING) (2013) (3)
Rainbow Thresholds (2021) (3)
Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph (1991) (2)
Note on Sparse Random Graphs and Cover Graphs (2000) (2)
A note on randomly colored matchings in random graphs (2019) (2)
Occupancy problems and random algebras (1991) (2)
Corrigendum: Edge-Disjoint Paths in Expander Graphs (2002) (2)
Vertex Covers by Edge Disjoint Cliques (2001) (2)
Random Walks with Look-Ahead in Scale-Free Random Graphs (2010) (2)
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects (2020) (2)
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). (1997) (2)
Notes on growing a tree in a graph (2017) (2)
Ordering Clone Libraries in Computational Biology (1995) (2)
Analysis of a randomized greedy matching algorithm (1995) (2)
The cover time of a biased random walk on Gn, p (2017) (2)
The Game Chromatic Number of a Random Hypergraph (2019) (2)
On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph (2020) (2)
Subexponential mixing for partition chains on grid-like graphs (2022) (2)
Automata, Languages and Programming, 36th International Colloquium , ICALP 2009 (2009) (2)
Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401–439 (2009) (2)
Hamiltonicity of Random Graphs in the Stochastic Block Model (2019) (2)
On the expected efficiency of branch and bound for the asymmetric TSP (2020) (2)
Isomorphism for random k-uniform hypergraphs (2020) (2)
The covertime of a biased random walk on $G_{n,p}$ (2017) (2)
A Note on Randomly Colored Matchings in Random Bipartite Graphs (2019) (2)
Random greedy triangle-packing beyond the 7/4 barrier (2011) (2)
The Cover Time of Random Digraphs (2007) (2)
SPANNING TREE PROBLEM (1985) (2)
Minors of a random binary matroid (2016) (2)
On the connectivity of proper colorings of random graphs and hypergraphs (2020) (2)
The Topology of Competitively Constructed Graphs (2013) (2)
Introduction to Random Graphs: Random Graphs (2015) (2)
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph (1996) (2)
Fast construction on a restricted budget (2022) (2)
The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights (2016) (2)
On random minimum lenght spanning trees (1989) (2)
On random multi-dimensional assignment problems (2019) (2)
Maker Breaker on digraphs (2020) (2)
Hamilton cycles in a semi-random graph model (2022) (2)
Real world networks (2016) (1)
The Johansson-Kahn-Vu solution of the Shamir problem (2013) (1)
On the Cover Time of the Emerging Giant (2018) (1)
Regular hypergraphs: asymptotic counting and loose Hamilton cycles (2013) (1)
On the distribution of the minimum weight clique (2016) (1)
Diffusion limited aggregation on the Boolean lattice (2017) (1)
Avoiding a Giant Component II (2002) (1)
Balanced allocation through random walk (2017) (1)
Approximate counting of regular hypergraphs via switchings (2013) (1)
The t-Tone Chromatic Number of Random Graphs (2013) (1)
On the greedy heuristic for matchings (1994) (1)
Flips in Graphs (2009) (1)
Giant descendant trees and matching sets in the preferential attachment graph (2019) (1)
A Random Variant of the Game of Plates and Olives (2018) (1)
Rainbow Hamilton Cycles in Random Geometric Graphs (2020) (1)
Learning from a Sample in Online Algorithms (2022) (1)
Finding Hidden Hamiltonian Cycles (Extended Abstract) (1991) (1)
Algorithms and Models for the Web Graph (2012) (1)
A P ] 3 O ct 2 01 7 An analysis of the Act 43 Wisconsin Assembly district map using the √ ε test (2018) (1)
Average case performance of heuristics for multi-dimensional assignment problems (2010) (1)
Algorithms and models for the web graph : 8th International Workshop, WAW 2011, Atlanta, GA, USA, May 27-29, 2011 : proceedings (2011) (1)
Corrigendum to “Online purchasing under uncertainty” (2021) (1)
A Partitioned Inverse in Linear Programming (1978) (1)
Rainbow powers of a Hamilton cycle in G(n,p) (2022) (1)
Karp's patching algorithm on dense digraphs (2020) (1)
Finding maximum matchings in random regular graphs in linear expected time (2020) (1)
A Sub-exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (1993) (1)
Average-case analysis for combinatorial problems (2006) (1)
Spanners in randomly weighted graphs: independent edge lengths (2021) (1)
Random Graphs with a Fixed Maximum Degree (2019) (1)
A greedy algorithm for finding a large 2‐matching on a random cubic graph (2012) (1)
Colorful Hamilton Cycles in Random Graphs (2021) (1)
Correction: Sampling from Log-Concave Distributions (1994) (1)
Spanners in randomly weighted graphs: Euclidean case (2021) (0)
Brief Notes on Uncovered Topics (2016) (0)
D S ] 2 2 A ug 2 01 7 Balanced Allocation Through Random Walk (2018) (0)
Random Graphs and Networks: A First Course (2023) (0)
Sterilization container for filtered gas plasma with improved circulation (1998) (0)
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs (2021) (0)
C O ] 1 0 O ct 2 01 8 On the cover time of dense graphs (2018) (0)
Introduction (1994) (0)
Instrument holder device having elastic locking element for use in connection with sterilization trays (1997) (0)
8 Concluding Remarks and Further Work (2007) (0)
The Concentration of the Maximum Degree in the Duplication-Divergence Models (2021) (0)
A note on the rank of a sparse random matrix (2019) (0)
Shortest Paths, Minimum Weight Perfect Matchings and Travelling Salesperson Tours with Random weights Plus a Random Cost Constraint (2019) (0)
ON GROWING A TREE IN A GRAPH À (2017) (0)
Information Processing Letters running time of the random simplex algorithm is exponential in the height (1995) (0)
Probabilisti analysis of the Traveling SalesmanProblemto appear as a hapter in a forth oming book on theTSP (0)
Rainbow spanning trees in randomly coloured Gk-out (2022) (0)
Corrigendum to Probability of Unique Solutions of Sequencing by Hybridization (1996) (0)
On the cover time of dense graphs (2018) (0)
C O ] 2 8 M ay 2 01 9 On the cover time of dense graphs (2019) (0)
An analysis of the Act 43 Wisconsin Assembly district map using the $\sqrt{\varepsilon}$ test (2017) (0)
Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010) (2013) (0)
Corrigendum: Algebraic Linear Programming (1983) (0)
Minimum-cost matching in a random bipartite graph with random costs (2015) (0)
Randomly colouring simple hypergraphs (2009) (0)
Vertex overs by edge disjoint liques (2000) (0)
Proceedings of the 8th international conference on Algorithms and models for the web graph (2011) (0)
Perfe t mat hings in random graphs with pres ribedminimal degree (2002) (0)
C O ] 1 9 M ay 2 01 6 Looking for vertex number one (2018) (0)
ON PERFECT MATCHINGS IN RANDOM BIPARTITE GRAPHS WITH MINIMUM DEGREE AT LEAST TWO (2005) (0)
Fairness in Scheduling On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. In (1995) (0)
The probabilistic relationship between the assignment and travelling salesman problems (2006) (0)
Special Issue on Algorithms and Models for the Web Graph (2013) (0)
Optimal sequen ing by hybridization in rounds (2000) (0)
ON THE INDEPENDENCE NUMBER OF RANDOM REGULAR GRAPHS (1988) (0)
Average-case performance of heuristics for three-dimensional random assignment problems (2010) (0)
Finding perfect matchings in random cubic graphs in linear expected time (2018) (0)
Algorithms---ESA 2001 Aarhus (2001) (0)
The topology of competetively constructed graphs (2013) (0)
Scalefree hardness of average-case Euclidean TSP approximation (2016) (0)
Distance Problems with Dependent Uncertainties (1998) (0)
On the intersecting family process (2023) (0)
Sequentially constrained Hamilton Cycles in random graphs (2023) (0)
2 Hamilton Cycles and Related Problems 2 . 1 Existence (2006) (0)
Analytic Graph Theory (2003) (0)
A Note on Log-Concave Random Graphs (2018) (0)
9-30-2014 Between 2-and 3-colorability (2015) (0)
2 Tools 2 . 1 Gaussian Free Field Definition (2022) (0)
Greedy Algorithms For The S hortest Common Superstring Th at Are Asymptotically Optimal (1996) (0)
Average-case performance of heuristics for three-dimensional assignment problems (2010) (0)
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs (2019) (0)
Algorithms on random graphs (2009) (0)
Randomly colouring random graphs (2008) (0)
ON THE INDEPENDENCE NUMBER OFRANDOM CUBIC GRAPHS (1994) (0)
Minimum-cost matching in a regular bipartite graph with random costs (2015) (0)
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241) (2011) (0)
Combinatorics, Geometry and Probability: Hamilton Cycles in Random Regular Digraphs (1997) (0)
The cover time of regular random graphs (2007) (0)
Multitrees in Random Graphs (2021) (0)
Fixed Degree Sequence (2016) (0)
26 11241 – Design and Analysis of Randomized and Approximation Algorithms 2 Table of Contents Executive Summary (2011) (0)
On the connectivity threshold for colorings of random graphs and hypergraphs (2018) (0)
Survival time of a random graph (1989) (0)
Sterilizing with filtered gas plasma and improved circulation (2001) (0)
Karp's patching algorithm on random perturbations of dense digraphs (2022) (0)
Towards graphs compression : The degree 1 distribution of duplication-divergence graphs (2019) (0)
On the chromatic number of random regular hypergraphs (2022) (0)
Perfe t mat hings in random bipartite graphs with minimaldegree at least 2 (2002) (0)
Corrigendum: Minimum Paths in Directed Graphs (1978) (0)

This paper list is powered by the following services:

Other Resources About Alan M. Frieze

en.wikipedia.org

What Schools Are Affiliated With Alan M. Frieze?

Alan M. Frieze is affiliated with the following schools: