 | 2008 |
|---|
| 82 |       | Rodney G. Downey,
Michael R. Fellows,
Michael A. Langston:
The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors.
Comput. J. 51(1): 1-6 (2008) |
| 81 | | Michael A. Langston,
Andy D. Perkins,
Arnold M. Saxton,
Jon A. Scharff,
Brynn H. Voy:
Innovative Computational Methods for Transcriptomic Data Analysis: A Case Study in the Use of FPT for Practical Algorithm Design and Implementation.
Comput. J. 51(1): 26-38 (2008) |
| 80 | | Faisal N. Abu-Khzam,
Henning Fernau,
Michael A. Langston:
A bounded search tree algorithm for parameterized face cover.
J. Discrete Algorithms 6(4): 541-552 (2008) |
| 2007 |
|---|
| 79 | | Faisal N. Abu-Khzam,
Nagiza F. Samatova,
Mohamad A. Rizk,
Michael A. Langston:
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover.
AICCSA 2007: 367-373 |
| 78 | | Hans L. Bodlaender,
Michael R. Fellows,
Michael A. Langston,
Mark A. Ragan,
Frances A. Rosamond,
Mark Weyer:
Quadratic Kernelization for Convex Recoloring of Trees.
COCOON 2007: 86-96 |
| 77 | | Michael R. Fellows,
Michael A. Langston,
Frances A. Rosamond,
Peter Shaw:
Efficient Parameterized Preprocessing for Cluster Editing.
FCT 2007: 312-321 |
| 76 | | Michael A. Langston:
Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets.
WADS 2007: 226 |
| 75 | | Faisal N. Abu-Khzam,
Michael A. Langston:
Linear-time algorithms for problems on planar graphs with fixed disk dimension.
Inf. Process. Lett. 101(1): 36-40 (2007) |
| 74 | | Faisal N. Abu-Khzam,
Michael R. Fellows,
Michael A. Langston,
W. Henry Suters:
Crown Structures for Vertex Cover Kernelization.
Theory Comput. Syst. 41(3): 411-430 (2007) |
| 73 | | Frank K. H. A. Dehne,
Michael R. Fellows,
Michael A. Langston,
Frances A. Rosamond,
Kim Stevens:
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem.
Theory Comput. Syst. 41(3): 479-492 (2007) |
| 2006 |
|---|
| 72 |  | Hans L. Bodlaender,
Michael A. Langston:
Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings
Springer 2006 |
| 71 | | Hans L. Bodlaender,
Michael R. Fellows,
Michael A. Langston,
Mark A. Ragan,
Frances A. Rosamond,
Mark Weyer:
Kernelization for Convex Recoloring.
ACiD 2006: 23-35 |
| 70 | | Ahmed Fadiel,
Michael A. Langston,
Xinxia Peng,
Andy D. Perkins,
Hugh S. Taylor,
Ozge Tuncalp,
D. Vitello,
Paul H. Pevsner,
Frederick Naftolin:
Computational Analysis of Mass Spectrometry Data Using Novel Combinatorial Methods.
AICCSA 2006: 266-273 |
| 69 | | Frank K. H. A. Dehne,
Michael A. Langston,
Xuemei Luo,
Sylvain Pitre,
Peter Shaw,
Yun Zhang:
The Cluster Editing Problem: Implementations and Experiments.
IWPEC 2006: 13-24 |
| 68 | | Kevin Burrage,
Vladimir Estivill-Castro,
Michael R. Fellows,
Michael A. Langston,
Shev Mac,
Frances A. Rosamond:
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel.
IWPEC 2006: 192-202 |
| 67 | | Michael A. Langston,
Andy D. Perkins,
Arnold M. Saxton,
Jon A. Scharff,
Brynn H. Voy:
Innovative computational methods for transcriptomic data analysis.
SAC 2006: 190-194 |
| 66 | | Faisal N. Abu-Khzam,
Michael A. Langston,
Pushkar Shanbhag,
Christopher T. Symons:
Scalable Parallel Algorithms for FPT Problems.
Algorithmica 45(3): 269-284 (2006) |
| 65 | | Rod Downey,
Michael A. Langston,
Rolf Niedermeier:
Editorial.
Theor. Comput. Sci. 351(3): 295 (2006) |
| 2005 |
|---|
| 64 | | Vladimir Estivill-Castro,
Michael R. Fellows,
Michael A. Langston,
Frances A. Rosamond:
FPT is P-Time Extremal Structure I.
ACiD 2005: 1-41 |
| 63 | | Faisal N. Abu-Khzam,
Henning Fernau,
Michael A. Langston:
Asymptotically Faster Algorithms for Parameterized FACE COVER.
ACiD 2005: 43-58 |
| 62 | | Faisal N. Abu-Khzam,
Michael A. Langston:
Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension.
ACiD 2005: 59-67 |
| 61 | | Faisal N. Abu-Khzam,
Michael A. Langston,
W. Henry Suters:
Fast, effective vertex cover kernelization: a tale of two algorithms.
AICCSA 2005: 16 |
| 60 | | W. Henry Suters,
Faisal N. Abu-Khzam,
Yun Zhang,
Christopher T. Symons,
Nagiza F. Samatova,
Michael A. Langston:
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem.
COCOON 2005: 717-727 |
| 59 | | Frank K. H. A. Dehne,
Michael R. Fellows,
Michael A. Langston,
Frances A. Rosamond,
Kim Stevens:
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem.
COCOON 2005: 859-869 |
| 58 | | Frederick T. Sheldon,
Stephen Gordon Batsell,
Stacy J. Prowell,
Michael A. Langston:
Position Statement: Methodology to Support Dependable Survivable Cyber-Secure Infrastructures.
HICSS 2005 |
| 57 | | Yun Zhang,
Faisal N. Abu-Khzam,
Nicole E. Baldwin,
Elissa J. Chesler,
Michael A. Langston,
Nagiza F. Samatova:
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology.
SC 2005: 12 |
| 56 | | Elissa J. Chesler,
Michael A. Langston:
Combinatorial Genetic Regulatory Network Analysis Tools for High Throughput Transcriptomic Data.
Systems Biology and Regulatory Genomics 2005: 150-165 |
| 2004 |
|---|
| 55 | | Faisal N. Abu-Khzam,
Rebecca L. Collins,
Michael R. Fellows,
Michael A. Langston,
W. Henry Suters,
Christopher T. Symons:
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.
ALENEX/ANALC 2004: 62-69 |
| 54 | | Faisal N. Abu-Khzam,
Michael A. Langston:
Grid Computing: Minitrack Introduction.
HICSS 2004 |
| 53 | | Nicole E. Baldwin,
Rebecca L. Collins,
Michael A. Langston,
Christopher T. Symons,
Michael R. Leuze,
Brynn H. Voy:
High Performance Computational Tools for Motif Discovery.
IPDPS 2004 |
| 52 | | Faisal N. Abu-Khzam,
Michael A. Langston:
A Direct Algorithm for the Parameterized Face Cover Problem.
IWPEC 2004: 213-222 |
| 51 | | Michael A. Langston:
Practical FPT Implementations and Applications (Invited Talk).
IWPEC 2004: 291-292 |
| 50 | | Faisal N. Abu-Khzam,
Michael A. Langston,
Pushkar Shanbhag:
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization.
Parallel and Distributed Computing and Networks 2004: 649-654 |
| 2003 |
|---|
| 49 | | Faisal N. Abu-Khzam,
Michael A. Langston:
Graph Coloring and the Immersion Order.
COCOON 2003: 394-403 |
| 2002 |
|---|
| 48 | | Jeanne M. Lehrter,
Faisal N. Abu-Khzam,
Donald W. Bouldin,
Michael A. Langston,
Gregory D. Peterson:
On Special-purpose Hardware Clusters for High-performance Computational Grids.
IASTED PDCS 2002: 1-5 |
| 47 | | Faisal N. Abu-Khzam,
Nagiza F. Samatova,
George Ostrouchov,
Michael A. Langston,
Al Geist:
Distributed Dimension Reduction Algorithms for Widely Dispersed Data.
IASTED PDCS 2002: 167-174 |
| 2000 |
|---|
| 46 | | Kevin Cattell,
Michael J. Dinneen,
Rodney G. Downey,
Michael R. Fellows,
Michael A. Langston:
On computing graph minor obstruction sets.
Theor. Comput. Sci. 233(1-2): 107-127 (2000) |
| 1999 |
|---|
| 45 | | Heather Booth,
Rajeev Govindan,
Michael A. Langston,
Siddharthan Ramachandramurthi:
Fast Algorithms forK4Immersion Testing.
J. Algorithms 30(2): 344-378 (1999) |
| 1998 |
|---|
| 44 | | Michael A. Langston,
Barbara C. Plaut:
On algorithmic applications of the immersion order : An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory.
Discrete Mathematics 182(1-3): 191-196 (1998) |
| 43 | | Rajeev Govindan,
Michael A. Langston,
Xudong Yan:
Approximation the Pathwidth of Outerplanar Graphs.
Inf. Process. Lett. 68(1): 17-23 (1998) |
| 1997 |
|---|
| 42 | | Michael A. Langston,
Stephan Olariu,
James L. Schwing:
Parallel and Distributed Algorithms.
HICSS (1) 1997: 171 |
| 1996 |
|---|
| 41 | | Michael A. Langston:
An Introduction to the Special Issue.
Parallel Algorithms Appl. 8(1): 1-2 (1996) |
| 1994 |
|---|
| 40 | | Nancy G. Kinnersley,
Michael A. Langston:
obstruction Set Isolation for the Gate Matrix Layout Problem.
Discrete Applied Mathematics 54(2-3): 169-213 (1994) |
| 39 | | Michael R. Fellows,
Michael A. Langston:
On Search, Decision, and the Efficiency of Polynomial-Time Algorithms.
J. Comput. Syst. Sci. 49(3): 769-779 (1994) |
| 38 | | Clay P. Breshears,
Michael A. Langston:
Mimd versus Simd Computation: Experience with Non-numeric Parallel Algorithms.
Parallel Algorithms Appl. 2(1-2): 123-138 (1994) |
| 1993 |
|---|
| 37 | | Michael A. Langston:
Concurrency and Parallelism - Introduction.
ICCI 1993: 214 |
| 36 | | Rajeev Govindan,
Michael A. Langston,
Siddharthan Ramachandramurthi:
A Practical Approach to Layout Optimization.
VLSI Design 1993: 222-225 |
| 1992 |
|---|
| 35 | | Bing-Chao Huang,
Michael A. Langston:
Fast Stable Merging and Sorting in Constant Extra Space.
Comput. J. 35(6): 643-650 (1992) |
| 34 | | 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:
Small Diameter Symmetric Networks from Linear Groups.
IEEE Trans. Computers 41(2): 218-220 (1992) |
| 33 | | Xiaojun Guan,
Michael A. Langston:
Parallel Methods for Solving Fundamental File Rearrangement Problems.
J. Parallel Distrib. Comput. 14(4): 436-439 (1992) |
| 32 | | Michael R. Fellows,
Michael A. Langston:
On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design.
SIAM J. Discrete Math. 5(1): 117-126 (1992) |
| 1991 |
|---|
| 31 | | Michael R. Fellows,
Michael A. Langston:
Constructivity Issues in Graph Algorithms.
Constructivity in Computer Science 1991: 150-158 |
| 30 | | Michael A. Langston:
An obstruction-based approach to layout optimization.
Graph Structure Theory 1991: 623-630 |
| 29 | | Karl R. Abrahamson,
Michael R. Fellows,
Michael A. Langston,
Bernard M. E. Moret:
Constructive complexity.
Discrete Applied Mathematics 34(1-3): 3-16 (1991) |
| 28 | | Xiaojun Guan,
Michael A. Langston:
Time-Space Optimal Parallel Merging and Sorting.
IEEE Trans. Computers 40(5): 596-602 (1991) |
| 27 | | Bing-Chao Huang,
Michael A. Langston:
Stable Set and Multiset Operations in Optimal Time and Space.
Inf. Process. Lett. 39(3): 131-136 (1991) |
| 26 | | Donald K. Friesen,
Michael A. Langston:
Analysis of a Compound bin Packing Algorithm.
SIAM J. Discrete Math. 4(1): 61-79 (1991) |
| 1990 |
|---|
| 25 | | Michael A. Langston:
Time-Space Optimal Parallel Algorithms (Abstract).
ICCI 1990: 8 |
| 24 | | Xiaojun Guan,
Michael A. Langston:
Time-Space Optimal Parallel Set Operations.
PARBASE 1990: 155-157 |
| 23 | | Michael A. Langston,
Michael P. Morford:
Resource allocation under limited sharing.
Discrete Applied Mathematics 28(2): 135-147 (1990) |
| 1989 |
|---|
| 22 | | Michael R. Fellows,
Michael A. Langston:
An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract)
FOCS 1989: 520-525 |
| 21 | | Xiaojun Guan,
Michael A. Langston:
Time-Space Optimal Parallel Merging and Sorting.
ICPP (3) 1989: 1-8 |
| 20 | | Michael R. Fellows,
Michael A. Langston:
On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract)
STOC 1989: 501-512 |
| 19 | | Bing-Chao Huang,
Michael A. Langston:
Stable Duplicate-Key Extraction with Optimal Time and Space Bounds.
Acta Inf. 26(5): 473-484 (1989) |
| 18 | | Nancy G. Kinnersley,
Michael A. Langston:
Online variable-sized bin packing.
Discrete Applied Mathematics 22(2): 143-148 (1989) |
| 1988 |
|---|
| 17 | | Michael R. Fellows,
Michael A. Langston:
Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design.
AWOC 1988: 278-287 |
| 16 | | Bing-Chao Huang,
Michael A. Langston:
Stable Set and Multiset Operations in Optimal Time and Space.
PODS 1988: 288-293 |
| 15 | | Michael R. Fellows,
Donald K. Friesen,
Michael A. Langston:
On Finding Optimal and Near-Optimal Lineal Spanning Trees.
Algorithmica 3: 549-560 (1988) |
| 14 | | Ivan Stojmenovic,
Michael A. Langston:
On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm.
BIT 28(4): 785-789 (1988) |
| 13 | | Bing-Chao Huang,
Michael A. Langston:
Practical In-Place Merging.
Commun. ACM 31(3): 348-352 (1988) |
| 12 | | Michael R. Fellows,
Michael A. Langston:
Processor Utilization in a Linearly Connected Parallel Processing System.
IEEE Trans. Computers 37(5): 594-603 (1988) |
| 11 | | Michael R. Fellows,
Michael A. Langston:
Nonconstructive tools for proving polynomial-time decidability.
J. ACM 35(3): 727-739 (1988) |
| 10 | | Manfred Kunde,
Michael A. Langston,
Jin-Ming Liu:
On a Special Case of Uniform Processor Scheduling.
J. Algorithms 9(2): 287-296 (1988) |
| 1987 |
|---|
| 9 | | Donald K. Friesen,
Michael A. Langston:
Bin Packing: On Optimizing the Number of Pieces Packed.
BIT 27(2): 148-156 (1987) |
| 8 | | Narsingh Deo,
Mukkai S. Krishnamoorthy,
Michael A. Langston:
Exact and Approximate Solutions for the Gate Matrix Layout Problem.
IEEE Trans. on CAD of Integrated Circuits and Systems 6(1): 79-84 (1987) |
| 7 | | Michael R. Fellows,
Michael A. Langston:
Nonconstructive Advances in Polynomial-Time Complexity.
Inf. Process. Lett. 26(3): 155-162 (1987) |
| 1986 |
|---|
| 6 | | Donald K. Friesen,
Michael A. Langston:
Evaluation of a MULTIFIT-Based Scheduling Algorithm.
J. Algorithms 7(1): 35-59 (1986) |
| 5 | | Donald K. Friesen,
Michael A. Langston:
Variable Sized Bin Packing.
SIAM J. Comput. 15(1): 222-230 (1986) |
| 1984 |
|---|
| 4 | | Edward G. Coffman Jr.,
Michael A. Langston:
A Performance Guarantee for the Greedy Set-Partitioning Algorithm.
Acta Inf. 21: 409-415 (1984) |
| 3 | | Donald K. Friesen,
Michael A. Langston:
A Storage-Size Selection Problem.
Inf. Process. Lett. 18(5): 295-296 (1984) |
| 1983 |
|---|
| 2 | | Donald K. Friesen,
Michael A. Langston:
Bounds for Multifit Scheduling on Uniform Processors.
SIAM J. Comput. 12(1): 60-70 (1983) |
| 1982 |
|---|
| 1 | | Michael A. Langston:
Improved 0/1-Interchange Scheduling.
BIT 22(3): 282-290 (1982) |
