Sounaka Mishra

Available identifiers

zbMath Open mishra.sounakaMaRDI QIDQ346241

List of research outcomes

Publication	Date of Publication	Type
On the complexity of co-secure dominating set problem	2024-03-13	Paper
Minimum maximal acyclic matching in proper interval graphs	2023-08-17	Paper
On the complexity of minimum maximal acyclic matchings	2023-08-10	Paper
On the complexity of minimum \(q\)-domination partization problems	2022-04-13	Paper
Approximability of open \(k\)-monopoly problems	2021-08-05	Paper
Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes	2021-04-16	Paper
A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality	2019-11-27	Paper
On approximability of optimization problems related to red/blue-split graphs	2017-08-24	Paper
Constant factor approximation algorithm for TSP satisfying a biased triangle inequality	2016-12-05	Paper
https://portal.mardi4nfdi.de/entity/Q2816031	2016-07-01	Paper
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion	2015-08-18	Paper
Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs	2015-04-28	Paper
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization	2014-03-13	Paper
On the Maximum Uniquely Restricted Matching for Bipartite Graphs	2013-07-23	Paper
Complexity of majority monopoly and signed domination problems	2012-05-11	Paper
The complexity of König subgraph problems and above-guarantee vertex cover	2011-12-14	Paper
Approximation Algorithms for Minimum Chain Vertex Deletion	2011-02-20	Paper
König Deletion Sets and Vertex Covers above the Matching Size	2009-01-29	Paper
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number	2008-05-27	Paper
On approximability of linear ordering and related NP-optimization problems on graphs.	2004-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q4536425	2002-11-25	Paper
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem	2002-02-20	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Sounaka Mishra