The following pages link to Faisal N. Abu-Khzam (Q456692):
Displaying 41 items.
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction (Q456695) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Enumerating minimal dominating sets in chordal graphs (Q738877) (← links)
- An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- An improved exact algorithm for minimum dominating set in chordal graphs (Q2059888) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- On the complexity of multi-parameterized cluster editing (Q2407948) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- Crown structures for vertex cover kernelization (Q2464323) (← links)
- Pseudo-kernelization: A branch-then-Reduce approach for FPT problems (Q2464328) (← links)
- Scalable parallel algorithms for FPT problems (Q2502279) (← links)
- The Monotone Circuit Value Problem with Bounded Genus Is in NC (Q2817851) (← links)
- The Multi-parameterized Cluster Editing Problem (Q2867127) (← links)
- Approximation Algorithms Inspired by Kernelization Methods (Q2942653) (← links)
- On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
- Graph Coloring and the Immersion Order (Q3082946) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs (Q3439454) (← links)
- Kernels: Annotated, Proper and Induced (Q3499744) (← links)
- An Exact Algorithm for Connected Red-Blue Dominating Set (Q3562989) (← links)
- A Hybrid Graph Representation for Recursive Backtracking Algorithms (Q3587345) (← links)
- Kernelization Algorithms for d-Hitting Set Problems (Q3603547) (← links)
- A Quadratic Kernel for 3-Set Packing (Q3630192) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- (Q4636485) (← links)
- Parameterized and Exact Computation (Q5311513) (← links)
- (Q5403032) (← links)
- Computing and Combinatorics (Q5716994) (← links)
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion (Q6038703) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
- Roman census: enumerating and counting Roman dominating functions on graph classes (Q6647625) (← links)
