# Sounaka Mishra

According to our database

Collaborative distances:

^{1}, Sounaka Mishra authored at least 15 papers between 2000 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Constant factor approximation algorithm for TSP satisfying a biased triangle inequality.

Theor. Comput. Sci., 2017

On approximability of optimization problems related to Red/Blue-split graphs.

Theor. Comput. Sci., 2017

2015

On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion.

J. Discrete Algorithms, 2015

Computational complexity of minimum P4 vertex cover problem for regular and K1, 4-free graphs.

Discrete Applied Mathematics, 2015

2014

Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization.

Theor. Comput. Sci., 2014

2012

Complexity of majority monopoly and signed domination problems.

J. Discrete Algorithms, 2012

2011

On the Maximum Uniquely Restricted Matching for Bipartite Graphs.

Electronic Notes in Discrete Mathematics, 2011

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.

Algorithmica, 2011

Approximation Algorithms for Minimum Chain Vertex Deletion.

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2008

König Deletion Sets and Vertex Covers above the Matching Size.

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2004

On approximability of linear ordering and related NP-optimization problems on graphs.

Discrete Applied Mathematics, 2004

2001

On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract).

Electronic Notes in Discrete Mathematics, 2001

Optimizing Register Spills for Eager Functional Languages.

Proceedings of the Computational Science - ICCS 2001, 2001

2000

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.

Proceedings of the Theoretical Computer Science, 2000