| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs | Pilipczuk, Marcin et al. | 2013 |
| 2 | Tight bounds for Parameterized Complexity of Cluster Editing | Fomin, Fedor V. et al. | 2013 |
| 3 | Approximation Algorithms for Union and Intersection Covering Problems | Cygan, Marek et al. | 2011 |
| Number of result pages: | 1 |
| Number of documents: | 3 |
