2 citations · 3 across the 10 of their papers we have counts for
4 papers · 1 filter
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi
Given a planar graph, a subset of its vertices called terminals, and , the Face Cover Number problem asks whether the terminals lie on the boundaries of at most $…
Planar Multiway Cut with Terminals on Few Faces
Sukanya Pandey, Erik Jan van Leeuwen
We consider the \textsc{Edge Multiway Cut} problem on planar graphs. It is known that this can be solved in time [Klein, Marx, ICALP 2012] and not in $n^{o(\sqrt{…
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs
Matthew Johnson, Barnaby Martin, Sukanya Pandey +3
For any finite set of graphs, a graph is -subgraph-free if it does not contain any of as a subgraph. In recent work…
Role Coloring Bipartite Graphs
Sukanya Pandey, Vibha Sahlot
A k-role coloring of a graph G is an assignment of k colors to the vertices of G such that if any two vertices are assigned the same color, then their neighborhood are assigned the…