Hjem
Pinar Heggerness bilde

Pinar Heggernes

Instituttleder, Professor i informatikk med spesialisering i algoritmer
  • E-postPinar.Heggernes@uib.no
  • Telefon+47 55 58 41 75+47 924 82 316
  • Besøksadresse
    HIB - Thormøhlensgt. 55
  • Postadresse
    Postboks 7803
    5020 Bergen

Se allle publikasjoner i en egen nettside

  • Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniel. 2019. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica. 81: 2795-2828. doi: 10.1007/s00453-019-00555-y
  • Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza. 2019. Enumeration of Minimal Connected Dominating Sets for Chordal Graphs. Discrete Applied Mathematics. Publisert 2019-08-06. doi: https://doi.org/10.1016/j.dam.2019.07.015
  • Heggernes, Pinar; Olsen, Kai. 2019. Dette er Darwin’s «survival of the fittest». Dagens næringsliv. Publisert 2019-06-03.
  • Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve. 2018. Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica. 80: 714-741.
  • Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios; T. Lima, Paloma; Papadopoulos, Charis. 2018. Parameterized Aspects of Strong Subgraph Closure. Leibniz International Proceedings in Informatics. 101: 23:1-23:13. doi: 10.4230/LIPIcs.SWAT.2018.23
  • Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter. 2018. Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. European journal of combinatorics (Print). 68: 132-147. doi: 10.1016/j.ejc.2017.07.015
  • Golovach, Petr; Heggernes, Pinar; Thomé de Lima, Paloma; Montealegre, Pedro. 2018. Finding connected secluded subgraphs. Leibniz International Proceedings in Informatics. 89: 1-13. doi: 10.4230/LIPIcs.IPEC.2017.18
  • Heggernes, Pinar; Issac, Davis; Lauri, Juho; T. Lima, Paloma; van Leeuwen, Erik Jan. 2018. Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Leibniz International Proceedings in Informatics. 117: 83:1-83:13. doi: 10.4230/LIPIcs.MFCS.2018.83
  • Brešar, Boštjan; Heggernes, Pinar; Kamiński, Marcin; Milanič, Martin; Paulusma, Daniël; Potočnik, Primož; Trotignon, Nicolas. 2017. Preface: Algorithmic Graph Theory on the Adriatic Coast. Discrete Applied Mathematics. 231: 1-3. doi: 10.1016/j.dam.2017.05.007
  • Dibek, Cemil; Ekim, Tınaz; Heggernes, Pinar. 2017. Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discrete Mathematics. 340: 927-934. doi: 10.1016/j.disc.2017.01.010
  • Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve. 2017. Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Algorithmica. 80: 714-741. Publisert 2017-02-13. doi: 10.1007/s00453-017-0289-1
  • Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Villanger, Yngve. 2017. Minimal dominating sets in interval graphs and trees. Discrete Applied Mathematics. 216: 162-170. doi: 10.1016/j.dam.2016.01.038
  • Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma; Paulusma, Daniël. 2017. Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Lecture Notes in Computer Science. 10520 LNCS: 275-288. doi: 10.1007/978-3-319-68705-6_21
  • Golovach, Petr; Heggernes, Pinar; Lindzey, Nathan; McConnell, Ross M.; dos Santos, Vínicius Fernandes; Spinrad, Jeremy P.; Szwarcfiter, Jayme Luiz. 2017. On recognition of threshold tolerance graphs and their complements. Discrete Applied Mathematics. 216: 171-180. doi: 10.1016/j.dam.2015.01.034
  • Seker, Oylum; Heggernes, Pinar; Ekim, Tinaz; Taskin, Z Caner. 2017. Linear-time generation of random chordal graphs. Lecture Notes in Computer Science. 10236 LNCS: 442-453. doi: 10.1007/978-3-319-57586-5_37
  • Cygan, Marek; Heggernes, Pinar. 2016. Erratum to: Foreword: Special Issue on IPEC 2014 (Algorithmica, DOI 10.1007/s00453-016-0151-x). Algorithmica. 75: 257-257. doi: 10.1007/s00453-016-0161-8
  • Cygan, Marek; Heggernes, Pinar. 2016. Special Issue on IPEC 2014. Springer. 180 sider.
  • Cygan, Marek; Heggernes, Pinar. 2016. Foreword: Special Issue on IPEC 2014. Algorithmica. 75: 255-256. doi: 10.1007/s00453-016-0151-x
  • Heggernes, Pinar. 2016. Preface. Lecture Notes in Computer Science. 9941 LNCS: V-V.
  • Heggernes, Pinar. 2016. Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers. Springer. 310 sider. ISBN: 978-3-662-53535-6.

Se fullstendig oversikt over publikasjoner i CRIStin.