| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Tight Lower Bounds for List Edge Coloring | Kowalik, Lukasz et al. | 2018 |
| 2 | Improving TSP Tours Using Dynamic Programming over Tree Decompositions | Cygan, Marek et al. | 2017 |
| 3 | Tight Lower Bounds for the Complexity of Multicoloring | Bonamy, Marthe et al. | 2017 |
| 4 | On the Fine-Grained Complexity of Rainbow Coloring | Kowalik, Lukasz et al. | 2016 |
| 5 | Linear Kernels for Outbranching Problems in Sparse Digraphs | Bonamy, Marthe et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |