| 2008 |
|---|
| 22 | EE | 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 |
|---|
| 21 | EE | 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 |
| 20 | EE | Faisal N. Abu-Khzam,
Mohamad A. Rizk,
Deema A. Abdallah,
Nagiza F. Samatova:
The Buffered Work-Pool Approach for Search-Tree Based Optimization Algorithms.
PPAM 2007: 170-179 |
| 19 | EE | Faisal N. Abu-Khzam:
Kernelization Algorithms for d-Hitting Set Problems.
WADS 2007: 434-445 |
| 18 | EE | 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) |
| 17 | EE | Faisal N. Abu-Khzam:
Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems.
Theory Comput. Syst. 41(3): 399-410 (2007) |
| 16 | EE | 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) |
| 2006 |
|---|
| 15 | EE | Faisal N. Abu-Khzam,
Henning Fernau:
Kernels: Annotated, Proper and Induced.
IWPEC 2006: 264-275 |
| 14 | EE | Faisal N. Abu-Khzam,
Michael A. Langston,
Pushkar Shanbhag,
Christopher T. Symons:
Scalable Parallel Algorithms for FPT Problems.
Algorithmica 45(3): 269-284 (2006) |
| 13 | EE | Faisal N. Abu-Khzam,
Henning Fernau:
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs.
Electronic Notes in Discrete Mathematics 25: 1-6 (2006) |
| 2005 |
|---|
| 12 | | Faisal N. Abu-Khzam,
Henning Fernau,
Michael A. Langston:
Asymptotically Faster Algorithms for Parameterized FACE COVER.
ACiD 2005: 43-58 |
| 11 | | Faisal N. Abu-Khzam,
Michael A. Langston:
Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension.
ACiD 2005: 59-67 |
| 10 | EE | Faisal N. Abu-Khzam,
Michael A. Langston,
W. Henry Suters:
Fast, effective vertex cover kernelization: a tale of two algorithms.
AICCSA 2005: 16 |
| 9 | EE | 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 |
| 8 | EE | 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 |
|---|
| 7 | | 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 |
| 6 | EE | Faisal N. Abu-Khzam,
Michael A. Langston:
Grid Computing: Minitrack Introduction.
HICSS 2004 |
| 5 | EE | Faisal N. Abu-Khzam,
Michael A. Langston:
A Direct Algorithm for the Parameterized Face Cover Problem.
IWPEC 2004: 213-222 |
| 4 | | 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 |
|---|
| 3 | EE | Faisal N. Abu-Khzam,
Michael A. Langston:
Graph Coloring and the Immersion Order.
COCOON 2003: 394-403 |
| 2002 |
|---|
| 2 | | 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 |
| 1 | | 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 |
