Four-Coloring P6-Free Graphs. II. Finding an Excellent Precoloring (with M. Chudnovsky and S. Spirkl), SIAM Journal on Computing, 53 (2024), 146-187.
Four-Coloring P6-Free Graphs. I. Extending an Excellent Precoloring (with M. Chudnovsky and S. Spirkl), SIAM Journal on Computing, 53 (2024), 111-145.
Complexity of Ck-coloring in hereditary classes of graphs (with M. Chudnovsky, S. Huang, P. Rzazewski and S. Spirkl), Information and Computation, 292 (2023), 105015.
Better 3-coloring algorithms: excluding a triangle and a seven vertex path (with F. Bonomo, M. Chudnovsky, J. Goedgebeur, P. Maceli, O. Schaudt, and M. Stein), Theoretical Computer Science, 850(2021), 98-115
List 3-coloring graphs with no P6+rP3 (with M. Chudnovsky, S. Huang and S. Spirkl), Algorithmica, 83(2021), 216–251
List-three-coloring Pt -free graphs with no induced 1-subdivision of K_{1,s} (with M. Chudnovsky and S. Spirkl), Discrete Mathematics, 11(2020), Article 112086.
Obstructions for three-coloring graphs without induced paths on six vertices (with M. Chudnovsky, J. Goedgebeur and O. Schaudt), Journal of Combinatorial Theory, Ser. B, 140 (2020), 45-83.
Obstructions for three-coloring and list three-coloring H-free graphs (with M. Chudnovsky, J. Goedgebeur and O. Schaudt), SIAM Journal on Discrete Mathematics, 34 (2020), 431-469.
Scheduling When You Don't Know the Number of Machines (with C. Stein), ACM Transactions on Algorithms, November 2019, Article No.9.
Triangle-free graphs with no six-vertex induced path (with M. Chudnovsky, P. Seymour and S. Spirkl), Discrete Math, 341 (2018), 2179-2196.
Three-coloring and list three-coloring graphs without induced paths on seven vertices (with F. Bonomo, M. Chudnovsky, P. Maceli, O. Schaudt and M. Stein), Combinatorica, 38 (2018) , 779-801.
4-coloring P6-free graphs with no induced 5-cycles (with M. Chudnovsky, P. Maceli and J. Stacho), Journal of Graph Theory, 84 (2017), 262-285
Complexity of Ck-coloring in hereditary classes of graphs (with M. Chudnovsky, S. Huang, P. Rzążewski, and S. Spirkl), Proceedings of ESA 2019.
Four-coloring P6-free graph (with M. Chudnovsky and S. Spirkl), Proceedings of SODA 2019, 1239-1256.
Scheduling When You Don't Know the Number of Machines (with C. Stein), Proceedings of SODA 2018, 1261-1273.
Approximately Coloring Graphs Without Long Induced Paths (with M. Chudnovsky, O. Schaudt, S. Spirkl and M. Stein), Proceedings of WG 2017, 193-205.
Obstructions for three-coloring graphs without induced paths on six vertices (with M. Chudnovsky, J. Goedgebeur, O. Schaudt), Proceedings of SODA 2016, 1774-1783.