Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions.

P. Heggernes, and C. Papadopoulos. Theor. Comput. Sci., 410 (1): 1-15 (2009)

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

Ö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.P. Golovach, P. Heggernes, D. Kratsch, and Y. Villanger. Algorithmica, 72 (3): 836-859 (2015)Enumeration and maximum number of minimal connected vertex covers in graphs.P. Golovach, P. Heggernes, and D. Kratsch. Eur. J. Comb., (2018)Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.P. Golovach, P. Heggernes, D. Kratsch, P. Lima, and D. Paulusma. Algorithmica, 81 (7): 2795-2828 (2019)Graph Modification Problems (Dagstuhl Seminar 14071).H. Bodlaender, P. Heggernes, and D. Lokshtanov. Dagstuhl Reports, 4 (2): 38-59 (2014)Interval completion with few edges.P. Heggernes, C. Paul, J. Telle, and Y. Villanger. STOC, page 374-381. ACM, (2007)Generalized H-Coloring and H-Covering of Trees.J. Fiala, P. Heggernes, P. Kristiansen, and J. Telle. WG, volume 2573 of Lecture Notes in Computer Science, page 198-210. Springer, (2002)Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs.P. Heggernes, D. Lokshtanov, J. Nederlof, C. Paul, and J. Telle. WG, volume 6410 of Lecture Notes in Computer Science, page 171-183. (2010)Finding k Disjoint Triangles in an Arbitrary Graph.M. Fellows, P. Heggernes, F. Rosamond, C. Sloper, and J. Telle. WG, volume 3353 of Lecture Notes in Computer Science, page 235-244. Springer, (2004)Recognizing Weakly Triangulated Graphs by Edge Separability.A. Berry, J. Bordat, and P. Heggernes. SWAT, volume 1851 of Lecture Notes in Computer Science, page 139-149. Springer, (2000)Choosability of P5-Free Graphs.P. Golovach, and P. Heggernes. MFCS, volume 5734 of Lecture Notes in Computer Science, page 382-391. Springer, (2009)

BibSonomy

Disambiguation of "Heggernes, Pinar"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions.

Please choose a person to relate this publication to

Nihal Kubilay Pınar

Özer Pınar

Pinar Akman

Nihal Kubilay Pınar

Maurizio Pinarello

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Heggernes, Pinar"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions.

Please choose a person to relate this publication to

Nihal Kubilay Pınar

Özer Pınar

Pinar Akman

Nihal Kubilay Pınar

Maurizio Pinarello

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions.