Somnath Sikdar

Available identifiers

zbMath Open sikdar.somnathMaRDI QIDQ340582

List of research outcomes

Publication	Date of Publication	Type
Evaluation of an MSO-Solver	2019-09-12	Paper
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs	2019-08-07	Paper
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem	2018-12-03	Paper
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions	2018-10-30	Paper
Fast biclustering by dual parameterization	2017-09-29	Paper
Kernelization using structural parameters on sparse graph classes	2016-11-14	Paper
Are there any good digraph width measures?	2015-12-11	Paper
Finite Integer Index of Pathwidth and Treewidth	2015-09-15	Paper
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond	2014-12-05	Paper
Practical algorithms for MSO model-checking on tree-decomposable graphs	2014-11-24	Paper
A Faster Parameterized Algorithm for Treedepth	2014-07-01	Paper
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking	2014-01-28	Paper
Kernelization Using Structural Parameters on Sparse Graph Classes	2013-09-17	Paper
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions	2013-08-06	Paper
The parameterized complexity of unique coverage and its variants	2013-08-05	Paper
FPT algorithms for connected feedback vertex set	2012-12-21	Paper
On the directed full degree spanning tree problem	2012-10-16	Paper
https://portal.mardi4nfdi.de/entity/Q2904773	2012-08-23	Paper
The parameterized complexity of stabbing rectangles	2012-04-26	Paper
The complexity of König subgraph problems and above-guarantee vertex cover	2011-12-14	Paper
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory	2011-07-01	Paper
Are There Any Good Digraph Width Measures?	2010-12-07	Paper
Parameterized complexity of the induced subgraph problem in directed graphs	2010-03-24	Paper
FPT Algorithms for Connected Feedback Vertex Set	2010-02-09	Paper
On the Directed Degree-Preserving Spanning Tree Problem	2010-01-14	Paper
Simpler Parameterized Algorithm for OCT	2009-12-11	Paper
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels	2009-10-29	Paper
The Budgeted Unique Coverage Problem and Color-Coding	2009-08-18	Paper
The parameterized complexity of the induced matching problem	2009-06-30	Paper
Parameterizing above or below guaranteed values	2009-03-11	Paper
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs	2009-03-10	Paper
König Deletion Sets and Vertex Covers above the Matching Size	2009-01-29	Paper
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants	2008-06-19	Paper
Parameterizing MAX SNP Problems Above Guaranteed Values	2008-06-03	Paper
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number	2008-05-27	Paper
The Parameterized Complexity of the Unique Coverage Problem	2008-05-27	Paper
Efficient exact algorithms through enumerating maximal independent sets and other techniques	2007-12-19	Paper
Progress in Cryptology - INDOCRYPT 2003	2007-11-29	Paper
Theoretical Computer Science	2006-11-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Somnath Sikdar