( en | de | ru )

 

Disambiguation of "Heggernes, Pinar"

Author of the publication

copydeleteadd this publication to your clipboard
Maximal induced matchings in triangle-free graphs.

, , , , and . CoRR, (2013)

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

An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets., , , and . Algorithmica, 72 (3): 836-859 (2015)Enumeration and maximum number of minimal connected vertex covers in graphs., , and . Eur. J. Comb., (2018)Interval completion with few edges., , , and . STOC, page 374-381. ACM, (2007)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)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)Recognizing Weakly Triangulated Graphs by Edge Separability., , and . SWAT, volume 1851 of Lecture Notes in Computer Science, page 139-149. Springer, (2000)Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2., , , , and . Algorithmica, 81 (7): 2795-2828 (2019)