( en | de | ru )

 

Disambiguation of "Heggernes, Pinar"

Author of the publication

copydeleteadd this publication to your clipboard
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.

, , , and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 133-144. Springer, (2012)

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

Maximum Cardinality Search for Computing Minimal Triangulations., , and . WG, volume 2573 of Lecture Notes in Computer Science, page 1-12. Springer, (2002)Mixed Search Number of Permutation Graphs., and . FAW, volume 5059 of Lecture Notes in Computer Science, page 196-207. Springer, (2008)Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing., , , , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 334-345. Springer, (2010)Making an Arbitrary Filled Graph Minimal by Removing Fill Edges., , and . SWAT, volume 1097 of Lecture Notes in Computer Science, page 173-184. Springer, (1996)Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality., , and . IPEC, volume 43 of LIPIcs, page 307-318. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376)., , and . SIAM J. Discret. Math., 19 (4): 900-913 (2005)Generation of random chordal graphs using subtrees of a tree., , , and . CoRR, (2018)Making Life Easier for Firefighters., , and . FUN, volume 7288 of Lecture Notes in Computer Science, page 177-188. Springer, (2012)Enumerating Minimal Subset Feedback Vertex Sets., , , , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 399-410. Springer, (2011)Finding Disjoint Paths in Split Graphs., , , and . SOFSEM, volume 8327 of Lecture Notes in Computer Science, page 315-326. Springer, (2014)