Research

My research interests include subgraph matching, network science, iterative linear system solvers, machine learning, autonomous systems, and image processing.

Publications

  • Thomas K. Tu, Jacob D. Moorman, Dominic Yang, Qinyi Chen, Andrea L. Bertozzi, “Inexact Attributed Subgraph Matching.” Proc. GTA³ 4.0: The 4th workshop on Graph Techniques for Adversarial Activity Analytics, IEEE International Conference on Big Data, Atlanta, GA, Dec. 2020. (to appear)

  • Thomas K. Tu, Dominic Yang, “Fault-tolerant Subgraph Matching on Aligned Networks.” Proc. GTA³ 4.0: The 4th workshop on Graph Techniques for Adversarial Activity Analytics, IEEE International Conference on Big Data, Atlanta, GA, Dec. 2020. (to appear)

  • Jacob D. Moorman, Thomas K. Tu, Denali Molitor, Deanna Needell, “Randomized Kaczmarz with Averaging.” BIT Numerical Mathematics, Aug. 2020.

  • Jacob D. Moorman, Thomas K. Tu, Denali Molitor, Deanna Needell, “Randomized Kaczmarz with Averaging.” Proc. Information Theory and Applications Workshop, La Jolla, CA, Feb. 2019.

  • Jacob D. Moorman, Qinyi Chen, Thomas K. Tu, Zachary M. Boyd, Andrea L. Bertozzi, “Filtering Methods for Subgraph Matching on Multiplex Networks.” Proc. GTA³ 2.0: The 2nd workshop on Graph Techniques for Adversarial Activity Analytics, IEEE International Conference on Big Data, Seattle, WA, Dec. 2018.