Faisal N. Abu-Khzam

Orcid: 0000-0001-5221-8421

Affiliations:
  • Lebanese American University, Beirut, Lebanon


According to our database1, Faisal N. Abu-Khzam authored at least 90 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Minimal Roman Dominating Functions: Extensions and Enumeration.
Algorithmica, June, 2024

Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter.
CoRR, 2024

AraSpell: A Deep Learning Approach for Arabic Spelling Correction.
CoRR, 2024

Pack and Measure: An Effective Approach for Influence Propagation in Social Networks.
CoRR, 2024

2023
An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion.
Theor. Comput. Sci., May, 2023

A Linear Kernel for Planar Vector Domination.
CoRR, 2023

A Multi-Objective Degree-Based Network Anonymization Method.
Algorithms, 2023

Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
An improved exact algorithm for minimum dominating set in chordal graphs.
Inf. Process. Lett., 2022

Enumerating Connected Dominating Sets.
CoRR, 2022

Graph Embedding: A Methodological Survey.
Proceedings of the Fourth International Conference on Transdisciplinary AI, 2022

Anomaly Detection via Correlation Clustering.
Proceedings of the 16th IEEE International Conference on Semantic Computing, 2022

Enumerating Minimal Connected Dominating Sets.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Recent Advances in Practical Data Reduction.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021
A Multi-Objective Degree-Based Network Anonymization Approach.
CoRR, 2021

A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph.
CoRR, 2021

A Greedy Heuristic for Cluster Editing with Vertex Splitting.
Proceedings of the 4th International Conference on Artificial Intelligence for Industries, 2021

2020
Vulnerability Rating of Source Code with Token Embedding and Combinatorial Algorithms.
Int. J. Semantic Comput., 2020

Partitioning a graph into degenerate subgraphs.
Eur. J. Comb., 2020

Recent Advances in Practical Data Reduction.
CoRR, 2020

Graph Minors Meet Machine Learning: the Power of Obstructions.
CoRR, 2020

A Brief Survey of Fixed-Parameter Parallelism.
Algorithms, 2020

Parameterized Dynamic Variants of Red-Blue Dominating Set.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Concise Fuzzy Representation of Big Graphs: A Dimensionality Reduction Approach.
Proceedings of the Data Compression Conference, 2020

2019
Efficient parallel algorithms for parameterized problems.
Theor. Comput. Sci., 2019

On the Parameterized Cluster Editing with Vertex Splitting Problem.
CoRR, 2019

Combinatorial Text Classification: the Effect of Multi-Parameterized Correlation Clustering.
Proceedings of the First International Conference on Graph Computing, 2019

2018
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.
Theory Comput. Syst., 2018

A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring.
CoRR, 2018

Concise Fuzzy Representation of Big Graphs: a Dimensionality Reduction Approach.
CoRR, 2018

Special Issue on Reconfiguration Problems.
Algorithms, 2018

Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework.
Algorithmica, 2018

Cluster Editing with Vertex Splitting.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Efficient heuristic algorithms for positive-influence dominating set in social networks.
Proceedings of the IEEE INFOCOM 2018, 2018

Accelerating Vertex Cover Optimization on a GPU Architecture.
Proceedings of the 18th IEEE/ACM International Symposium on Cluster, 2018

2017
On the complexity of various parameterizations of common induced subgraph isomorphism.
Theor. Comput. Sci., 2017

On the complexity of multi-parameterized cluster editing.
J. Discrete Algorithms, 2017

Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis.
Proceedings of the Theory and Applications of Models of Computation, 2017

Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2016
Data reductions and combinatorial bounds for improved approximation algorithms.
J. Comput. Syst. Sci., 2016

Enumerating minimal dominating sets in chordal graphs.
Inf. Process. Lett., 2016

Building Clusters with Lower-Bounded Sizes.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

The Monotone Circuit Value Problem with Bounded Genus Is in NC.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

On the Parameterized Parallel Complexity and the Vertex Cover Problem.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
On the parameterized complexity of dynamic problems.
Theor. Comput. Sci., 2015

On scalable parallel recursive backtracking.
J. Parallel Distributed Comput., 2015

Partitioning a graph into disjoint cliques and a triangle-free graph.
Discret. Appl. Math., 2015

On the Complexity of QoS-Aware Service Selection Problem.
Proceedings of the Service-Oriented Computing - 13th International Conference, 2015

Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach.
Proceedings of the 2015 IEEE International Conference on Cluster Computing, 2015

2014
Maximum common induced subgraph parameterized by vertex cover.
Inf. Process. Lett., 2014

Forbidden subgraph characterization of (P<sub>3</sub>-free, K<sub>3</sub>-free)-colourable cographs.
CoRR, 2014

A Hybrid Graph Representation for Exact Graph Algorithms.
CoRR, 2014

Approximation Algorithms Inspired by Kernelization Methods.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
An Easy-to-use Scalable Framework for Parallel Recursive Backtracking.
CoRR, 2013

The Multi-parameterized Cluster Editing Problem.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Immersion Containment and Connectivity in Color-Critical Graphs.
Discret. Math. Theor. Comput. Sci., 2012

A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization.
Proceedings of the 13th International Conference on Parallel and Distributed Computing, 2012

An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Almost Exact Graph 3-Coloring in O(1.277^n) Time.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
An exact algorithm for connected red-blue dominating set.
J. Discrete Algorithms, 2011

Charge and reduce: A fixed-parameter algorithm for String-to-String Correction.
Discret. Optim., 2011

2010
A kernelization algorithm for d-Hitting Set.
J. Comput. Syst. Sci., 2010

An improved kernelization algorithm for r-Set Packing.
Inf. Process. Lett., 2010

A Hybrid Graph Representation for Recursive Backtracking Algorithms.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

A Fixed-Parameter Algorithm for String-to-String Correction.
Proceedings of the Theory of Computing 2010, 2010

2009
A Quadratic Kernel for 3-Set Packing.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs.
Proceedings of the 7th IEEE/ACS International Conference on Computer Systems and Applications, 2009

Protein structure prediction in the 3D HP model.
Proceedings of the 7th IEEE/ACS International Conference on Computer Systems and Applications, 2009

2008
A bounded search tree algorithm for parameterized face cover.
J. Discrete Algorithms, 2008

2007
Crown Structures for Vertex Cover Kernelization.
Theory Comput. Syst., 2007

Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems.
Theory Comput. Syst., 2007

Linear-time algorithms for problems on planar graphs with fixed disk dimension.
Inf. Process. Lett., 2007

Kernelization Algorithms for d-Hitting Set Problems.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

The Buffered Work-Pool Approach for Search-Tree Based Optimization Algorithms.
Proceedings of the Parallel Processing and Applied Mathematics, 2007

The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover.
Proceedings of the 2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 2007

2006
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs.
Electron. Notes Discret. Math., 2006

Scalable Parallel Algorithms for FPT Problems.
Algorithmica, 2006

Kernels: Annotated, Proper and Induced.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology.
Proceedings of the ACM/IEEE SC2005 Conference on High Performance Networking and Computing, 2005

A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Fast, effective vertex cover kernelization: a tale of two algorithms.
Proceedings of the 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), 2005

Asymptotically Faster Algorithms for Parameterized FACE COVER.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2004

A Direct Algorithm for the Parameterized Face Cover Problem.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Grid Computing: Minitrack Introduction.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004

Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
Graph Coloring and the Immersion Order.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
On Special-purpose Hardware Clusters for High-performance Computational Grids.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Distributed Dimension Reduction Algorithms for Widely Dispersed Data.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002


  Loading...