#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2000

2017

- This year (1)
- Last five years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
- Algorithmica
- 2011

A graph is König-Egerváry if the size of a minimum vertex cover equals that of a maximum matching in the graph. These graphs have been studied extensively from a graph-theoretic point of view. In this paper, we introduce and study the algorithmic complexity of finding König-Egerváry subgraphs of a given graph. In particular, given a graph G and a… (More)

The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as König-Egerváry graphs. König-Egerváry graphs have been studied extensively from a graph theoretic point of view. In this paper, we introduce and study the algorithmic complexity of finding maximum König-Egerváry subgraphs of a given graph. More… (More)

- Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
- ISAAC
- 2008

A graph is König-Egerváry if the size of a minimum vertex cover equals the size of a maximum matching in the graph. We show that the problem of deleting at most k vertices to make a given graph König-Egerváry is fixed-parameter tractable with respect to k. This is proved using interesting structural theorems on matchings and vertex covers which could be… (More)

- Sounaka Mishra
- Electronic Notes in Discrete Mathematics
- 2011

- Sounaka Mishra, Kripasindhu Sikdar
- ITA
- 2000

- Sounaka Mishra, Kripasindhu Sikdar, Manoranjan Satpathy
- International Conference on Computational Science
- 2001

- Sounaka Mishra, Kripasindhu Sikdar
- Discrete Applied Mathematics
- 2001

We investigate the approximability of minimum and maximum linear ordering problems (MIN-LOP and MAX-LOP) and related feedback set problems such as maximum weight acyclic subdiagraph (MAX-W-SUBDAG), minimum weight feedback arc/vertex set (MIN-W-FAS/ MIN-W-FVS) and a generalization of the latter called MIN-Subset-FAS/MIN-Subset-FVS. MAX-LOP and the other… (More)

- Sounaka Mishra
- J. Discrete Algorithms
- 2012

- N. Safina Devi, Aniket C. Mane, Sounaka Mishra
- Discrete Applied Mathematics
- 2015

- Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
- Theor. Comput. Sci.
- 2014