2 citations · 3 across the 8 of their papers we have counts for
3 papers · 1 filter
Gerrymandering on graphs: Computational complexity and parameterized algorithms
Sushmita Gupta, Pallavi Jain, Fahad Panolan +2
Partitioning a region into districts to favor a particular candidate or a party is commonly known as gerrymandering. In this paper, we investigate the gerrymandering problem in gra…
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov +2
A graph operation that {\em contracts edges} is one of the fundamental operations in the theory of graph minors. Parameterized Complexity of editing to a family of graphs by contra…
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem
Pallavi Jain, Gur Saran, Kamal Srivastava
Vertex Separation Minimization Problem (VSMP) consists of finding a layout of a graph G = (V,E) which minimizes the maximum vertex cut or separation of a layout. It is an NP-comple…