Sounaka Mishra

From MaRDI portal
Person:346241

Available identifiers

zbMath Open mishra.sounakaMaRDI QIDQ346241

List of research outcomes

PublicationDate of PublicationType
On the complexity of co-secure dominating set problem2024-03-13Paper
Minimum maximal acyclic matching in proper interval graphs2023-08-17Paper
On the complexity of minimum maximal acyclic matchings2023-08-10Paper
Complexity of Near-3-Choosability Problem2023-05-19Paper
On the complexity of minimum \(q\)-domination partization problems2022-04-13Paper
Approximability of open \(k\)-monopoly problems2021-08-05Paper
Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes2021-04-16Paper
A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality2019-11-27Paper
On approximability of optimization problems related to red/blue-split graphs2017-08-24Paper
Constant factor approximation algorithm for TSP satisfying a biased triangle inequality2016-12-05Paper
https://portal.mardi4nfdi.de/entity/Q28160312016-07-01Paper
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion2015-08-18Paper
Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs2015-04-28Paper
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization2014-03-13Paper
On the Maximum Uniquely Restricted Matching for Bipartite Graphs2013-07-23Paper
Complexity of majority monopoly and signed domination problems2012-05-11Paper
The complexity of König subgraph problems and above-guarantee vertex cover2011-12-14Paper
Approximation Algorithms for Minimum Chain Vertex Deletion2011-02-20Paper
König Deletion Sets and Vertex Covers above the Matching Size2009-01-29Paper
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number2008-05-27Paper
On approximability of linear ordering and related NP-optimization problems on graphs.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q45364252002-11-25Paper
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem2002-02-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sounaka Mishra