( en | de | ru )

 

Disambiguation of "Sikdar, Somnath"

Author of the publication

copydeleteadd this publication to your clipboard
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions.

, , , , , , and . ACM Trans. Algorithms, 12 (2): 21:1-21:41 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Somnath Ghosh

Somnath Bhattacharyya

Somnath Ghosh

 

Other publications of authors with the same name

Fast Biclustering by Dual Parameterization., , , and . IPEC, volume 43 of LIPIcs, page 402-413. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Moderately exponential time algorithms for the maximum bounded-degree-1 set problem., , , , , and . Discret. Appl. Math., (2018)FPT Algorithms for Connected Feedback Vertex Set, , , , and . CoRR, (2009)Simpler Parameterized Algorithm for OCT., , and . IWOCA, volume 5874 of Lecture Notes in Computer Science, page 380-384. Springer, (2009)Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs., , , , , and . J. Comput. Syst. Sci., (2019)The Budgeted Unique Coverage Problem and Color-Coding., , , and . CSR, volume 5675 of Lecture Notes in Computer Science, page 310-321. Springer, (2009)The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants., and . FAW, volume 5059 of Lecture Notes in Computer Science, page 288-299. Springer, (2008)On the directed Full Degree Spanning Tree problem., , , and . Discret. Optim., 8 (1): 97-109 (2011)Parameterized complexity of the induced subgraph problem in directed graphs., and . Inf. Process. Lett., 104 (3): 79-85 (2007)König Deletion Sets and Vertex Covers above the Matching Size., , , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 836-847. Springer, (2008)