
Elimination Distance to Topologicalminorfree Graphs is FPT
In the literature on parameterized graph problems, there has been an inc...
read it

On the Parameterized Complexity of Deletion to Hfree Strong Components
Directed Feedback Vertex Set (DFVS) is a fundamental computational prob...
read it

On the Constrained Leastcost Tour Problem
We introduce the Constrained Leastcost Tour (CLT) problem: given an und...
read it

On the Approximate Compressibility of Connected Vertex Cover
The Connected Vertex Cover problem, where the goal is to compute a minim...
read it

On the Complexity Landscape of Connected f Factor Problems
Let G be an undirected simple graph having n vertices and let f be a fun...
read it

A New Perspective on FO Model Checking of Dense Graph Classes
We study the firstorder (FO) model checking problem of dense graphs, na...
read it

Alternative parameterizations of Metric Dimension
A set of vertices W in a graph G is called resolving if for any two dist...
read it

Reducing CMSO Model Checking to Highly Connected Graphs
Given a Counting Monadic Second Order (CMSO) sentence ψ, the CMSO[ψ] pro...
read it

On Structural Parameterizations of the Edge Disjoint Paths Problem
In this paper we revisit the classical Edge Disjoint Paths (EDP) problem...
read it
M. S. Ramanujan
is this you? claim profile