Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Sounaka Mishra
Observed names:
Mishra, Sounaka,
S. Mishra,
Sounaka Mishraa
Institution:
Indian Institute of Technology Madras
Observed institutions:
Indian Institute of Technology Guwahati,
Indian Institute of Technology Madras,
Institute of Mathematical Sciences,
Indian Statistical Institute
ORCID:
0000-0001-8393-9109
Observed ORCID:
0000-0001-8393-9109
OpenAlex ID:
A5101610160
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
2010
·
Sounaka Mishra
, Venkatesh Raman
, et al.
·
Algorithmica
·
42
On the Maximum Uniquely Restricted Matching for Bipartite Graphs
2011
·
Sounaka Mishra
·
Electronic Notes in Discrete Mathematics
·
26
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
2014
·
Mrinal Kumar
, Sounaka Mishra
, et al.
·
Theoretical Computer Science
·
23
On the Hardness of Approximating Minimum Monopoly Problems
2002
·
S. Mishra
, Jaikumar Radhakrishnan
, et al.
·
Lecture notes in computer science
·
19
Computational complexity of minimum P4 vertex cover problem for regular and K1,4 -free graphs
2014
·
N. Safina Devi
, Aniket C. Mane
, et al.
·
Discrete Applied Mathematics
·
16
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
2007
·
Sounaka Mishra
, Venkatesh Raman
, et al.
·
Lecture notes in computer science
·
14
Minimum monopoly in regular and tree graphs
2006
·
S. Mishra
, S.B. Rao
·
Discrete Mathematics
·
13
On approximability of linear ordering and related NP-optimization problems on graphs
2003
·
Sounaka Mishra
, Kripasindhu Sikdar
·
Discrete Applied Mathematics
·
13
PDF
König Deletion Sets and Vertex Covers above the Matching Size
2008
·
Sounaka Mishra
, Venkatesh Raman
, et al.
·
Lecture notes in computer science
·
10
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
2001
·
Sounaka Mishra
, Kripasindhu Sikdar
·
RAIRO - Theoretical Informatics and Applications
·
8
Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
2016
·
Usha Mohan
, Sivaramakrishnan Ramani
, et al.
·
Theoretical Computer Science
·
6
PDF
Minimum maximal acyclic matching in proper interval graphs
2024
·
Juhi Chaudhary
, Sounaka Mishra
, et al.
·
Discrete Applied Mathematics
·
5
On the complexity of minimum maximal acyclic matchings
2024
·
Juhi Chaudhary
, Sounaka Mishra
, et al.
·
Journal of Combinatorial Optimization
·
4
Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes
2020
·
Sayani Das
, Sounaka Mishra
·
Discrete Mathematics Algorithms and Applications
·
4
Complexity of majority monopoly and signed domination problems
2011
·
Sounaka Mishra
·
Journal of Discrete Algorithms
·
4
PDF
On the complexity of co-secure dominating set problem
2023
·
B.S. Panda
, Soumyashree Rana
, et al.
·
Information Processing Letters
·
3
PDF
Minimum Maximal Acyclic Matching in Proper Interval Graphs
2023
·
Juhi Chaudhary
, Sounaka Mishra
, et al.
·
Lecture notes in computer science
·
3
On the Complexity of Minimum Maximal Acyclic Matchings
2022
·
Juhi Chaudhary
, Sounaka Mishra
, et al.
·
Lecture notes in computer science
·
3
Minimum Monopoly in Regular and Tree Graphs
2003
·
S. Mishra
, S.B. Rao
·
Electronic Notes in Discrete Mathematics
·
3
On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem
2000
·
Sounaka Mishra
, Kripasindhu Sikdar
·
Lecture notes in computer science
·
3
PDF
A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality
2019
·
Usha Mohan
, Sivaramakrishnan Ramani
, et al.
·
Discrete Applied Mathematics
·
2
PDF
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)
2001
·
Sounaka Mishra
, Kripasindhu Sikdar
·
Electronic Notes in Discrete Mathematics
·
2
On the complexity of minimum q-domination partization problems
2021
·
Sayani Das
, Sounaka Mishra
·
Journal of Combinatorial Optimization
·
1
FO and MSO approach to Some Graph Problems: Approximation and Poly time Results
2017
·
Harshita, Kona
, Mishra, Sounaka
, et al.
·
arXiv (Cornell University)
·
1
PDF
On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion
2016
·
Sounaka Mishraa
, Ashwin Pananjadyb
, et al.
·
1
Show more works
View as search
Works count:
39
Citation count:
230
H-index:
9
I10-index:
9
Year
Topic
Type
