Purchasing a C_4 online. - Michael Anastos (CoRR, 2016)

Randomly coloring simple hypergraphs with fewer colors. - Alan M. Frieze; Michael Anastos (Inf. Process. Lett., 2017)

Constraining the Clustering Transition for Colorings of Sparse Random Graphs. - Michael Anastos; Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2018)

Connectivity of the k-Out Hypercube. - Michael Anastos (SIAM J. Discret. Math., 2018)

Packing Directed Hamilton Cycles Online. - Michael Anastos; Joseph Briggs (SIAM J. Discret. Math., 2018)

On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs. - Michael Anastos; Alan M. Frieze (APPROX-RANDOM, 2019)

Thresholds in Random Motif Graphs. - Michael Anastos; Peleg Michaeli; Samantha Petti (APPROX-RANDOM, 2019)

How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? - Michael Anastos; Alan M. Frieze (J. Graph Theory, 2019)

Pattern Colored Hamilton Cycles in Random Graphs. - Michael Anastos; Alan M. Frieze (SIAM J. Discret. Math., 2019)

A Ramsey property of random regular and k -out graphs. - Michael Anastos; Deepak Bal (J. Graph Theory, 2020)

Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis. - Michael Anastos; Alan M. Frieze (Random Struct. Algorithms, 2020)

On the connectivity of proper colorings of random graphs and hypergraphs. - Michael Anastos; Alan M. Frieze (Random Struct. Algorithms, 2020)

Majority Colorings of Sparse Digraphs. - Michael Anastos; Ander Lamaison; Raphael Steiner; Tibor Szabó (Electron. J. Comb., 2021)

On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time. - Michael Anastos (CoRR, 2021)

A fast algorithm on average for solving the Hamilton Cycle problem. - Michael Anastos (CoRR, 2021)

A scaling limit for the length of the longest cycle in a sparse random graph. - Michael Anastos; Alan M. Frieze (J. Comb. Theory B, 2021)

Finding maximum matchings in random regular graphs in linear expected time. - Michael Anastos; Alan M. Frieze (Random Struct. Algorithms, 2021)

Hamiltonicity of Random Graphs in the Stochastic Block Model. - Michael Anastos; Alan M. Frieze; Pu Gao (SIAM J. Discret. Math., 2021)

Solving the Hamilton cycle problem fast on average. - Michael Anastos (FOCS, 2022)

An improved lower bound on the length of the longest cycle in random graphs. - Michael Anastos (CoRR, 2022)

A scaling limit for the length of the longest cycle in a sparse random digraph. - Michael Anastos; Alan M. Frieze (Random Struct. Algorithms, 2022)

Fast algorithms for solving the Hamilton Cycle problem with high probability. - Michael Anastos (SODA, 2023)

A Note on Long Cycles in Sparse Random Graphs. - Michael Anastos (Electron. J. Comb., 2023)

Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets. - Michael Anastos; David Fabian; Alp Müyesser; Tibor Szabó (Electron. J. Comb., 2023)

The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging. - Michael Anastos; Benedikt Auerbach; Mirza Ahad Baig; Miguel Cueto Noval; Matthew Kwan 001; Guillermo Pascual-Perez; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2024)

Smoothed Analysis for Graph Isomorphism. - Michael Anastos; Matthew Kwan 001; Benjamin Moore (STOC, 2025)

The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs. - Yahav Alon; Michael Anastos (Random Struct. Algorithms, 2025)