Michael A. Langston
TitleCited byYear
Detecting differential and correlated protein expression in label-free shotgun proteomics
B Zhang, NC VerBerkmoes, MA Langston, E Uberbacher, RL Hettich, ...
Journal of proteome research 5 (11), 2909-2918, 2006
Nonconstructive tools for proving polynomial-time decidability
MR Fellows, MA Langston
Journal of the ACM (JACM) 35 (3), 727-739, 1988
Variable sized bin packing
DK Friesen, MA Langston
SIAM journal on computing 15 (1), 222-230, 1986
Kernelization algorithms for the vertex cover problem
FN Abu-Khzam, RL Collins, MR Fellows, MA Langston, WH Suters, ...
An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
F Dehne, M Fellows, MA Langston, F Rosamond, K Stevens
International Computing and Combinatorics Conference, 859-869, 2005
On search decision and the efficiency of polynomial-time algorithms
MR Fellows, MA Langston
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
Nonconstructive advances in polynomial-time complexity
MR Fellows, MA Langston
Information Processing Letters 26 (3), 157-162, 1987
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
MR Fellows, MA Langston
30th Annual Symposium on Foundations of Computer Science, 520-525, 1989
Extracting gene networks for low-dose radiation using graph theoretical algorithms
BH Voy, JA Scharff, AD Perkins, AM Saxton, B Borate, EJ Chesler, ...
PLoS computational biology 2 (7), 2006
Scheduling to maximize the minimum processor finish time in a multiprocessor system
BL Deuermeyer, DK Friesen, MA Langston
SIAM Journal on Algebraic Discrete Methods 3 (2), 190-196, 1982
On well-partial-order theory and its application to combinatorial problems of VLSI design
MR Fellows, MA Langston
SIAM Journal on Discrete Mathematics 5 (1), 117-126, 1992
On search, decision, and the efficiency of polynomial-time algorithms
MR Fellows, MA Langston
Journal of Computer and System Sciences 49 (3), 769-779, 1994
Scalable parallel algorithms for FPT problems
FN Abu-Khzam, MA Langston, P Shanbhag, CT Symons
Algorithmica 45 (3), 269-284, 2006
Practical in-place merging
BC Huang, MA Langston
Communications of the ACM 31 (3), 348-352, 1988
Bounds for multifit scheduling on uniform processors
DK Friesen, MA Langston
SIAM Journal on Computing 12 (1), 60-70, 1983
GeneWeaver: a web-based system for integrative functional genomics
EJ Baker, JJ Jay, JA Bubier, MA Langston, EJ Chesler
Nucleic acids research 40 (D1), D1067-D1076, 2012
FPT is P-Time Extremal Structure I.
V Estivill-Castro, MR Fellows, MA Langston, FA Rosamond
ACiD 4, 1-41, 2005
Exact and approximate solutions for the gate matrix layout problem
N Deo, MS Krishnamoorthy, MA Langston
IEEE transactions on computer-aided design of integrated circuits and …, 1987
The cluster editing problem: Implementations and experiments
F Dehne, MA Langston, X Luo, S Pitre, P Shaw, Y Zhang
International Workshop on Parameterized and Exact Computation, 13-24, 2006
Genome-scale computational approaches to memory-intensive applications in systems biology
Y Zhang, FN Abu-Khzam, NE Baldwin, EJ Chesler, MA Langston, ...
SC'05: Proceedings of the 2005 ACM/IEEE Conference on Supercomputing, 12-12, 2005
The system can't perform the operation now. Try again later.
Articles 1–20