 | 2008 |
|---|
| 8 |       | Sounaka Mishra,
Venkatesh Raman,
Saket Saurabh,
Somnath Sikdar:
König Deletion Sets and Vertex Covers above the Matching Size.
ISAAC 2008: 836-847 |
| 2007 |
|---|
| 7 | | Sounaka Mishra,
Venkatesh Raman,
Saket Saurabh,
Somnath Sikdar,
C. R. Subramanian:
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.
ISAAC 2007: 268-279 |
| 2004 |
|---|
| 6 | | Sounaka Mishra,
Kripasindhu Sikdar:
On approximability of linear ordering and related NP-optimization problems on graphs.
Discrete Applied Mathematics 136(2-3): 249-269 (2004) |
| 2002 |
|---|
| 5 | | Sounaka Mishra,
Kripasindhu Sikdar,
Manoranjan Satpathy:
Optimizing register spills for eager functional languages.
Future Generation Comp. Syst. 18(5): 699-708 (2002) |
| 2001 |
|---|
| 4 | | Sounaka Mishra,
Kripasindhu Sikdar,
Manoranjan Satpathy:
Optimizing Register Spills for Eager Functional Languages.
International Conference on Computational Science (2) 2001: 128-137 |
| 3 | | Sounaka Mishra,
Kripasindhu Sikdar:
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract).
Electronic Notes in Discrete Mathematics 8: 63-66 (2001) |
| 2 | | Sounaka Mishra,
Kripasindhu Sikdar:
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.
ITA 35(3): 287-309 (2001) |
| 2000 |
|---|
| 1 | | Sounaka Mishra,
Kripasindhu Sikdar:
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.
IFIP TCS 2000: 186-199 |
