default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFaisal N. Abu-Khzam
Person information
- affiliation: Lebanese American University, Beirut, Lebanon
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j30]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Minimal Roman Dominating Functions: Extensions and Enumeration. Algorithmica 86(6): 1862-1887 (2024)- [i23]Faisal N. Abu-Khzam, Ghinwa Bou Matar, Sergio Thoumi:
Pack and Measure: An Effective Approach for Influence Propagation in Social Networks. CoRR abs/2401.00525 (2024) - [i22]Mahmoud Salhab, Faisal N. Abu-Khzam:
AraSpell: A Deep Learning Approach for Arabic Spelling Correction. CoRR abs/2405.06981 (2024) - [i21]Faisal N. Abu-Khzam, Lucas Isenmann:
Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter. CoRR abs/2408.08418 (2024) - 2023
- [j29]Ola N. Halawi
, Faisal N. Abu-Khzam, Sergio Thoumi:
A Multi-Objective Degree-Based Network Anonymization Method. Algorithms 16(9): 436 (2023) - [j28]Faisal N. Abu-Khzam, Norma Makarem, Maryam Shehab:
An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion. Theor. Comput. Sci. 958: 113864 (2023) - [c48]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. MFCS 2023: 6:1-6:15 - [i20]Mahabba El Sahili, Faisal N. Abu-Khzam:
A Linear Kernel for Planar Vector Domination. CoRR abs/2312.09374 (2023) - 2022
- [j27]Faisal N. Abu-Khzam:
An improved exact algorithm for minimum dominating set in chordal graphs. Inf. Process. Lett. 174: 106206 (2022) - [c47]Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann:
Enumerating Minimal Connected Dominating Sets. ESA 2022: 1:1-1:15 - [c46]Peter Shaw, Joseph R. Barr, Faisal N. Abu-Khzam:
Anomaly Detection via Correlation Clustering. ICSC 2022: 307-313 - [c45]Joseph R. Barr, Peter Shaw, Faisal N. Abu-Khzam, Tyler Thatcher, Toby Dylan Hocking:
Graph Embedding: A Methodological Survey. TransAI 2022: 142-148 - [c44]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Minimal Roman Dominating Functions: Extensions and Enumeration. WG 2022: 1-15 - [p1]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. Algorithms for Big Data 2022: 97-133 - [i19]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Minimal Roman Dominating Functions: Extensions and Enumeration. CoRR abs/2204.04765 (2022) - [i18]Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann:
Enumerating Connected Dominating Sets. CoRR abs/2205.00086 (2022) - [i17]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. CoRR abs/2208.05261 (2022) - 2021
- [c43]Faisal N. Abu-Khzam, Joseph R. Barr, Amin Fakhereldine, Peter Shaw:
A Greedy Heuristic for Cluster Editing with Vertex Splitting. AI4I 2021: 38-41 - [i16]Faisal N. Abu-Khzam, Norma Makarem, Maryam Shehab:
An Improved Fixed-Parameter Algorithm for 2-Club Cluster Edge Deletion. CoRR abs/2107.01133 (2021) - [i15]Faisal N. Abu-Khzam:
A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph. CoRR abs/2111.06026 (2021) - [i14]Ola N. Halawi, Faisal N. Abu-Khzam:
A Multi-Objective Degree-Based Network Anonymization Approach. CoRR abs/2112.12315 (2021) - 2020
- [j26]Faisal N. Abu-Khzam, Karam Al Kontar:
A Brief Survey of Fixed-Parameter Parallelism. Algorithms 13(8): 197 (2020) - [j25]Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes:
Partitioning a graph into degenerate subgraphs. Eur. J. Comb. 83 (2020) - [j24]Joseph R. Barr, Peter Shaw, Faisal N. Abu-Khzam, Tyler Thatcher, Sheng Yu:
Vulnerability Rating of Source Code with Token Embedding and Combinatorial Algorithms. Int. J. Semantic Comput. 14(4): 501-516 (2020) - [c42]Faisal N. Abu-Khzam, Amer Haj Ahmad, Rana H. Mouawi:
Concise Fuzzy Representation of Big Graphs: A Dimensionality Reduction Approach. DCC 2020: 356 - [c41]Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau:
Parameterized Dynamic Variants of Red-Blue Dominating Set. SOFSEM 2020: 236-247 - [i13]Faisal N. Abu-Khzam, Mohamed Mahmoud Abd El-Wahab, Noureldin Yosri:
Graph Minors Meet Machine Learning: the Power of Obstructions. CoRR abs/2006.04689 (2020) - [i12]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. CoRR abs/2012.12594 (2020)
2010 – 2019
- 2019
- [j23]Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
Efficient parallel algorithms for parameterized problems. Theor. Comput. Sci. 786: 2-12 (2019) - [c40]Joseph R. Barr, Peter Shaw, Faisal N. Abu-Khzam, Jikang Chen:
Combinatorial Text Classification: the Effect of Multi-Parameterized Correlation Clustering. GC 2019: 29-36 - [i11]Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw:
On the Parameterized Cluster Editing with Vertex Splitting Problem. CoRR abs/1901.00156 (2019) - 2018
- [j22]Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau:
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica 80(9): 2517-2550 (2018) - [j21]Faisal N. Abu-Khzam, Henning Fernau, Ryuhei Uehara:
Special Issue on Reconfiguration Problems. Algorithms 11(11): 187 (2018) - [j20]Faisal N. Abu-Khzam, Christine Markarian, Friedhelm Meyer auf der Heide, Michael Schubert:
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory Comput. Syst. 62(8): 1673-1689 (2018) - [c39]Faisal N. Abu-Khzam, DoKyung Kim, Matthew Perry, Kai Wang, Peter Shaw:
Accelerating Vertex Cover Optimization on a GPU Architecture. CCGrid 2018: 616-625 - [c38]Faisal N. Abu-Khzam, Karine Lamaa:
Efficient heuristic algorithms for positive-influence dominating set in social networks. INFOCOM Workshops 2018: 610-615 - [c37]Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw:
Cluster Editing with Vertex Splitting. ISCO 2018: 1-13 - [i10]Faisal N. Abu-Khzam, Rana H. Mouawi:
Concise Fuzzy Representation of Big Graphs: a Dimensionality Reduction Approach. CoRR abs/1803.03114 (2018) - [i9]Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes:
Partitioning a graph into degenerate subgraphs. CoRR abs/1803.04388 (2018) - [i8]Faisal N. Abu-Khzam, Bachir M. Chahine:
A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring. CoRR abs/1812.11254 (2018) - 2017
- [j19]Faisal N. Abu-Khzam:
On the complexity of multi-parameterized cluster editing. J. Discrete Algorithms 45: 26-34 (2017) - [j18]Faisal N. Abu-Khzam, Édouard Bonnet, Florian Sikora:
On the complexity of various parameterizations of common induced subgraph isomorphism. Theor. Comput. Sci. 697: 69-78 (2017) - [c36]Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. FAW 2017: 139-150 - [c35]Faisal N. Abu-Khzam, Shaowei Cai, Judith Egan, Peter Shaw, Kai Wang:
Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis. TAMC 2017: 59-70 - 2016
- [j17]Faisal N. Abu-Khzam, Pinar Heggernes:
Enumerating minimal dominating sets in chordal graphs. Inf. Process. Lett. 116(12): 739-743 (2016) - [j16]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Data reductions and combinatorial bounds for improved approximation algorithms. J. Comput. Syst. Sci. 82(3): 503-520 (2016) - [c34]Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
On the Parameterized Parallel Complexity and the Vertex Cover Problem. COCOA 2016: 477-488 - [c33]Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
The Monotone Circuit Value Problem with Bounded Genus Is in NC. COCOON 2016: 92-102 - [c32]Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau:
Building Clusters with Lower-Bounded Sizes. ISAAC 2016: 4:1-4:13 - 2015
- [j15]Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller:
Partitioning a graph into disjoint cliques and a triangle-free graph. Discret. Appl. Math. 190-191: 1-12 (2015) - [j14]Faisal N. Abu-Khzam, Khuzaima Daudjee, Amer E. Mouawad, Naomi Nishimura:
On scalable parallel recursive backtracking. J. Parallel Distributed Comput. 84: 65-75 (2015) - [j13]Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:
On the parameterized complexity of dynamic problems. Theor. Comput. Sci. 607: 426-434 (2015) - [c31]Faisal N. Abu-Khzam, Amer E. Mouawad, Karim A. Jahed:
Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach. CLUSTER 2015: 518 - [c30]Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora:
On the Complexity of QoS-Aware Service Selection Problem. ICSOC 2015: 345-352 - [i7]Faisal N. Abu-Khzam, Christine Markarian, Friedhelm Meyer auf der Heide, Michael Schubert:
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks. CoRR abs/1510.01866 (2015) - [i6]Faisal N. Abu-Khzam:
On the Complexity of Multi-Parameterized Cluster Editing. CoRR abs/1511.09360 (2015) - 2014
- [j12]Faisal N. Abu-Khzam:
Maximum common induced subgraph parameterized by vertex cover. Inf. Process. Lett. 114(3): 99-103 (2014) - [c29]Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. COCOA 2014: 625-636 - [c28]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Approximation Algorithms Inspired by Kernelization Methods. ISAAC 2014: 479-490 - [c27]Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora:
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. IWOCA 2014: 1-12 - [i5]Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller:
Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs. CoRR abs/1403.5961 (2014) - [i4]Faisal N. Abu-Khzam, Karim A. Jahed, Amer E. Mouawad:
A Hybrid Graph Representation for Exact Graph Algorithms. CoRR abs/1404.6399 (2014) - [i3]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms. CoRR abs/1409.3742 (2014) - [i2]Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora:
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. CoRR abs/1412.1261 (2014) - 2013
- [c26]Faisal N. Abu-Khzam:
The Multi-parameterized Cluster Editing Problem. COCOA 2013: 284-294 - [i1]Faisal N. Abu-Khzam, Khuzaima Daudjee, Amer E. Mouawad, Naomi Nishimura:
An Easy-to-use Scalable Framework for Parallel Recursive Backtracking. CoRR abs/1312.7626 (2013) - 2012
- [j11]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) - [c25]Faisal N. Abu-Khzam, Michael A. Langston:
Almost Exact Graph 3-Coloring in O(1.277^n) Time. CTW 2012: 1-4 - [c24]Faisal N. Abu-Khzam, Mazen Bou Khuzam:
An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem. IPEC 2012: 264-273 - [c23]Faisal N. Abu-Khzam, Amer E. Mouawad:
A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization. PDCAT 2012: 173-178 - 2011
- [j10]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) - [j9]Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff:
An exact algorithm for connected red-blue dominating set. J. Discrete Algorithms 9(3): 252-262 (2011) - 2010
- [j8]Faisal N. Abu-Khzam:
An improved kernelization algorithm for r-Set Packing. Inf. Process. Lett. 110(16): 621-624 (2010) - [j7]Faisal N. Abu-Khzam:
A kernelization algorithm for d-Hitting Set. J. Comput. Syst. Sci. 76(7): 524-531 (2010) - [c22]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 - [c21]Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff:
An Exact Algorithm for Connected Red-Blue Dominating Set. CIAC 2010: 25-36 - [c20]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
- [c19]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 - [c18]Fatima Kanj, Nashat Mansour, Hassan Khachfe, Faisal N. Abu-Khzam:
Protein structure prediction in the 3D HP model. AICCSA 2009: 732-736 - [c17]Faisal N. Abu-Khzam:
A Quadratic Kernel for 3-Set Packing. TAMC 2009: 81-87 - 2008
- [j6]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
- [j5]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) - [j4]Faisal N. Abu-Khzam:
Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems. Theory Comput. Syst. 41(3): 399-410 (2007) - [j3]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) - [c16]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 - [c15]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 - [c14]Faisal N. Abu-Khzam:
Kernelization Algorithms for d-Hitting Set Problems. WADS 2007: 434-445 - 2006
- [j2]Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons:
Scalable Parallel Algorithms for FPT Problems. Algorithmica 45(3): 269-284 (2006) - [j1]Faisal N. Abu-Khzam, Henning Fernau:
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. Electron. Notes Discret. Math. 25: 1-6 (2006) - [c13]Faisal N. Abu-Khzam, Henning Fernau:
Kernels: Annotated, Proper and Induced. IWPEC 2006: 264-275 - 2005
- [c12]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston:
Asymptotically Faster Algorithms for Parameterized FACE COVER. ACiD 2005: 43-58 - [c11]Faisal N. Abu-Khzam, Michael A. Langston:
Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension. ACiD 2005: 59-67 - [c10]Faisal N. Abu-Khzam, Michael A. Langston, W. Henry Suters:
Fast, effective vertex cover kernelization: a tale of two algorithms. AICCSA 2005: 16 - [c9]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 - [c8]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
- [c7]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 - [c6]Faisal N. Abu-Khzam, Michael A. Langston:
Grid Computing: Minitrack Introduction. HICSS 2004 - [c5]Faisal N. Abu-Khzam, Michael A. Langston:
A Direct Algorithm for the Parameterized Face Cover Problem. IWPEC 2004: 213-222 - [c4]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
- [c3]Faisal N. Abu-Khzam, Michael A. Langston:
Graph Coloring and the Immersion Order. COCOON 2003: 394-403 - 2002
- [c2]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 - [c1]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
Coauthor Index
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-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
