PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kanj, Iyad A."

Author of the publication

copydeleteadd this publication to your clipboard
Vertex Cover: Further Observations and Further Improvements.

, , and . J. Algorithms, 41 (2): 280-301 (2001)

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.

A. Laukemann

A. Laukemann

A. Laukemann

A. Vo{\ss}

A. Afkari

 

Other publications of authors with the same name

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 upper bounds for vertex cover., , and . Theor. Comput. Sci., 411 (40-42): 3736-3756 (2010)Parameterized top-K algorithms., , , , and . Theor. Comput. Sci., (2013)On the pseudo-achromatic number problem., , , , and . Theor. Comput. Sci., 410 (8-10): 818-829 (2009)On the Ordered List Subgraph Embedding Problems., , , and . Algorithmica, 74 (3): 992-1018 (2016)What Makes Equitable Connected Partition Easy., , , , , and . IWPEC, volume 5917 of Lecture Notes in Computer Science, page 122-133. Springer, (2009)Degree Four Plane Spanners: Simpler and Better., , and . Symposium on Computational Geometry, volume 51 of LIPIcs, page 45:1-45:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Genus Characterizes the Complexity of Graph Problems: Some Tight Results., , , , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 845-856. Springer, (2003)On Spanners of Geometric Graphs.. TAMC, volume 5532 of Lecture Notes in Computer Science, page 49-58. Springer, (2009)