Pinar Heggernes
Identifiers
- name variant Pinar Heggernes 0.60 · backfill
Papers (10)
- Parameterized Aspects of Strong Subgraph Closure cs.DS · 2018 · author #2
- Finding Connected Secluded Subgraphs cs.DS · 2017 · author #2
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 cs.DS · 2017 · author #2
- Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs cs.DS · 2016 · author #2
- Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width cs.DS · 2015 · author #2
- Hadwiger number of graphs with small chordality cs.DS · 2014 · author #2
- Maximal induced matchings in triangle-free graphs math.CO · 2013 · author #2
- Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay cs.DS · 2012 · author #2
- Contracting Graphs to Paths and Trees cs.DS · 2011 · author #1
- Obtaining a Bipartite Graph by Contracting Few Edges cs.DS · 2011 · author #1
Mentions
Frequent Coauthors
- Petr A. Golovach 7 shared papers
- Dieter Kratsch 4 shared papers
- Pim van 't Hof 4 shared papers
- Christophe Paul 3 shared papers
- Yngve Villanger 3 shared papers
- Daniel Lokshtanov 2 shared papers
- Paloma T. Lima 2 shared papers
- Athanasios L. Konstantinidis 1 shared papers
- Benjamin L\'ev\^eque 1 shared papers
- Charis Papadopoulos 1 shared papers
- Daniel Paulusma 1 shared papers
- Mamadou Moustapha Kant\'e 1 shared papers
- Manu Basavaraju 1 shared papers
- Paloma Lima 1 shared papers
- Pedro Montealegre 1 shared papers
- Reza Saei 1 shared papers
- Sigve H. S{\ae}ther 1 shared papers