The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michael A. Langston: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bing-Chao Huang, Michael A. Langston
    Practical In-Place Merging. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1988, v:31, n:3, pp:348-352 [Journal]
  2. Bing-Chao Huang, Michael A. Langston
    Stable Duplicate-Key Extraction with Optimal Time and Space Bounds. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1989, v:26, n:5, pp:473-484 [Journal]
  3. Michael R. Fellows, Michael A. Langston
    Nonconstructive Advances in Polynomial-Time Complexity. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:3, pp:155-162 [Journal]
  4. Michael R. Fellows, Michael A. Langston
    Nonconstructive tools for proving polynomial-time decidability. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:727-739 [Journal]
  5. Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston
    Asymptotically Faster Algorithms for Parameterized FACE COVER. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:43-58 [Conf]
  6. Faisal N. Abu-Khzam, Michael A. Langston
    Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:59-67 [Conf]
  7. Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Kernelization for Convex Recoloring. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:23-35 [Conf]
  8. Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond
    FPT is P-Time Extremal Structure I. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:1-41 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:62-69 [Conf]
  10. Michael R. Fellows, Michael A. Langston
    Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:278-287 [Conf]
  11. Faisal N. Abu-Khzam, Michael A. Langston
    Graph Coloring and the Immersion Order. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:394-403 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:859-869 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:717-727 [Conf]
  14. Michael R. Fellows, Michael A. Langston
    Constructivity Issues in Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    Constructivity in Computer Science, 1991, pp:150-158 [Conf]
  15. Michael R. Fellows, Michael A. Langston
    An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:520-525 [Conf]
  16. Michael A. Langston
    An obstruction-based approach to layout optimization. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:623-630 [Conf]
  17. Faisal N. Abu-Khzam, Michael A. Langston
    Grid Computing: Minitrack Introduction. [Citation Graph (0, 0)][DBLP]
    HICSS, 2004, pp:- [Conf]
  18. Michael A. Langston, Stephan Olariu, James L. Schwing
    Parallel and Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1997, pp:171- [Conf]
  19. Frederick T. Sheldon, Stephen Gordon Batsell, Stacy J. Prowell, Michael A. Langston
    Position Statement: Methodology to Support Dependable Survivable Cyber-Secure Infrastructures. [Citation Graph (0, 0)][DBLP]
    HICSS, 2005, pp:- [Conf]
  20. Michael A. Langston
    Time-Space Optimal Parallel Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    ICCI, 1990, pp:8- [Conf]
  21. Michael A. Langston
    Concurrency and Parallelism - Introduction. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:214- [Conf]
  22. Xiajun Guan, Michael A. Langston
    Time-Space Optimal Parallel Merging and Sorting. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1989, pp:1-8 [Conf]
  23. 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. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  24. Faisal N. Abu-Khzam, Michael A. Langston
    A Direct Algorithm for the Parameterized Face Cover Problem. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:213-222 [Conf]
  25. 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. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:192-202 [Conf]
  26. Frank K. H. A. Dehne, Michael A. Langston, Xuemei Luo, Sylvain Pitre, Peter Shaw, Yun Zhang
    The Cluster Editing Problem: Implementations and Experiments. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:13-24 [Conf]
  27. Michael A. Langston
    Practical FPT Implementations and Applications (Invited Talk). [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:291-292 [Conf]
  28. Xiaojun Guan, Michael A. Langston
    Time-Space Optimal Parallel Set Operations. [Citation Graph (0, 0)][DBLP]
    PARBASE, 1990, pp:155-157 [Conf]
  29. Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag
    Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Networks, 2004, pp:649-654 [Conf]
  30. Faisal N. Abu-Khzam, Nagiza F. Samatova, George Ostrouchov, Michael A. Langston, Al Geist
    Distributed Dimension Reduction Algorithms for Widely Dispersed Data. [Citation Graph (0, 0)][DBLP]
    IASTED PDCS, 2002, pp:167-174 [Conf]
  31. 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. [Citation Graph (0, 0)][DBLP]
    IASTED PDCS, 2002, pp:1-5 [Conf]
  32. Bing-Chao Huang, Michael A. Langston
    Stable Set and Multiset Operations in Optimal Time and Space. [Citation Graph (0, 7)][DBLP]
    PODS, 1988, pp:288-293 [Conf]
  33. Michael A. Langston, Andy D. Perkins, Arnold M. Saxton, Jon A. Scharff, Brynn H. Voy
    Innovative computational methods for transcriptomic data analysis. [Citation Graph (0, 0)][DBLP]
    SAC, 2006, pp:190-194 [Conf]
  34. 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. [Citation Graph (0, 0)][DBLP]
    SC, 2005, pp:12- [Conf]
  35. Michael R. Fellows, Michael A. Langston
    On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:501-512 [Conf]
  36. Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi
    A Practical Approach to Layout Optimization. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1993, pp:222-225 [Conf]
  37. Edward G. Coffman Jr., Michael A. Langston
    A Performance Guarantee for the Greedy Set-Partitioning Algorithm. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:409-415 [Journal]
  38. Michael R. Fellows, Donald K. Friesen, Michael A. Langston
    On Finding Optimal and Near-Optimal Lineal Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:549-560 [Journal]
  39. Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons
    Scalable Parallel Algorithms for FPT Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:3, pp:269-284 [Journal]
  40. Donald K. Friesen, Michael A. Langston
    Bin Packing: On Optimizing the Number of Pieces Packed. [Citation Graph (0, 0)][DBLP]
    BIT, 1987, v:27, n:2, pp:148-156 [Journal]
  41. Michael A. Langston
    Improved 0/1-Interchange Scheduling. [Citation Graph (0, 0)][DBLP]
    BIT, 1982, v:22, n:3, pp:282-290 [Journal]
  42. Ivan Stojmenovic, Michael A. Langston
    On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP]
    BIT, 1988, v:28, n:4, pp:785-789 [Journal]
  43. Bing-Chao Huang, Michael A. Langston
    Fast Stable Merging and Sorting in Constant Extra Space. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1992, v:35, n:6, pp:643-650 [Journal]
  44. Nancy G. Kinnersley, Michael A. Langston
    obstruction Set Isolation for the Gate Matrix Layout Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:2-3, pp:169-213 [Journal]
  45. Donald K. Friesen, Michael A. Langston
    A Storage-Size Selection Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:5, pp:295-296 [Journal]
  46. Rajeev Govindan, Michael A. Langston, Xudong Yan
    Approximation the Pathwidth of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:1, pp:17-23 [Journal]
  47. Bing-Chao Huang, Michael A. Langston
    Stable Set and Multiset Operations in Optimal Time and Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:3, pp:131-136 [Journal]
  48. Faisal N. Abu-Khzam, Michael A. Langston
    Linear-time algorithms for problems on planar graphs with fixed disk dimension. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:1, pp:36-40 [Journal]
  49. Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi
    Fast Algorithms forK4Immersion Testing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:2, pp:344-378 [Journal]
  50. Donald K. Friesen, Michael A. Langston
    Evaluation of a MULTIFIT-Based Scheduling Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:1, pp:35-59 [Journal]
  51. Manfred Kunde, Michael A. Langston, Jin-Ming Liu
    On a Special Case of Uniform Processor Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:2, pp:287-296 [Journal]
  52. Michael R. Fellows, Michael A. Langston
    On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:3, pp:769-779 [Journal]
  53. Xiaojun Guan, Michael A. Langston
    Parallel Methods for Solving Fundamental File Rearrangement Problems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1992, v:14, n:4, pp:436-439 [Journal]
  54. Donald K. Friesen, Michael A. Langston
    Bounds for Multifit Scheduling on Uniform Processors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:60-70 [Journal]
  55. Donald K. Friesen, Michael A. Langston
    Variable Sized Bin Packing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:222-230 [Journal]
  56. Michael R. Fellows, Michael A. Langston
    On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:117-126 [Journal]
  57. Donald K. Friesen, Michael A. Langston
    Analysis of a Compound bin Packing Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:61-79 [Journal]
  58. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:2, pp:218-220 [Journal]
  59. Michael R. Fellows, Michael A. Langston
    Processor Utilization in a Linearly Connected Parallel Processing System. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:5, pp:594-603 [Journal]
  60. Xiaojun Guan, Michael A. Langston
    Time-Space Optimal Parallel Merging and Sorting. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:5, pp:596-602 [Journal]
  61. Narsingh Deo, Mukkai S. Krishnamoorthy, Michael A. Langston
    Exact and Approximate Solutions for the Gate Matrix Layout Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1987, v:6, n:1, pp:79-84 [Journal]
  62. Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
    On computing graph minor obstruction sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:107-127 [Journal]
  63. Rod Downey, Michael A. Langston, Rolf Niedermeier
    Editorial. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:295- [Journal]
  64. Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A. Rizk, Michael A. Langston
    The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover. [Citation Graph (0, 0)][DBLP]
    AICCSA, 2007, pp:367-373 [Conf]
  65. Faisal N. Abu-Khzam, Michael A. Langston, W. Henry Suters
    Fast, effective vertex cover kernelization: a tale of two algorithms. [Citation Graph (0, 0)][DBLP]
    AICCSA, 2005, pp:16- [Conf]
  66. Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Quadratic Kernelization for Convex Recoloring of Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:86-96 [Conf]
  67. Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw
    Efficient Parameterized Preprocessing for Cluster Editing. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:312-321 [Conf]
  68. Elissa J. Chesler, Michael A. Langston
    Combinatorial Genetic Regulatory Network Analysis Tools for High Throughput Transcriptomic Data. [Citation Graph (0, 0)][DBLP]
    Systems Biology and Regulatory Genomics, 2005, pp:150-165 [Conf]
  69. Michael A. Langston
    Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:226- [Conf]
  70. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:191-196 [Journal]

  71. Computational Analysis of Mass Spectrometry Data Using Novel Combinatorial Methods. [Citation Graph (, )][DBLP]


  72. A Hybrid Graph Representation for Recursive Backtracking Algorithms. [Citation Graph (, )][DBLP]


  73. Threshold selection in gene co-expression networks using spectral graph theory techniques. [Citation Graph (, )][DBLP]


  74. Innovative Computational Methods for Transcriptomic Data Analysis: A Case Study in the Use of FPT for Practical Algorithm Design and Implementation. [Citation Graph (, )][DBLP]


  75. The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. [Citation Graph (, )][DBLP]


  76. Constructive complexity. [Citation Graph (, )][DBLP]


  77. Online variable-sized bin packing. [Citation Graph (, )][DBLP]


  78. Resource allocation under limited sharing. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.492secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002