Equivalence Relations for Computing Permutation Polynomials. - Sergey Bereg; Brian Malouf; Linda Morales; Thomas Stanley; Ivan Hal Sudborough; Alexander Wong (CoRR, 2019)

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. - Sergey Bereg; Brian Malouf; Linda Morales; Thomas Stanley; Ivan Hal Sudborough (WAIFI, 2020)

Computation of Cycle Bases in Surface Embedded Graphs. - Kyle Fox; Thomas Stanley (ISAAC, 2022)

Using permutation rational functions to obtain permutation arrays with large hamming distance. - Sergey Bereg; Brian Malouf; Linda Morales; Thomas Stanley; Ivan Hal Sudborough (Des. Codes Cryptogr., 2022)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees. - Nate Veldt; Thomas Stanley; Benjamin W. Priest; Trevor Steil; Keita Iwabuchi; T. S. Jayram; Geoffrey Sanders (CoRR, 2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges. - Alex Crane; Thomas Stanley; Blair D. Sullivan; Nate Veldt (CoRR, 2025)