Matthew Schmidt

Schmidt, M., & Vogel, K. M. (2021). Algorithms that Empower? Platformization in US Intelligence Analysis. PROCEEDINGS OF THE 2020 IEEE INTERNATIONAL SYMPOSIUM ON TECHNOLOGY AND SOCIETY (ISTAS). https://doi.org/10.1109/ISTAS50296.2020.9555838

Schmidt, M. C., Rocha, A. M., Padmanabhan, K., Shpanskaya, Y., Banfield, J., Scott, K., … Samatova, N. F. (2012). NIBBS-Search for Fast and Accurate Prediction of Phenotype-Biased Metabolic Systems. PLOS COMPUTATIONAL BIOLOGY, 8(5). https://doi.org/10.1371/journal.pcbi.1002490

Schmidt, M. C., Rocha, A. M., Padmanabhan, K., Chen, Z., Scott, K., Mihelcic, J. R., & Samatova, N. F. (2011). Efficient alpha, beta-motif finder for identification of phenotype-related functional modules. BMC BIOINFORMATICS, 12. https://doi.org/10.1186/1471-2105-12-440

Chen, W., Schmidt, M. C., & Samatova, N. F. (2011). On the parameterized complexity of the Multi-MCT and Multi-MCST problems. JOURNAL OF COMBINATORIAL OPTIMIZATION, 21(2), 151–158. https://doi.org/10.1007/s10878-009-9220-2

Hendrix, W., Schmidt, M. C., Breimyer, P., & Samatova, N. F. (2010). Theoretical underpinnings for maximal clique enumeration on perturbed graphs. THEORETICAL COMPUTER SCIENCE, 411(26-28), 2520–2536. https://doi.org/10.1016/j.tcs.2010.03.011

Schmidt, M. C., Samatova, N. F., Thomas, K., & Park, B.-H. (2009). A scalable, parallel algorithm for maximal clique enumeration. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 69(4), 417–428. https://doi.org/10.1016/j.jpdc.2009.01.003

Chen, W., Schmidt, M. C., & Samatova, N. F. (2009). On parameterized complexity of the Multi-MCS problem. THEORETICAL COMPUTER SCIENCE, 410(21-23), 2024–2032. https://doi.org/10.1016/j.tcs.2008.12.060

Samatova, N. F., Schmidt, M. C., Hendrix, W., Breimyer, P., Thomas, K., & Park, B. H. Coupling graph perturbation theory with scalable parallel algorithms for large-scale enumeration of maximal cliques in biological graphs - art. no. 012053. Scidac 2008: Scientific discovery through advanced computing, 125, 12053–12053.