( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Equistable distance-hereditary graphs.

, , и . 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.

Josefina Udi

Claudia Udich

Hans-Joachim Udich

Natalia Udilova

 

Другие публикации лиц с тем же именем

Polynomial Time Recognition of Clique-Width 3 Graphs (Extended Abstract)., , , , и . LATIN, том 1776 из Lecture Notes in Computer Science, стр. 126-134. Springer, (2000)Clique-width minimization is NP-hard., , , и . STOC, стр. 354-362. ACM, (2006)Proving NP-hardness for clique-width I: non-approximability of sequential clique-width, , , и . Electron. Colloquium Comput. Complex., (2005)Equistable distance-hereditary graphs., , и . Discret. Appl. Math., 156 (4): 462-477 (2008)On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic., , и . Discret. Appl. Math., 108 (1-2): 23-52 (2001)Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width., , и . WG, том 1517 из Lecture Notes in Computer Science, стр. 1-16. Springer, (1998)Computing Graph Polynomials on Graphs of Bounded Clique-Width., , , и . WG, том 4271 из Lecture Notes in Computer Science, стр. 191-204. Springer, (2006)Equistable chordal graphs., и . Discret. Appl. Math., 132 (1-3): 203-210 (2003)Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)., и . SODA, стр. 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)