|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 12 publication records. Showing 12 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sounaka Mishra |
Complexity of majority monopoly and signed domination problems.  |
J. Discrete Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra |
On the Maximum Uniquely Restricted Matching for Bipartite Graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh |
Approximation Algorithms for Minimum Chain Vertex Deletion. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
König Deletion Sets and Vertex Covers above the Matching Size. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Kripasindhu Sikdar |
On approximability of linear ordering and related NP-optimization problems on graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Kripasindhu Sikdar, Manoranjan Satpathy |
Optimizing register spills for eager functional languages. |
Future Generation Comp. Syst. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Kripasindhu Sikdar |
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract). |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Kripasindhu Sikdar |
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. |
ITA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Kripasindhu Sikdar, Manoranjan Satpathy |
Optimizing Register Spills for Eager Functional Languages. |
International Conference on Computational Science |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Kripasindhu Sikdar |
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. |
IFIP TCS |
2000 |
DBLP DOI BibTeX RDF |
NP-optimization problems, Minimaximal and maximinimal NP-optimization problems, L-reduction, Approximation algorithms, Hardness of approximation, APX-hardness |
Displaying result #1 - #12 of 12 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")