Author Info
Name
Affiliation
Papers
MICHAEL ANASTOS
Department of Mathematical SciencesCarnegie Mellon UniversityPittsburghPA15213United States
10
Collaborators
Citations 
PageRank 
7
2
3.42
Referers 
Referees 
References 
6
81
53
Title
Citations
PageRank
Year
Solving the Hamilton cycle problem fast on average00.342022
Finding Maximum Matchings In Random Regular Graphs In Linear Expected Time00.342021
A Ramsey property of random regular and k‐out graphs00.342020
Thresholds in Random Motif Graphs.00.342019
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected00.342019
On the connectivity threshold for colorings of random graphs and hypergraphs.00.342018
Constraining the Clustering Transition for Colorings of Sparse Random Graphs.10.362018
Connectivity of the k-Out Hypercube00.342018
Packing Directed Hamilton Cycles Online.00.342018
Randomly coloring simple hypergraphs with fewer colors.10.352017