( en | de | ru )

 

Disambiguation of "Rotics, Udi"

Author of the publication

copydeleteadd this publication to your clipboard
Equistable distance-hereditary graphs.

, , and . Discret. Appl. Math., 156 (4): 462-477 (2008)

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.

Josefina Udi

Claudia Udich

Hans-Joachim Udich

Natalia Udilova

 

Other publications of authors with the same name

Equistable distance-hereditary graphs., , and . Discret. Appl. Math., 156 (4): 462-477 (2008)Proving NP-hardness for clique-width I: non-approximability of sequential clique-width, , , and . Electron. Colloquium Comput. Complex., (2005)Polynomial Time Recognition of Clique-Width 3 Graphs (Extended Abstract)., , , , and . LATIN, volume 1776 of Lecture Notes in Computer Science, page 126-134. Springer, (2000)Clique-width minimization is NP-hard., , , and . STOC, page 354-362. ACM, (2006)Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width., , and . WG, volume 1517 of Lecture Notes in Computer Science, page 1-16. Springer, (1998)Computing Graph Polynomials on Graphs of Bounded Clique-Width., , , and . WG, volume 4271 of Lecture Notes in Computer Science, page 191-204. Springer, (2006)Equistable chordal graphs., and . Discret. Appl. Math., 132 (1-3): 203-210 (2003)On the Relationship between Clique-Width and Treewidth., and . WG, volume 2204 of Lecture Notes in Computer Science, page 78-90. Springer, (2001)Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)., and . SODA, page 468-476. ACM/SIAM, (2001)Efficient algorithms for generally intractable graph problems restricted to specific classes of graphs.. Technion - Israel Institute of Technology, Israel, (1998)