default search action
Michael A. Langston
- > Home > Persons > Michael A. Langston
Publications
- 2012
- [j56]Faisal N. Abu-Khzam, Michael A. Langston:
Immersion Containment and Connectivity in Color-Critical Graphs. Discret. Math. Theor. Comput. Sci. 14(2): 155-164 (2012) - [c53]Faisal N. Abu-Khzam, Michael A. Langston:
Almost Exact Graph 3-Coloring in O(1.277^n) Time. CTW 2012: 1-4 - 2011
- [j53]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. Discret. Optim. 8(1): 41-49 (2011) - 2010
- [c48]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 - [c47]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 - 2009
- [c46]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
- [j44]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
- [j43]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) - [j42]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) - [c45]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 - 2006
- [j40]Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons:
Scalable Parallel Algorithms for FPT Problems. Algorithmica 45(3): 269-284 (2006) - 2005
- [c35]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston:
Asymptotically Faster Algorithms for Parameterized FACE COVER. ACiD 2005: 43-58 - [c34]Faisal N. Abu-Khzam, Michael A. Langston:
Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension. ACiD 2005: 59-67 - [c33]Faisal N. Abu-Khzam, Michael A. Langston, W. Henry Suters:
Fast, effective vertex cover kernelization: a tale of two algorithms. AICCSA 2005: 16 - [c32]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 - [c28]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
- [c27]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 - [c26]Faisal N. Abu-Khzam, Michael A. Langston:
Grid Computing: Minitrack Introduction. HICSS 2004 - [c24]Faisal N. Abu-Khzam, Michael A. Langston:
A Direct Algorithm for the Parameterized Face Cover Problem. IWPEC 2004: 213-222 - [c22]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
- [c21]Faisal N. Abu-Khzam, Michael A. Langston:
Graph Coloring and the Immersion Order. COCOON 2003: 394-403 - 2002
- [c20]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 - [c19]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint