( en | de | ru )

 

Disambiguation of "Kanj, Iyad A."

Author of the publication

copydeleteadd this publication to your clipboard
On the Ordered List Subgraph Embedding Problems.

, , , and . Algorithmica, 74 (3): 992-1018 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mahmoud Kanj

Ali Kanj

Hassan Iyad

Iyad Asid

Iyad Nassif

 

Other publications of authors with the same name

On Approximating Minimum Vertex Cover for Graphs with Perfect Matching., and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 132-143. Springer, (2000)On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms., and . WG, volume 2204 of Lecture Notes in Computer Science, page 55-65. Springer, (2001)3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size., and . Discret. Math. Algorithms Appl., 7 (2): 1550011:1-1550011:17 (2015)Convex Recoloring Revisited: Complexity and Exact Algorithms., and . COCOON, volume 5609 of Lecture Notes in Computer Science, page 388-397. Springer, (2009)Parameterized Algorithms for Feedback Vertex Set., , and . IWPEC, volume 3162 of Lecture Notes in Computer Science, page 235-247. Springer, (2004)Parameterized Algorithms for the Matrix Completion Problem., , , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 1642-1651. PMLR, (2018)Local Backbones., , and . SAT, volume 7962 of Lecture Notes in Computer Science, page 377-393. Springer, (2013)Improved Exact Algorithms for MAX-SAT., and . LATIN, volume 2286 of Lecture Notes in Computer Science, page 341-355. Springer, (2002)On the Independence Number of Graphs with Maximum Degree 3., and . WG, volume 6986 of Lecture Notes in Computer Science, page 238-249. Springer, (2011)Subexponential Time Complexity of CSP with Global Constraints., , and . CP, volume 8656 of Lecture Notes in Computer Science, page 272-288. Springer, (2014)