5 citations · 12 across the 6 of their papers we have counts for
12 papers
Generation of random chordal graphs using subtrees of a tree
Oylum Şeker, Pinar Heggernes, Tınaz Ekim +1
Chordal graphs form one of the most studied graph classes. Several graph problems that are NP-hard in general become solvable in polynomial time on chordal graphs, whereas many oth…
Partitioning a graph into degenerate subgraphs
Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
Let be a connected graph with maximum degree distinct from . Given integers and , is said to be $(p_1, \dots, p…
Parameterized Aspects of Strong Subgraph Closure
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis +2
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized…
Finding Connected Secluded Subgraphs
Petr A. Golovach, Pinar Heggernes, Paloma Lima +1
Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough…
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch +2
Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem i…
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson. Although the optimization and decision variant…