( en | de | ru )

 

Disambiguation of "Kanj, Iyad A."

Author of the publication

copydeleteadd this publication to your clipboard
Improved Results for Minimum Constraint Removal.

, , , and . AAAI, page 6477-6484. AAAI Press, (2018)

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 Nassif

Iyad Asid

 

Other publications of authors with the same name

On the Ordered List Subgraph Embedding Problems., , , and . Algorithmica, 74 (3): 992-1018 (2016)On the Ordered List Subgraph Embedding Problems., , , and . CoRR, (2014)Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications., and . COCOA, volume 8881 of Lecture Notes in Computer Science, page 637-651. Springer, (2014)On Spanners of Geometric Graphs.. TAMC, volume 5532 of Lecture Notes in Computer Science, page 49-58. Springer, (2009)The inapproximability of non-NP-hard optimization problems., , and . Theor. Comput. Sci., 289 (1): 553-571 (2002)Parameterized and subexponential-time complexity of satisfiability problems and applications., and . Theor. Comput. Sci., (2015)Improved Results for Minimum Constraint Removal., , , and . AAAI, page 6477-6484. AAAI Press, (2018)Degree Four Plane Spanners: Simpler and Better., , and . SoCG, volume 51 of LIPIcs, page 45:1-45:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)There are Plane Spanners of Degree 4 and Moderate Stretch Factor., , , and . Discret. Comput. Geom., 53 (3): 514-546 (2015)On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances., , and . ACM Trans. Comput. Log., 18 (3): 21:1-21:46 (2017)