Faisal N. Abu-Khzam
Faisal N. Abu-Khzam
Professor of Computer Science, Lebanese American University
Verified email at - Homepage
Cited by
Cited by
Kernelization algorithms for the vertex cover problem
FN Abu-Khzam, RL Collins, MR Fellows, MA Langston, WH Suters, ...
A kernelization algorithm for d-hitting set
FN Abu-Khzam
Journal of Computer and System Sciences 76 (7), 524-531, 2010
Scalable parallel algorithms for FPT problems
FN Abu-Khzam, MA Langston, P Shanbhag, CT Symons
Algorithmica 45 (3), 269-284, 2006
Genome-scale computational approaches to memory-intensive applications in systems biology
Y Zhang, FN Abu-Khzam, NE Baldwin, EJ Chesler, MA Langston, ...
SC'05: Proceedings of the 2005 ACM/IEEE Conference on Supercomputing, 12-12, 2005
Crown structures for vertex cover kernelization
FN Abu-Khzam, MR Fellows, MA Langston, WH Suters
Theory of Computing Systems 41 (3), 411-430, 2007
Graph coloring and the immersion order
FN Abu-Khzam, MA Langston
International Computing and Combinatorics Conference, 394-403, 2003
The maximum common subgraph problem: Faster solutions via vertex cover
FN Abu-Khzam, NF Samatova, MA Rizk, MA Langston
2007 IEEE/ACS International Conference on Computer Systems and Applications …, 2007
Kernelization algorithms for d-hitting set problems
FN Abu-Khzam
Workshop on Algorithms and Data Structures, 434-445, 2007
On the relative efficiency of maximal clique enumeration algorithms, with applications to high-throughput computational biology
FN Abu-Khzam, NE Baldwin, MA Langston, NF Samatova
International Conference on Research Trends in Science and Technology, 2005
Kernels: Annotated, proper and induced
FN Abu-Khzam, H Fernau
International Workshop on Parameterized and Exact Computation, 264-275, 2006
A new approach and faster exact methods for the maximum common subgraph problem
WH Suters, FN Abu-Khzam, Y Zhang, CT Symons, NF Samatova, ...
International Computing and Combinatorics Conference, 717-727, 2005
An exact algorithm for connected red–blue dominating set
FN Abu-Khzam, AE Mouawad, M Liedloff
Journal of Discrete Algorithms 9 (3), 252-262, 2011
Fast, effective vertex cover kernelization: a tale of two algorithms
FN Abu-Khzam, MA Langston, WH Suters
The 3rd ACS/IEEE International Conference onComputer Systems and …, 2005
On the complexity of multi-parameterized cluster editing
FN Abu-Khzam
Journal of Discrete Algorithms 45, 26-34, 2017
An improved kernelization algorithm for r-Set Packing
FN Abu-Khzam
Information Processing Letters 110 (16), 621-624, 2010
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization.
FN Abu-Khzam, MA Langston, P Shanbhag
Parallel and Distributed Computing and Networks, 649-654, 2004
On the parameterized complexity of dynamic problems
FN Abu-Khzam, J Egan, MR Fellows, FA Rosamond, P Shaw
Theoretical Computer Science 607, 426-434, 2015
On scalable parallel recursive backtracking
FN Abu-Khzam, K Daudjee, AE Mouawad, N Nishimura
Journal of Parallel and Distributed Computing 84, 65-75, 2015
Distributed Dimension Reduction Algorithms for Widely Dispersed Data.
FN Abu-Khzam, NF Samatova, G Ostrouchov, MA Langston, A Geist
IASTED PDCS, 167-174, 2002
Topics in graph algorithms
FN Abu-Khzam
University of Tennessee, 2003
The system can't perform the operation now. Try again later.
Articles 1–20