Sudeshna Kolay

activity

20152026

most citedParameterized Algorithms for Deletion to (r,l)-graphs

3 citations · 4 across the 15 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs

Aryan Sanghi, Anubhav Dhar, Sudeshna Kolay

Given a simple graph $G$ , its line graph, denoted by $L (G)$ , is obtained by representing each edge of $G$ as a vertex, with two vertices in $L (G)$ adjacent whenever the correspondi…

cs.CC2026

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices

Palash Dey, Anubhav Dhar, Ashlesha Hota +2

In this paper, we study the Maximum Common Vertex Subgraph problem: Given two input graphs $G_{1}, G_{2}$ and a non-negative integer $h$ , is there a common subgraph $H$ on at least $h$ …