COCOON 2000 International Conference on Computing and Combinatorics
 |  |
Wall of Fame | Most Viewed COCOON-2000 Paper
COCOON
2000
Springer
14 years 3 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 132 | ||
| 2 | | 120 | ||
| 3 | | 116 | ||
| 4 | | 108 | ||
| 5 | | 85 |