( en | de | ru )

 

Disambiguation of "Mishra, Sounaka"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.

, , , , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 268-279. Springer, (2007)

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.

K Mishra

Dushyant Mishra

Robin Mishra

Satish Mishra

Brahmdatt Mishra

 

Other publications of authors with the same name

On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion., , and . CoRR, (2013)On the Complexity of Co-secure Dominating Set Problem., , and . CoRR, (2023)Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes., and . Discret. Math. Algorithms Appl., 12 (6): 2050086:1-2050086:11 (2020)Minimum Maximal Acyclic Matching in Proper Interval Graphs., , and . CALDAM, volume 13947 of Lecture Notes in Computer Science, page 377-388. Springer, (2023)On approximability of optimization problems related to Red/Blue-split graphs., , and . Theor. Comput. Sci., (2017)Optimizing Register Spills for Eager Functional Languages., , and . International Conference on Computational Science (2), volume 2074 of Lecture Notes in Computer Science, page 128-137. Springer, (2001)Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization., , , and . Theor. Comput. Sci., (2014)The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number., , , , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 268-279. Springer, (2007)FO and MSO approach to Some Graph Problems: Approximation and Poly time Results., , , and . CoRR, (2017)The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover., , , , and . Algorithmica, 61 (4): 857-881 (2011)