The following pages link to Sounaka Mishra (Q346241):
Displayed 23 items.
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (Q2009011) (← links)
- Approximability of open \(k\)-monopoly problems (Q2048211) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
- (Q2816031) (← links)
- On the Maximum Uniquely Restricted Matching for Bipartite Graphs (Q2840733) (← links)
- Approximation Algorithms for Minimum Chain Vertex Deletion (Q3078376) (← links)
- König Deletion Sets and Vertex Covers above the Matching Size (Q3597884) (← links)
- (Q4536425) (← links)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
- Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes (Q5859496) (← links)
- Minimum maximal acyclic matching in proper interval graphs (Q6132553) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6168934) (← links)
- On the complexity of co-secure dominating set problem (Q6195337) (← links)
- Complexity of Near-3-Choosability Problem (Q6437199) (← links)