Utility And Expandabilty Of Channel Assignments. - Patrick Bahls; Thomas Mahoney (Ars Comb., 2014)

Characterization of $(2m, m)$-Paintable Graphs. - Thomas Mahoney; Jixian Meng; Xuding Zhu (Electron. J. Comb., 2015)

Sum-Paintability of Generalized Theta-Graphs. - James M. Carraher; Thomas Mahoney; Gregory J. Puleo; Douglas B. West (Graphs Comb., 2015)

Families of Online Sum-Choice-Greedy Graphs. - Thomas Mahoney; Charles Tomlinson; Jennifer Wise (Graphs Comb., 2015)

Strengthening (a, b)-Choosability Results to $(a, b)$-Paintability. - Thomas Mahoney (Electron. J. Comb., 2017)

Lessons Learned from Developing and Deploying a Large-Scale Employer Name Normalization System for Online Recruitment. - Qiaoling Liu; Josh Chao; Thomas Mahoney; Alan Chern; Chris Min; Faizan Javed; Valentin Jijkoun (KDD, 2018)

Large-Scale Occupational Skills Normalization for Online Recruitment. - Phuong Hoang; Thomas Mahoney; Faizan Javed; Matt McNair (AI Mag., 2018)

Dynamic coloring parameters for graphs with given genus. - Sarah Loeb; Thomas Mahoney; Benjamin Reiniger; Jennifer Wise (Discret. Appl. Math., 2018)

Online sum-paintability: The slow-coloring game. - Thomas Mahoney; Gregory J. Puleo; Douglas B. West (Discret. Math., 2018)

An Infinite Family of Sum-Paint Critical Graphs. - Thomas Mahoney; Chad Wiley (Graphs Comb., 2020)