Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Somnath Sikdar
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Related publications
The Parameterized Complexity of the Shared Center Problem
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
The Complexity of Restricted Variants of the Stable Paths Problem
Fundamenta Informaticae
Information Systems
Algebra
Number Theory
Mathematics
Computational Theory
Theoretical Computer Science
Higher-Dimensional Orthogonal Range Reporting and Rectangle Stabbing in the Pointer Machine Model
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Parameterized Proof Complexity
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
On the Space Complexity of Parameterized Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Complexity of Irredundant Sets Parameterized by Size
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
