Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael A. Langston
2010 – today
- 2012
[j54]John D. Eblen, Charles A. Phillips, Gary L. Rogers, Michael A. Langston: The maximum clique enumeration problem: algorithms, applications, and implementations. BMC Bioinformatics 13(S-10): S5 (2012)- [j53]Jeremy J. Jay, John D. Eblen, Yun Zhang, Mikael Benson, Andy D. Perkins, Arnold M. Saxton, Brynn H. Voy, Elissa J. Chesler, Michael A. Langston: A systematic comparison of genome-scale clustering algorithms. BMC Bioinformatics 13(S-10): S7 (2012)
- [j52]Faisal N. Abu-Khzam, Michael A. Langston: Immersion Containment and Connectivity in Color-Critical Graphs. Discrete Mathematics & Theoretical Computer Science 14(2): 155-164 (2012)
- [j51]Erich J. Baker, Jeremy J. Jay, Jason A. Bubier, Michael A. Langston, Elissa J. Chesler: GeneWeaver: a web-based system for integrative functional genomics. Nucleic Acids Research 40(Database-Issue): 1067-1076 (2012)
- [c50]Michael A. Langston: Fixed-Parameter Tractability, A Prehistory, . The Multivariate Algorithmic Revolution and Beyond 2012: 3-16
- [c49]Faisal N. Abu-Khzam, Michael A. Langston: Almost Exact Graph 3-Coloring in O(1.277^n) Time. CTW 2012: 1-4
- [c48]Charles A. Phillips, Jeremy J. Jay, Erich J. Baker, Elissa J. Chesler, Michael A. Langston: On Bipartite Graph Decomposition in the Presence of Noise, with Applications to Biological Data Clustering. CTW 2012: 215-219
- 2011
- [j50]Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Quadratic Kernelization for Convex Recoloring of Trees. Algorithmica 61(2): 362-388 (2011)
- [j49]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege: Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. Discrete Optimization 8(1): 41-49 (2011)
- [c47]John D. Eblen, Charles A. Phillips, Gary L. Rogers, Michael A. Langston: The Maximum Clique Enumeration Problem: Algorithms, Applications and Implementations. ISBRA 2011: 306-319
- [c46]Jeremy J. Jay, John D. Eblen, Yun Zhang, Mikael Benson, Andy D. Perkins, Arnold M. Saxton, Brynn H. Voy, Elissa J. Chesler, Michael A. Langston: A Systematic Comparison of Genome Scale Clustering Algorithms - (Extended Abstract). ISBRA 2011: 416-427
- [c45]Jennifer Debroni, John D. Eblen, Michael A. Langston, Wendy Myrvold, Peter W. Shor, Dinesh Weerapurage: A complete resolution of the Keller maximum clique problem. SODA 2011: 129-135
- 2010
- [j48]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: Inferring gene coexpression networks for low dose ionizing radiation using graph theoretical algorithms and systems genetics. BMC Bioinformatics 11(S-4): O5 (2010)
- [j47]Gary L. Rogers, Pablo Moscato, Michael A. Langston: Graph algorithms for machine learning: a case-control study based on prostate cancer populations and high throughput transcriptomic data. BMC Bioinformatics 11(S-4): P21 (2010)
- [j46]Sally R. Ellingson, Charles A. Phillips, Randy Glenn, Douglas Swanson, Thomas Ha, Daniel Goldowitz, Michael A. Langston: Serendipitous discoveries in microarray analysis. BMC Bioinformatics 11(S-4): P24 (2010)
- [c44]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege: A Fixed-Parameter Algorithm for String-to-String Correction. CATS 2010: 31-38
- [c43]Faisal N. Abu-Khzam, Michael A. Langston, Amer E. Mouawad, Clinton P. Nolan: A Hybrid Graph Representation for Recursive Backtracking Algorithms. FAW 2010: 136-147
2000 – 2009
- 2009
- [j45]Andy D. Perkins, Michael A. Langston: Threshold selection in gene co-expression networks using spectral graph theory techniques. BMC Bioinformatics 10(S-11): 4 (2009)
- [j44]Mingzhou (Joe) Song, Chris K. Lewis, Eric R. Lance, Elissa J. Chesler, Roumyana Kirova Yordanova, Michael A. Langston, Kerrie H. Lodowski, Susan E. Bergeson: Reconstructing Generalized Logical Networks of Transcriptional Regulation in Mouse Brain from Temporal Gene Expression Data. EURASIP J. Bioinformatics and Systems Biology 2009 (2009)
- [c42]Gary L. Rogers, Andy D. Perkins, Charles A. Phillips, John D. Eblen, Faisal N. Abu-Khzam, Michael A. Langston: Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs. AICCSA 2009: 374-381
- 2008
- [j43]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)
- [j42]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)
- [j41]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
- [j40]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)
- [j39]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)
- [j38]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)
- [c41]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
- [c40]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
- [c39]Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw: Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321
- [c38]Michael A. Langston: Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets. WADS 2007: 226
- 2006
- [j37]Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons: Scalable Parallel Algorithms for FPT Problems. Algorithmica 45(3): 269-284 (2006)
- [j36]Brynn H. Voy, Jon A. Scharff, Andy D. Perkins, Arnold M. Saxton, Bhavesh Borate, Elissa J. Chesler, Lisa K. Branstetter, Michael A. Langston: Extracting Gene Networks for Low-Dose Radiation Using Graph Theoretical Algorithms. PLoS Computational Biology 2(7) (2006)
- [j35]Rod Downey, Michael A. Langston, Rolf Niedermeier: Editorial. Theor. Comput. Sci. 351(3): 295 (2006)
- [c37]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
- [c36]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
- [c35]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
- [c34]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
- [c33]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
- [e1]Hans L. Bodlaender, Michael A. Langston (Eds.): Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings. Lecture Notes in Computer Science 4169, Springer 2006, ISBN 3-540-39098-7
- 2005
- [c32]Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond: FPT is P-Time Extremal Structure I. ACiD 2005: 1-41
- [c31]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston: Asymptotically Faster Algorithms for Parameterized FACE COVER. ACiD 2005: 43-58
- [c30]Faisal N. Abu-Khzam, Michael A. Langston: Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension. ACiD 2005: 59-67
- [c29]Faisal N. Abu-Khzam, Michael A. Langston, W. Henry Suters: Fast, effective vertex cover kernelization: a tale of two algorithms. AICCSA 2005: 16
- [c28]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
- [c27]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
- [c26]Frederick T. Sheldon, Stephen Gordon Batsell, Stacy J. Prowell, Michael A. Langston: Position Statement: Methodology to Support Dependable Survivable Cyber-Secure Infrastructures. HICSS 2005
- [c25]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
- [c24]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
- 2004
- [c23]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
- [c22]
- [c21]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
- [c20]Faisal N. Abu-Khzam, Michael A. Langston: A Direct Algorithm for the Parameterized Face Cover Problem. IWPEC 2004: 213-222
- [c19]Michael A. Langston: Practical FPT Implementations and Applications (Invited Talk). IWPEC 2004: 291-292
- [c18]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
- [c17]Faisal N. Abu-Khzam, Michael A. Langston: Graph Coloring and the Immersion Order. COCOON 2003: 394-403
- 2002
- [c16]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
- [c15]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
- 2001
- [c14]Sze-Wei Ong, Nabil Kerkiz, Bernadeta Srijanto, Chandra Tan, Michael A. Langston, Danny Newport, Donald W. Bouldin: Automatic Mapping of Multiple Applications to Multiple Adaptive Computing Systems. FCCM 2001: 10-20
- 2000
- [j34]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)
1990 – 1999
- 1999
- [j33]Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi: Fast Algorithms forK4Immersion Testing. J. Algorithms 30(2): 344-378 (1999)
- 1998
- [j32]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)
- [j31]Rajeev Govindan, Michael A. Langston, Xudong Yan: Approximation the Pathwidth of Outerplanar Graphs. Inf. Process. Lett. 68(1): 17-23 (1998)
- 1997
- [c13]Michael A. Langston, Stephan Olariu, James L. Schwing: Parallel and Distributed Algorithms. HICSS (1) 1997: 171
- 1996
- [j30]Michael A. Langston: An Introduction to the Special Issue. Parallel Algorithms Appl. 8(1): 1-2 (1996)
- 1995
- [c12]Clay P. Breshears, Michael A. Langston: Parallel Benchmarks and Comparison-Based Computing. PARCO 1995: 581-584
- 1994
- [j29]Nancy G. Kinnersley, Michael A. Langston: obstruction Set Isolation for the Gate Matrix Layout Problem. Discrete Applied Mathematics 54(2-3): 169-213 (1994)
- [j28]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)
- [j27]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
- [c11]
- [c10]Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi: A Practical Approach to Layout Optimization. VLSI Design 1993: 222-225
- 1992
- [j26]Bing-Chao Huang, Michael A. Langston: Fast Stable Merging and Sorting in Constant Extra Space. Comput. J. 35(6): 643-650 (1992)
- [j25]Xiaojun Guan, Michael A. Langston: Parallel Methods for Solving Fundamental File Rearrangement Problems. J. Parallel Distrib. Comput. 14(4): 436-439 (1992)
- [j24]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)
- [j23]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)
- 1991
- [j22]Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret: Constructive complexity. Discrete Applied Mathematics 34(1-3): 3-16 (1991)
- [j21]Bing-Chao Huang, Michael A. Langston: Stable Set and Multiset Operations in Optimal Time and Space. Inf. Process. Lett. 39(3): 131-136 (1991)
- [j20]Donald K. Friesen, Michael A. Langston: Analysis of a Compound bin Packing Algorithm. SIAM J. Discrete Math. 4(1): 61-79 (1991)
- [j19]Xiaojun Guan, Michael A. Langston: Time-Space Optimal Parallel Merging and Sorting. IEEE Trans. Computers 40(5): 596-602 (1991)
- [c9]Michael R. Fellows, Michael A. Langston: Constructivity Issues in Graph Algorithms. Constructivity in Computer Science 1991: 150-158
- [c8]Michael A. Langston: An obstruction-based approach to layout optimization. Graph Structure Theory 1991: 623-630
- 1990
- [j18]Michael A. Langston, Michael P. Morford: Resource allocation under limited sharing. Discrete Applied Mathematics 28(2): 135-147 (1990)
- [c7]
- [c6]Xiaojun Guan, Michael A. Langston: Time-Space Optimal Parallel Set Operations. PARBASE 1990: 155-157
1980 – 1989
- 1989
- [j17]Bing-Chao Huang, Michael A. Langston: Stable Duplicate-Key Extraction with Optimal Time and Space Bounds. Acta Inf. 26(5): 473-484 (1989)
- [j16]Nancy G. Kinnersley, Michael A. Langston: Online variable-sized bin packing. Discrete Applied Mathematics 22(2): 143-148 (1989)
- [c5]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
- [c4]Xiaojun Guan, Michael A. Langston: Time-Space Optimal Parallel Merging and Sorting. ICPP (3) 1989: 1-8
- [c3]Michael R. Fellows, Michael A. Langston: On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract). STOC 1989: 501-512
- 1988
- [j15]Michael R. Fellows, Donald K. Friesen, Michael A. Langston: On Finding Optimal and Near-Optimal Lineal Spanning Trees. Algorithmica 3: 549-560 (1988)
- [j14]Ivan Stojmenovic, Michael A. Langston: On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm. BIT 28(4): 785-789 (1988)
- [j13]
- [j12]Michael R. Fellows, Michael A. Langston: Nonconstructive tools for proving polynomial-time decidability. J. ACM 35(3): 727-739 (1988)
- [j11]Manfred Kunde, Michael A. Langston, Jin-Ming Liu: On a Special Case of Uniform Processor Scheduling. J. Algorithms 9(2): 287-296 (1988)
- [j10]Michael R. Fellows, Michael A. Langston: Processor Utilization in a Linearly Connected Parallel Processing System. IEEE Trans. Computers 37(5): 594-603 (1988)
- [c2]Michael R. Fellows, Michael A. Langston: Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. AWOC 1988: 278-287
- [c1]Bing-Chao Huang, Michael A. Langston: Stable Set and Multiset Operations in Optimal Time and Space. PODS 1988: 288-293
- 1987
- [j9]Donald K. Friesen, Michael A. Langston: Bin Packing: On Optimizing the Number of Pieces Packed. BIT 27(2): 148-156 (1987)
- [j8]Michael R. Fellows, Michael A. Langston: Nonconstructive Advances in Polynomial-Time Complexity. Inf. Process. Lett. 26(3): 155-162 (1987)
- [j7]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)
- 1986
- [j6]Donald K. Friesen, Michael A. Langston: Evaluation of a MULTIFIT-Based Scheduling Algorithm. J. Algorithms 7(1): 35-59 (1986)
- [j5]Donald K. Friesen, Michael A. Langston: Variable Sized Bin Packing. SIAM J. Comput. 15(1): 222-230 (1986)
- 1984
- [j4]Edward G. Coffman Jr., Michael A. Langston: A Performance Guarantee for the Greedy Set-Partitioning Algorithm. Acta Inf. 21: 409-415 (1984)
- [j3]Donald K. Friesen, Michael A. Langston: A Storage-Size Selection Problem. Inf. Process. Lett. 18(5): 295-296 (1984)
- 1983
- [j2]Donald K. Friesen, Michael A. Langston: Bounds for Multifit Scheduling on Uniform Processors. SIAM J. Comput. 12(1): 60-70 (1983)
- 1982
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-29 22:26 CEST by the dblp team