The following pages link to Alan Frieze (Q1577015):
Displaying 50 items.
- A bilinear programming formulation of the 3-dimensional assignment problem (Q4050393) (← links)
- Bottleneck Linear Programming (Q4070622) (← links)
- Shortest path algorithms for knapsack type problems (Q4123080) (← links)
- Minimum Paths in Directed Graphs (Q4143043) (← links)
- A Partitioned Inverse in Linear Programming (Q4160671) (← links)
- (Q4191856) (← links)
- Approximately Counting Hamilton Paths and Cycles in Dense Graphs (Q4210094) (← links)
- Optimal Construction of Edge-Disjoint Paths in Random Graphs (Q4210165) (← links)
- (Q4226449) (← links)
- (Q4247194) (← links)
- (Q4252300) (← links)
- (Q4252307) (← links)
- On Perfect Matchings and Hamilton Cycles in Sums of Random Trees (Q4255816) (← links)
- Multicolored trees in random graphs (Q4288877) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- On Subgraph Sizes in Random Graphs (Q4291207) (← links)
- A random polynomial-time algorithm for approximating the volume of convex bodies (Q4302827) (← links)
- Finding hidden hamiltonian cycles (Q4306372) (← links)
- Hamilton Cycles in Random Regular Digraphs (Q4306430) (← links)
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs (Q4312418) (← links)
- Near‐perfect token distribution (Q4312747) (← links)
- On the independence number of random cubic graphs (Q4315392) (← links)
- Randomized greedy matching. II (Q4322476) (← links)
- (Q4335204) (← links)
- (Q4347886) (← links)
- (Q4385084) (← links)
- Concurrent threads and optimal parallel minimum spanning trees algorithm (Q4406286) (← links)
- Randomly coloring graphs with lower bounds on girth and maximum degree (Q4434470) (← links)
- The emergence of a giant component in random subgraphs of pseudo-random graphs (Q4446876) (← links)
- Adding random edges to dense graphs (Q4459584) (← links)
- (Q4461909) (← links)
- (Q4471288) (← links)
- (Q4471289) (← links)
- Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk (Q4487074) (← links)
- Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs (Q4500422) (← links)
- (Q4500692) (← links)
- (Q4527020) (← links)
- Addendum to ‘avoiding a giant component’ (Q4534223) (← links)
- (Q4542551) (← links)
- On the insertion time of random walk cuckoo hashing (Q4575840) (← links)
- The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights (Q4581213) (← links)
- A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276) (← links)
- Greedy algorithms for the shortest common superstring that are asymtotically optimal (Q4595487) (← links)
- Discordant Voting Processes on Finite Graphs (Q4598288) (← links)
- A note on dispersing particles on a line (Q4625018) (← links)
- Perfect matchings and Hamiltonian cycles in the preferential attachment model (Q4633318) (← links)
- (Q4633810) (← links)
- (Q4633827) (← links)
- On smoothed \(k\)-CNF formulas and the \texttt{Walksat} algorithm (Q4633854) (← links)
- On the trace of random walks on random graphs (Q4637998) (← links)
