Improved 0/1-Interchange Scheduling. - Michael A. Langston (BIT, 1982)

Bounds for Multifit Scheduling on Uniform Processors. - Donald K. Friesen; Michael A. Langston (SIAM J. Comput., 1983)

A Performance Guarantee for the Greedy Set-Partitioning Algorithm. - Edward G. Coffman Jr.; Michael A. Langston (Acta Informatica, 1984)

A Storage-Size Selection Problem. - Donald K. Friesen; Michael A. Langston (Inf. Process. Lett., 1984)

Evaluation of a MULTIFIT-Based Scheduling Algorithm. - Donald K. Friesen; Michael A. Langston (J. Algorithms, 1986)

Variable Sized Bin Packing. - Donald K. Friesen; Michael A. Langston (SIAM J. Comput., 1986)

Bin Packing: On Optimizing the Number of Pieces Packed. - Donald K. Friesen; Michael A. Langston (BIT, 1987)

Interstage Transportation Planning in the Deterministic Flow-Shop Environment. - Michael A. Langston (Oper. Res., 1987)

Nonconstructive Advances in Polynomial-Time Complexity. - Michael R. Fellows; Michael A. Langston (Inf. Process. Lett., 1987)

Movement coordination for single-track robot systems. - Chul E. Kim; Michael A. Langston (J. Field Robotics, 1987)

Exact and Approximate Solutions for the Gate Matrix Layout Problem. - Narsingh Deo; Mukkai S. Krishnamoorthy; Michael A. Langston (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987)

Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. - Michael R. Fellows; Michael A. Langston (AWOC, 1988)

On Finding Optimal and Near-Optimal Lineal Spanning Trees. - Michael R. Fellows; Donald K. Friesen; Michael A. Langston (Algorithmica, 1988)

On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm. - Ivan Stojmenovic; Michael A. Langston (BIT, 1988)

Practical In-Place Merging. - Bing-Chao Huang; Michael A. Langston (Commun. ACM, 1988)

Nonconstructive tools for proving polynomial-time decidability. - Michael R. Fellows; Michael A. Langston (J. ACM, 1988)

On a Special Case of Uniform Processor Scheduling. - Manfred Kunde; Michael A. Langston; Jin-Ming Liu (J. Algorithms, 1988)

Processor Utilization in a Linearly Connected Parallel Processing System. - Michael R. Fellows; Michael A. Langston (IEEE Trans. Computers, 1988)

Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation. - Michael R. Fellows; Nancy G. Kinnersley; Michael A. Langston (Computers and Mathematics, 1989)

An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract) - Michael R. Fellows; Michael A. Langston (FOCS, 1989)

On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) - Michael R. Fellows; Michael A. Langston (STOC, 1989)

Stable Duplicate-Key Extraction with Optimal Time and Space Bounds. - Bing-Chao Huang; Michael A. Langston (Acta Informatica, 1989)

Online variable-sized bin packing. - Nancy G. Kinnersley; Michael A. Langston (Discret. Appl. Math., 1989)

Time-Space Optimal Parallel Algorithms (Abstract). - Michael A. Langston (ICCI, 1990)

Time-Space Optimal Parallel Set Operations. - Xiaojun Guan; Michael A. Langston (PARBASE, 1990)

Resource allocation under limited sharing. - Michael A. Langston; Michael P. Morford (Discret. Appl. Math., 1990)

Constructivity Issues in Graph Algorithms. - Michael R. Fellows; Michael A. Langston (Constructivity in Computer Science, 1991)

Dense layouts for series-parallel circuits. - Michael A. Langston; Siddharthan Ramachandramurthi (Great Lakes Symposium on VLSI, 1991)

An obstruction-based approach to layout optimization. - Michael A. Langston (Graph Structure Theory, 1991)

Constructive complexity. - Karl R. Abrahamson; Michael R. Fellows; Michael A. Langston; Bernard M. E. Moret (Discret. Appl. Math., 1991)

Fast search algorithms for layout permutation problems. - Michael R. Fellows; Michael A. Langston (Integr., 1991)

Stable Set and Multiset Operations in Optimal Time and Space. - Bing-Chao Huang; Michael A. Langston (Inf. Process. Lett., 1991)

Analysis of a Compound bin Packing Algorithm. - Donald K. Friesen; Michael A. Langston (SIAM J. Discret. Math., 1991)

Time-Space Optimal Parallel Merging and Sorting. - Xiaojun Guan; Michael A. Langston (IEEE Trans. Computers, 1991)

Cutwidth approximation in linear time. - Heather Booth; Rajeev Govindan; Michael A. Langston; Siddharthan Ramachandramurthi (Great Lakes Symposium on VLSI, 1992)

Fast Stable Merging and Sorting in Constant Extra Space. - Bing-Chao Huang; Michael A. Langston (Comput. J., 1992)

Parallel Methods for Solving Fundamental File Rearrangement Problems. - Xiaojun Guan; Michael A. Langston (J. Parallel Distributed Comput., 1992)

On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. - Michael R. Fellows; Michael A. Langston (SIAM J. Discret. Math., 1992)

Small Diameter Symmetric Networks from Linear Groups. - Lowell Campbell; Gunnar E. Carlsson; Michael J. Dinneen; Vance Faber; Michael R. Fellows; Michael A. Langston; James W. Moore; Andrew P. Mullhaupt; Harlan B. Sexton (IEEE Trans. Computers, 1992)

Concurrency and Parallelism - Introduction. - Michael A. Langston (ICCI, 1993)

A Practical Approach to Layout Optimization. - Rajeev Govindan; Michael A. Langston; Siddharthan Ramachandramurthi (VLSI Design, 1993)

obstruction Set Isolation for the Gate Matrix Layout Problem. - Nancy G. Kinnersley; Michael A. Langston (Discret. Appl. Math., 1994)

On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. - Michael R. Fellows; Michael A. Langston (J. Comput. Syst. Sci., 1994)

Mimd versus Simd Computation: Experience with Non-numeric Parallel Algorithms. - Clay P. Breshears; Michael A. Langston (Parallel Algorithms Appl., 1994)

Parallel Benchmarks and Comparison-Based Computing. - Clay P. Breshears; Michael A. Langston (PARCO, 1995)

An Introduction to the Special Issue. - Michael A. Langston (Parallel Algorithms Appl., 1996)

Parallel and Distributed Algorithms. - Michael A. Langston; Stephan Olariu; James L. Schwing (HICSS (1), 1997)

On algorithmic applications of the immersion order : An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory. - Michael A. Langston; Barbara C. Plaut (Discret. Math., 1998)

Approximation the Pathwidth of Outerplanar Graphs. - Rajeev Govindan; Michael A. Langston; Xudong Yan (Inf. Process. Lett., 1998)

Fast Algorithms forK4Immersion Testing. - Heather Booth; Rajeev Govindan; Michael A. Langston; Siddharthan Ramachandramurthi (J. Algorithms, 1999)

On computing graph minor obstruction sets. - Kevin Cattell; Michael J. Dinneen; Rodney G. Downey; Michael R. Fellows; Michael A. Langston (Theor. Comput. Sci., 2000)

Automatic Mapping of Multiple Applications to Multiple Adaptive Computing Systems. - Sze-Wei Ong; Nabil Kerkiz; Bernadeta Srijanto; Chandra Tan; Michael A. Langston; Danny F. Newport; Donald W. Bouldin (FCCM, 2001)

Distributed Dimension Reduction Algorithms for Widely Dispersed Data. - Faisal N. Abu-Khzam; Nagiza F. Samatova; George Ostrouchov; Michael A. Langston; Al Geist (IASTED PDCS, 2002)

On Special-purpose Hardware Clusters for High-performance Computational Grids. - Jeanne M. Lehrter; Faisal N. Abu-Khzam; Donald W. Bouldin; Michael A. Langston; Gregory D. Peterson (IASTED PDCS, 2002)

Graph Coloring and the Immersion Order. - Faisal N. Abu-Khzam; Michael A. Langston (COCOON, 2003)

Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. - Faisal N. Abu-Khzam; Rebecca L. Collins; Michael R. Fellows; Michael A. Langston; W. Henry Suters; Christopher T. Symons (ALENEX/ANALC, 2004)

Grid Computing: Minitrack Introduction. - Faisal N. Abu-Khzam; Michael A. Langston (HICSS, 2004)

High Performance Computational Tools for Motif Discovery. - Nicole E. Baldwin; Rebecca L. Collins; Michael A. Langston; Christopher T. Symons; Michael R. Leuze; Brynn H. Voy (IPDPS, 2004)

A Direct Algorithm for the Parameterized Face Cover Problem. - Faisal N. Abu-Khzam; Michael A. Langston (IWPEC, 2004)

Practical FPT Implementations and Applications (Invited Talk). - Michael A. Langston (IWPEC, 2004)

Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. - Faisal N. Abu-Khzam; Michael A. Langston; Pushkar Shanbhag (Parallel and Distributed Computing and Networks, 2004)

Asymptotically Faster Algorithms for Parameterized FACE COVER. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston (ACiD, 2005)

FPT is P-Time Extremal Structure I. - Vladimir Estivill-Castro; Michael R. Fellows; Michael A. Langston; Frances A. Rosamond (ACiD, 2005)

Fast, effective vertex cover kernelization: a tale of two algorithms. - Faisal N. Abu-Khzam; Michael A. Langston; W. Henry Suters (AICCSA, 2005)

A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem. - W. Henry Suters; Faisal N. Abu-Khzam; Yun Zhang 013; Christopher T. Symons; Nagiza F. Samatova; Michael A. Langston (COCOON, 2005)

Position Statement: Methodology to Support Dependable Survivable Cyber-Secure Infrastructures. - Frederick T. Sheldon; Stephen Gordon Batsell; Stacy J. Prowell; Michael A. Langston (HICSS, 2005)

Combinatorial Genetic Regulatory Network Analysis Tools for High Throughput Transcriptomic Data. - Elissa J. Chesler; Michael A. Langston (Systems Biology and Regulatory Genomics, 2005)

Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology. - Yun Zhang 013; Faisal N. Abu-Khzam; Nicole E. Baldwin; Elissa J. Chesler; Michael A. Langston; Nagiza F. Samatova (SC, 2005)

Kernelization for Convex Recoloring. - Hans L. Bodlaender; Michael R. Fellows; Michael A. Langston; Mark A. Ragan; Frances A. Rosamond; Mark Weyer (ACiD, 2006)

Computational Analysis of Mass Spectrometry Data Using Novel Combinatorial Methods. - Ahmed Fadiel; Michael A. Langston; Xinxia Peng; Andy D. Perkins; Hugh S. Taylor; Ozge Tuncalp; D. Vitello; Paul H. Pevsner; Frederick Naftolin (AICCSA, 2006)

The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. - Kevin Burrage; Vladimir Estivill-Castro; Michael R. Fellows; Michael A. Langston; Shev Mac; Frances A. Rosamond (IWPEC, 2006)

The Cluster Editing Problem: Implementations and Experiments. - Frank K. H. A. Dehne; Michael A. Langston; Xuemei Luo; Sylvain Pitre; Peter Shaw 001; Yun Zhang 013 (IWPEC, 2006)

Innovative computational methods for transcriptomic data analysis. - Michael A. Langston; Andy D. Perkins; Arnold M. Saxton; Jon A. Scharff; Brynn H. Voy (SAC, 2006)

Scalable Parallel Algorithms for FPT Problems. - Faisal N. Abu-Khzam; Michael A. Langston; Pushkar Shanbhag; Christopher T. Symons (Algorithmica, 2006)

Extracting Gene Networks for Low-Dose Radiation Using Graph Theoretical Algorithms. - Brynn H. Voy; Jon A. Scharff; Andy D. Perkins; Arnold M. Saxton; Bhavesh Borate; Elissa J. Chesler; Lisa K. Branstetter; Michael A. Langston (PLoS Comput. Biol., 2006)

Editorial. - Rod Downey; Michael A. Langston; Rolf Niedermeier (Theor. Comput. Sci., 2006)

The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover. - Faisal N. Abu-Khzam; Nagiza F. Samatova; Mohamad A. Rizk; Michael A. Langston (AICCSA, 2007)

Efficient Parameterized Preprocessing for Cluster Editing. - Michael R. Fellows; Michael A. Langston; Frances A. Rosamond; Peter Shaw 001 (FCT, 2007)

Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets. - Michael A. Langston (WADS, 2007)

Linear-time algorithms for problems on planar graphs with fixed disk dimension. - Faisal N. Abu-Khzam; Michael A. Langston (Inf. Process. Lett., 2007)

Crown Structures for Vertex Cover Kernelization. - Faisal N. Abu-Khzam; Michael R. Fellows; Michael A. Langston; W. Henry Suters (Theory Comput. Syst., 2007)

An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. - Frank K. H. A. Dehne; Michael R. Fellows; Michael A. Langston; Frances A. Rosamond; Kim Stevens (Theory Comput. Syst., 2007)

Combinatorial and Algorithmic Issues for Microarray Analysis. - Michael A. Langston; Carlos Cotta; Pablo Moscato (Handbook of Approximation Algorithms and Metaheuristics, 2007)

The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. - Rodney G. Downey; Michael R. Fellows; Michael A. Langston (Comput. J., 2008)

Innovative Computational Methods for Transcriptomic Data Analysis: A Case Study in the Use of FPT for Practical Algorithm Design and Implementation. - Michael A. Langston; Andy D. Perkins; Arnold M. Saxton; Jon A. Scharff; Brynn H. Voy (Comput. J., 2008)

A bounded search tree algorithm for parameterized face cover. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston (J. Discrete Algorithms, 2008)

Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs. - Gary L. Rogers; Andy D. Perkins; Charles A. Phillips; John D. Eblen; Faisal N. Abu-Khzam; Michael A. Langston (AICCSA, 2009)

Threshold selection in gene co-expression networks using spectral graph theory techniques. - Andy D. Perkins; Michael A. Langston (BMC Bioinform., 2009)

A module-based analytical strategy to identify novel disease-associated genes shows an inhibitory role for interleukin 7 Receptor in allergic inflammation. - Reza Mobini; Bengt A. Andersson; Jonas Erjefält; Mirjana Hahn-Zoric; Michael A. Langston; Andy D. Perkins; Lars Cardell; Mikael Benson (BMC Syst. Biol., 2009)

Reconstructing Generalized Logical Networks of Transcriptional Regulation in Mouse Brain from Temporal Gene Expression Data. - Mingzhou (Joe) Song; Chris K. Lewis; Eric R. Lance; Elissa J. Chesler; Roumyana Kirova Yordanova; Michael A. Langston; Kerrie H. Lodowski; Susan E. Bergeson (EURASIP J. Bioinform. Syst. Biol., 2009)

A Fixed-Parameter Algorithm for String-to-String Correction. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston; Serena Lee-Cultura; Ulrike Stege (CATS, 2010)

A Hybrid Graph Representation for Recursive Backtracking Algorithms. - Faisal N. Abu-Khzam; Michael A. Langston; Amer E. Mouawad; Clinton P. Nolan (FAW, 2010)

Serendipitous discoveries in microarray analysis. - Sally R. Ellingson; Charles A. Phillips; Randy Glenn; Douglas Swanson; Thomas Ha; Daniel Goldowitz; Michael A. Langston (BMC Bioinform., 2010)

Inferring gene coexpression networks for low dose ionizing radiation using graph theoretical algorithms and systems genetics. - Sudhir Naswa; Gary L. Rogers Jr.; Rachel M. Lynch; Stephen A. Kania; Suchita Das; Elissa J. Chesler; Arnold M. Saxton; Brynn H. Voy; Michael A. Langston (BMC Bioinform., 2010)

Graph algorithms for machine learning: a case-control study based on prostate cancer populations and high throughput transcriptomic data. - Gary L. Rogers; Pablo Moscato; Michael A. Langston (BMC Bioinform., 2010)

A Systematic Comparison of Genome Scale Clustering Algorithms - (Extended Abstract). - Jeremy J. Jay; John D. Eblen; Yun Zhang 013; Mikael Benson; Andy D. Perkins; Arnold M. Saxton; Brynn H. Voy; Elissa J. Chesler; Michael A. Langston (ISBRA, 2011)

A complete resolution of the Keller maximum clique problem. - Jennifer Debroni; John D. Eblen; Michael A. Langston; Wendy J. Myrvold; Peter W. Shor; Dinesh Weerapurage (SODA, 2011)

Quadratic Kernelization for Convex Recoloring of Trees. - Hans L. Bodlaender; Michael R. Fellows; Michael A. Langston; Mark A. Ragan; Frances A. Rosamond; Mark Weyer (Algorithmica, 2011)

Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston; Serena Lee-Cultura; Ulrike Stege (Discret. Optim., 2011)

Fixed-Parameter Tractability, A Prehistory, . - Michael A. Langston (The Multivariate Algorithmic Revolution and Beyond, 2012)

Almost Exact Graph 3-Coloring in O(1.277^n) Time. - Faisal N. Abu-Khzam; Michael A. Langston (CTW, 2012)

On Bipartite Graph Decomposition in the Presence of Noise, with Applications to Biological Data Clustering. - Charles A. Phillips; Jeremy J. Jay; Erich J. Baker; Elissa J. Chesler; Michael A. Langston (CTW, 2012)

The maximum clique enumeration problem: algorithms, applications, and implementations. - John D. Eblen; Charles A. Phillips; Gary L. Rogers; Michael A. Langston (BMC Bioinform., 2012)

A systematic comparison of genome-scale clustering algorithms. - Jeremy J. Jay; John D. Eblen; Yun Zhang 013; Mikael Benson; Andy D. Perkins; Arnold M. Saxton; Brynn H. Voy; Elissa J. Chesler; Michael A. Langston (BMC Bioinform., 2012)

Immersion Containment and Connectivity in Color-Critical Graphs. - Faisal N. Abu-Khzam; Michael A. Langston (Discret. Math. Theor. Comput. Sci., 2012)

GeneWeaver: a web-based system for integrative functional genomics. - Erich J. Baker; Jeremy J. Jay; Jason A. Bubier; Michael A. Langston; Elissa J. Chesler (Nucleic Acids Res., 2012)

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)

Algorithmic tools for tripartite data analysis. - Charles A. Phillips; Erich J. Baker; Elissa J. Chesler; Michael A. Langston (BMC Bioinform., 2014)

Efficient prediction of human protein-protein interactions at a global scale. - Andrew Schoenrock; Bahram Samanfar; Sylvain Pitre; Mohsen Hooshyar; Ke Jin; Charles A. Phillips; Hui Wang; Sadhna Phanse; Katayoun Omidi; Yuan Gui; Md Alamgir; Alex Wong 003; et al. (BMC Bioinform., 2014)

On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. - Yun Zhang 013; Charles A. Phillips; Gary L. Rogers; Erich J. Baker; Elissa J. Chesler; Michael A. Langston (BMC Bioinform., 2014)

Differential Shannon entropy and differential coefficient of variation: alternatives and augmentations to differential expression in the search for disease-related genes. - Kai Wang; Charles A. Phillips; Gary L. Rogers; Fredrik Barrenäs; Mikael Benson; Michael A. Langston (Int. J. Comput. Biol. Drug Des., 2014)

Scalable multipartite subgraph enumeration for integrative analysis of heterogeneous experimental functional genomics data. - Charles A. Phillips; Kai Wang; Jason A. Bubier; Erich J. Baker; Elissa J. Chesler; Michael A. Langston (BCB, 2015)

An automated resource for enhanced differential analysis. - Kai Wang; Charles A. Phillips; Arnold M. Saxton; Michael A. Langston (BMC Bioinform., 2015)

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

GeneWeaver: data driven alignment of cross-species genomics in biology and disease. - Erich J. Baker; Jason A. Bubier; Timothy Reynolds; Michael A. Langston; Elissa J. Chesler (Nucleic Acids Res., 2016)

Proceedings of the 15th Annual UT-KBRIN Bioinformatics Summit 2016: Cadiz, KY, USA. 8-10 April 2016. - Eric C. Rouchka; Julia H. Chariker; Benjamin J. Harrison; Juw Won Park; Xueyuan Cao; Stanley Pounds; Susana C. Raimondi; James R. Downing; Raul C. Ribeiro; Jeffrey Rubnitz; Jatinder Lamba; Bernie J. Daigle Jr.; et al. (BMC Bioinform., 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)

Detecting Outliers in Streaming Time Series Data from ARM Distributed Sensors. - Yuping Lu; Jitendra Kumar 001; Nathan Collier; Bhargavi Krishna; Michael A. Langston (ICDM Workshops, 2018)

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)

On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs. - Charles A. Phillips; Kai Wang; Erich J. Baker; Jason A. Bubier; Elissa J. Chesler; Michael A. Langston (Algorithms, 2019)

A robustness metric for biological data clustering algorithms. - Yuping Lu; Charles A. Phillips; Michael A. Langston (BMC Bioinform., 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)

Gene-disease-drug link prediction using tripartite graphs. - Cheng Chen; Stephen K. Grady; Sally R. Ellingson; Michael A. Langston (BCB, 2021)

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

Detecting anomalous sequences in electronic health records using higher-order tensor networks. - Haoran Niu; Olufemi A. Omitaomu; Michael A. Langston; Mohammed M. Olama; Özgür Özmen; Hilda B. Klasky; Angela Laurio; Brian C. Sauer; Merry Ward; Jonathan R. Nebeker (J. Biomed. Informatics, 2022)

A Brief Study of Gene Co-expression Thresholding Algorithms. - Carissa Bleker; Stephen K. Grady; Michael A. Langston (ISBRA, 2023)

EHR-BERT: A BERT-based model for effective anomaly detection in electronic health records. - Haoran Niu; Olufemi A. Omitaomu; Michael A. Langston; Mohammed M. Olama; Özgür Özmen; Hilda B. Klasky; Angela Laurio; Merry Ward; Jonathan R. Nebeker (J. Biomed. Informatics, 2024)

A Comparative Study of Gene Co-Expression Thresholding Algorithms. - Carissa Bleker; Stephen K. Grady; Michael A. Langston (J. Comput. Biol., 2024)

Anomaly Detection in Electronic Health Records Across Hospital Networks: Integrating Machine Learning With Graph Algorithms. - Haoran Niu; Olufemi A. Omitaomu; Michael A. Langston; Stephen K. Grady; Mohammed M. Olama; Özgür Özmen; Hilda B. Klasky; Angela Laurio; Merry Ward; Jonathan R. Nebeker (IEEE J. Biomed. Health Informatics, 2025)