Toward an efficient, highly scalable maximum clique solver for massive graphs. - Ronald D. Hagan; Charles A. Phillips; Kai Wang; Gary L. Rogers; Michael A. Langston (IEEE BigData, 2014)

Lower bounds on paraclique density. - Ronald D. Hagan; Michael A. Langston; Kai Wang (Discret. Appl. Math., 2016)

Multiscale graph theoretical tools reveal subtle patterns in big geospatial data. - Ronald D. Hagan; Charles A. Phillips; Michael A. Langston; Bradley J. Rhodes (IEEE BigData, 2017)

Compound Analytics: Templates for Integrating Graph Algorithms and Machine Learning. - Ronald D. Hagan; Charles A. Phillips; Bradley J. Rhodes; Michael A. Langston (IPDPS Workshops, 2017)

Classification and Anomaly Detection in Traffic Patterns of New York City Taxis: A Case Study in Compound Analytics. - Ronald D. Hagan; Charles A. Phillips; Michael A. Langston; Bradley J. Rhodes (IPDPS Workshops, 2018)

Molecular Subtyping in Human Disease Using the Paraclique Algorithm. - Ronald D. Hagan; Michael A. Langston (DEXA Workshops, 2019)

Compound Analytics using Combinatorics for Feature Selection: A Case Study in Biomarker Detection. - Ronald D. Hagan; Brett D. Hagan; Charles A. Phillips; Bradley J. Rhodes; Michael A. Langston (IPDPS Workshops, 2019)

Towards Controllability Analysis of Dynamic Networks Using Minimum Dominating Set. - Ronald D. Hagan; Stephen K. Grady; Charles A. Phillips; Bradley J. Rhodes; Michael A. Langston (FUSION, 2020)

Molecular Subtyping and Outlier Detection in Human Disease Using the Paraclique Algorithm. - Ronald D. Hagan; Michael A. Langston (Algorithms, 2021)