( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.

, , , , и . Algorithmica, 81 (7): 2795-2828 (2019)

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.

Nihal Kubilay Pınar

Özer Pınar

Pinar Akman

Nihal Kubilay Pınar

Maurizio Pinarello

 

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

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2., , , , и . Algorithmica, 81 (7): 2795-2828 (2019)Maximal induced matchings in triangle-free graphs., , , , и . CoRR, (2013)Edge search number of cographs., , и . Discret. Appl. Math., 160 (6): 734-743 (2012)Guest editors' foreword., , и . Discret. Appl. Math., (2014)Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013., , и . Discret. Appl. Math., (2016)Generalized H-Coloring and H-Covering of Trees., , , и . WG, том 2573 из Lecture Notes in Computer Science, стр. 198-210. Springer, (2002)Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs., , , , и . WG, том 6410 из Lecture Notes in Computer Science, стр. 171-183. (2010)Finding k Disjoint Triangles in an Arbitrary Graph., , , , и . WG, том 3353 из Lecture Notes in Computer Science, стр. 235-244. Springer, (2004)Choosability of P5-Free Graphs., и . MFCS, том 5734 из Lecture Notes in Computer Science, стр. 382-391. Springer, (2009)Efficient Implementation of a Minimal Triangulation Algorithm., и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 550-561. Springer, (2002)