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

  • 2020. Parameterized Aspects of Strong Subgraph Closure. Algorithmica.
  • 2019. Structural and Algorithmic Graph Theory Through the Lenses of Graph Classes.
  • 2019. Enumeration of Minimal Connected Dominating Sets for Chordal Graphs. Discrete Applied Mathematics.
  • 2019. Dette er Darwin’s «survival of the fittest». Dagens næringsliv.
  • 2019. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica. 2795-2828.
  • 2019. Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings. Springer.
  • 2019. 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. Leibniz-Zentrum für Informatik.
  • 2018. Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Leibniz International Proceedings in Informatics. 83:1-83:13.
  • 2018. Parameterized Aspects of Strong Subgraph Closure. Leibniz International Proceedings in Informatics. 23:1-23:13.
  • 2018. Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica. 714-741.
  • 2018. Finding connected secluded subgraphs. Leibniz International Proceedings in Informatics. 1-13.
  • 2018. Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. European journal of combinatorics (Print). 132-147.
  • 2017. Preface: Algorithmic Graph Theory on the Adriatic Coast. Discrete Applied Mathematics. 1-3.
  • 2017. Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Algorithmica. 714-741.
  • 2017. On recognition of threshold tolerance graphs and their complements. Discrete Applied Mathematics. 171-180.
  • 2017. Minimal dominating sets in interval graphs and trees. Discrete Applied Mathematics. 162-170.
  • 2017. Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discrete Mathematics. 927-934.
  • 2017. Linear-time generation of random chordal graphs. Lecture Notes in Computer Science (LNCS). 442-453.
  • 2017. Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Lecture Notes in Computer Science (LNCS). 275-288.
  • 2016. The Firefighter problem on graph classes. Theoretical Computer Science. 38-50.

Se fullstendig oversikt over publikasjoner i CRIStin.

Twitter