Heggernes Pinar

Pinar Heggernes

Information about the author Pinar Heggernes will soon be added to the site.
Found 7 papers in total
Choosability on H-free graphs
Choosability on H-free graphs
2013
A graph is H ‐free if it has no induced subgraph isomorphic to H . We determine...
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
2015
We study the problem of finding small s – t separators that induce graphs having...
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
2015
We show that all minimal edge dominating sets of a graph can be generated in...
Vector connectivity in graphs
Vector connectivity in graphs
2014
Motivated by challenges related to domination, connectivity, and information...
Contracting Graphs to Paths and Trees
Contracting Graphs to Paths and Trees
2014
Vertex deletion and edge deletion problems play a central role in parameterized...
Strongly chordal and chordal bipartite graphs are sandwich monotone
Strongly chordal and chordal bipartite graphs are sandwich monotone
2011
A graph class is sandwich monotone if, for every pair of its graphs G 1 =( V , E 1 )...
Faster Parameterized Algorithms for Minimum Fill‐in
Faster Parameterized Algorithms for Minimum Fill‐in
2011
We present two parameterized algorithms for the Minimum Fill‐in problem, also...
Papers per page: