( en | de | ru )

 

Disambiguation of "Heggernes, Pinar"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Aspects of Strong Subgraph Closure.

, , , , and . Algorithmica, 82 (7): 2006-2038 (2020)

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.

Nihal Kubilay Pınar

Özer Pınar

Pinar Akman

Nihal Kubilay Pınar

Maurizio Pinarello

 

Other publications of authors with the same name

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