Michael A. Langston

According to our database1, Michael A. Langston
  • authored at least 121 papers between 1982 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Compound Analytics: Templates for Integrating Graph Algorithms and Machine Learning.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

2016
GeneWeaver: data driven alignment of cross-species genomics in biology and disease.
Nucleic Acids Research, 2016

Lower bounds on paraclique density.
Discrete Applied Mathematics, 2016

2015
Scalable multipartite subgraph enumeration for integrative analysis of heterogeneous experimental functional genomics data.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
Differential Shannon entropy and differential coefficient of variation: alternatives and augmentations to differential expression in the search for disease-related genes.
I. J. Computational Biology and Drug Design, 2014

On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types.
BMC Bioinformatics, 2014

Efficient prediction of human protein-protein interactions at a global scale.
BMC Bioinformatics, 2014

Algorithmic tools for tripartite data analysis.
BMC Bioinformatics, 2014

Toward an efficient, highly scalable maximum clique solver for massive graphs.
Proceedings of the 2014 IEEE International Conference on Big Data, 2014

2012
GeneWeaver: a web-based system for integrative functional genomics.
Nucleic Acids Research, 2012

Immersion Containment and Connectivity in Color-Critical Graphs.
Discrete Mathematics & Theoretical Computer Science, 2012

A systematic comparison of genome-scale clustering algorithms.
BMC Bioinformatics, 2012

The maximum clique enumeration problem: algorithms, applications, and implementations.
BMC Bioinformatics, 2012

On Bipartite Graph Decomposition in the Presence of Noise, with Applications to Biological Data Clustering.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Almost Exact Graph 3-Coloring in O(1.277^n) Time.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Fixed-Parameter Tractability, A Prehistory, .
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction.
Discrete Optimization, 2011

Quadratic Kernelization for Convex Recoloring of Trees.
Algorithmica, 2011

A complete resolution of the Keller maximum clique problem.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A Systematic Comparison of Genome Scale Clustering Algorithms - (Extended Abstract).
Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

The Maximum Clique Enumeration Problem: Algorithms, Applications and Implementations.
Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

2010
Graph algorithms for machine learning: a case-control study based on prostate cancer populations and high throughput transcriptomic data.
BMC Bioinformatics, 2010

Inferring gene coexpression networks for low dose ionizing radiation using graph theoretical algorithms and systems genetics.
BMC Bioinformatics, 2010

Serendipitous discoveries in microarray analysis.
BMC Bioinformatics, 2010

A Hybrid Graph Representation for Recursive Backtracking Algorithms.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

A Fixed-Parameter Algorithm for String-to-String Correction.
Proceedings of the Theory of Computing 2010, 2010

2009
Reconstructing Generalized Logical Networks of Transcriptional Regulation in Mouse Brain from Temporal Gene Expression Data.
EURASIP J. Bioinformatics and Systems Biology, 2009

A module-based analytical strategy to identify novel disease-associated genes shows an inhibitory role for interleukin 7 Receptor in allergic inflammation.
BMC Systems Biology, 2009

Threshold selection in gene co-expression networks using spectral graph theory techniques.
BMC Bioinformatics, 2009

Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs.
Proceedings of the 7th IEEE/ACS International Conference on Computer Systems and Applications, 2009

2008
A bounded search tree algorithm for parameterized face cover.
J. Discrete Algorithms, 2008

Innovative Computational Methods for Transcriptomic Data Analysis: A Case Study in the Use of FPT for Practical Algorithm Design and Implementation.
Comput. J., 2008

The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors.
Comput. J., 2008

2007
Combinatorial and Algorithmic Issues for Microarray Analysis.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem.
Theory Comput. Syst., 2007

Crown Structures for Vertex Cover Kernelization.
Theory Comput. Syst., 2007

Linear-time algorithms for problems on planar graphs with fixed disk dimension.
Inf. Process. Lett., 2007

Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Efficient Parameterized Preprocessing for Cluster Editing.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Quadratic Kernelization for Convex Recoloring of Trees.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover.
Proceedings of the 2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 2007

2006
Editorial.
Theor. Comput. Sci., 2006

Extracting Gene Networks for Low-Dose Radiation Using Graph Theoretical Algorithms.
PLoS Computational Biology, 2006

Scalable Parallel Algorithms for FPT Problems.
Algorithmica, 2006

Innovative computational methods for transcriptomic data analysis.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

The Cluster Editing Problem: Implementations and Experiments.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Computational Analysis of Mass Spectrometry Data Using Novel Combinatorial Methods.
Proceedings of the 2006 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2006), 2006

Kernelization for Convex Recoloring.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology.
Proceedings of the ACM/IEEE SC2005 Conference on High Performance Networking and Computing, 2005

Combinatorial Genetic Regulatory Network Analysis Tools for High Throughput Transcriptomic Data.
Proceedings of the Systems Biology and Regulatory Genomics, 2005

Position Statement: Methodology to Support Dependable Survivable Cyber-Secure Infrastructures.
Proceedings of the 38th Hawaii International Conference on System Sciences (HICSS-38 2005), 2005

A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Fast, effective vertex cover kernelization: a tale of two algorithms.
Proceedings of the 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), 2005

FPT is P-Time Extremal Structure I.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

Asymptotically Faster Algorithms for Parameterized FACE COVER.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2004

Practical FPT Implementations and Applications (Invited Talk).
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

A Direct Algorithm for the Parameterized Face Cover Problem.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

High Performance Computational Tools for Motif Discovery.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Grid Computing: Minitrack Introduction.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004

Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
Graph Coloring and the Immersion Order.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
On Special-purpose Hardware Clusters for High-performance Computational Grids.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Distributed Dimension Reduction Algorithms for Widely Dispersed Data.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

2001
Automatic Mapping of Multiple Applications to Multiple Adaptive Computing Systems.
Proceedings of the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2001

2000
On computing graph minor obstruction sets.
Theor. Comput. Sci., 2000

1999
Fast Algorithms forK4Immersion Testing.
J. Algorithms, 1999

1998
Approximation the Pathwidth of Outerplanar Graphs.
Inf. Process. Lett., 1998

On algorithmic applications of the immersion order : An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory.
Discrete Mathematics, 1998

1997
Parallel and Distributed Algorithms.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1996
An Introduction to the Special Issue.
Parallel Algorithms Appl., 1996

1995
Parallel Benchmarks and Comparison-Based Computing.
Proceedings of the Parallel Computing: State-of-the-Art and Perspectives, 1995

1994
Mimd versus Simd Computation: Experience with Non-numeric Parallel Algorithms.
Parallel Algorithms Appl., 1994

On Search, Decision, and the Efficiency of Polynomial-Time Algorithms.
J. Comput. Syst. Sci., 1994

obstruction Set Isolation for the Gate Matrix Layout Problem.
Discrete Applied Mathematics, 1994

1993
A Practical Approach to Layout Optimization.
Proceedings of the Sixth International Conference on VLSI Design, 1993

Concurrency and Parallelism - Introduction.
Proceedings of the Computing and Information, 1993

1992
Small Diameter Symmetric Networks from Linear Groups.
IEEE Trans. Computers, 1992

On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design.
SIAM J. Discrete Math., 1992

Parallel Methods for Solving Fundamental File Rearrangement Problems.
J. Parallel Distrib. Comput., 1992

Fast Stable Merging and Sorting in Constant Extra Space.
Comput. J., 1992

Cutwidth approximation in linear time.
Proceedings of the Second Great Lakes Symposium on VLSI, 1992

1991
Time-Space Optimal Parallel Merging and Sorting.
IEEE Trans. Computers, 1991

Analysis of a Compound bin Packing Algorithm.
SIAM J. Discrete Math., 1991

Stable Set and Multiset Operations in Optimal Time and Space.
Inf. Process. Lett., 1991

Fast search algorithms for layout permutation problems.
Integration, 1991

Constructive complexity.
Discrete Applied Mathematics, 1991

An obstruction-based approach to layout optimization.
Proceedings of the Graph Structure Theory, 1991

Dense layouts for series-parallel circuits.
Proceedings of the First Great Lakes Symposium on VLSI, 1991

Constructivity Issues in Graph Algorithms.
Proceedings of the Constructivity in Computer Science, 1991

1990
Resource allocation under limited sharing.
Discrete Applied Mathematics, 1990

Time-Space Optimal Parallel Set Operations.
Proceedings of the First International Conference on Databases, 1990

Time-Space Optimal Parallel Algorithms (Abstract).
Proceedings of the Advances in Computing and Information, 1990

1989
Online variable-sized bin packing.
Discrete Applied Mathematics, 1989

Stable Duplicate-Key Extraction with Optimal Time and Space Bounds.
Acta Inf., 1989

On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Time-Space Optimal Parallel Merging and Sorting.
Proceedings of the International Conference on Parallel Processing, 1989

An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Processor Utilization in a Linearly Connected Parallel Processing System.
IEEE Trans. Computers, 1988

On a Special Case of Uniform Processor Scheduling.
J. Algorithms, 1988

Nonconstructive tools for proving polynomial-time decidability.
J. ACM, 1988

Practical In-Place Merging.
Commun. ACM, 1988

On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm.
BIT, 1988

On Finding Optimal and Near-Optimal Lineal Spanning Trees.
Algorithmica, 1988

Stable Set and Multiset Operations in Optimal Time and Space.
Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1988

Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
Exact and Approximate Solutions for the Gate Matrix Layout Problem.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1987

Movement coordination for single-track robot systems.
J. Field Robotics, 1987

Nonconstructive Advances in Polynomial-Time Complexity.
Inf. Process. Lett., 1987

Interstage Transportation Planning in the Deterministic Flow-Shop Environment.
Operations Research, 1987

Bin Packing: On Optimizing the Number of Pieces Packed.
BIT, 1987

1986
Variable Sized Bin Packing.
SIAM J. Comput., 1986

Evaluation of a MULTIFIT-Based Scheduling Algorithm.
J. Algorithms, 1986

1985
Movement coordination for single-track robot systems.
Proceedings of the 1985 IEEE International Conference on Robotics and Automation, 1985

1984
A Storage-Size Selection Problem.
Inf. Process. Lett., 1984

A Performance Guarantee for the Greedy Set-Partitioning Algorithm.
Acta Inf., 1984

1983
Bounds for Multifit Scheduling on Uniform Processors.
SIAM J. Comput., 1983

1982
Improved 0/1-Interchange Scheduling.
BIT, 1982


  Loading...