Heggernes, Pinar

1. Parameterized Aspects of Strong Subgraph Closure
   2018/02/28 by Golovach, Petr A., Heggernes, Pinar, Konstantinidis, Athanasios L. +2 · 2 citations
   #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
2. Obtaining a Bipartite Graph by Contracting Few Edges
   2011/02/26 by Heggernes, Pinar, Hof, Pim van 't, Lokshtanov, Daniel +1 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Contracting Graphs to Paths and Trees
   2011/04/19 by Heggernes, Pinar, Hof, Pim van 't, Lévêque, Benjamin +2 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences