S
Somnath Sikdar
Researcher at RWTH Aachen University
Publications - 60
Citations - 1610
Somnath Sikdar is an academic researcher from RWTH Aachen University. The author has contributed to research in topics: Treewidth & Parameterized complexity. The author has an hindex of 23, co-authored 60 publications receiving 1495 citations. Previous affiliations of Somnath Sikdar include Institute of Mathematical Sciences, Chennai.
Papers
More filters
Journal ArticleDOI
Parameterizing above or below guaranteed values
TL;DR: It is shown that for every problem in MAX SNP, the optimum value is bounded below by an unbounded function of the input-size, and that the above-guarantee parameterization with respect to this lower bound is fixed-parameter tractable.
Journal ArticleDOI
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
Eun Jung Kim,Alexander Langer,Christophe Paul,Felix Reidl,Peter Rossmanith,Ignasi Sau,Somnath Sikdar +6 more
TL;DR: It is shown that any parameterized graph problem (with parameter k) that has a finite integer index and such that Yes-instances have a treewidth-modulator of size O(k) admits a linear kernel on the class of H-topological-minor-free graphs, for any fixed graph H.
Journal ArticleDOI
The parameterized complexity of the induced matching problem
Hannes Moser,Somnath Sikdar +1 more
TL;DR: This work provides first-time fixed-parameter tractability results for planar graphs, bounded-degree graphs, graphs with girth at least six, bipartite graphs, line graphs, and graphs of bounded treewidth.
Book ChapterDOI
A Faster Parameterized Algorithm for Treedepth
TL;DR: In this paper, an n-vertex graph, a tree decomposition of width w, and an integer t are used to decide whether the input graph has treedepth at most t in time 2 O(wt) ·n.
Journal ArticleDOI
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
TL;DR: The algorithms that are presented are the best known and are a substantial improvement over previous best results.