| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Complexity of C_k-Coloring in Hereditary Classes of Graphs | Chudnovsky, Maria et al. | 2019 |
| 2 | Packing Directed Circuits Quarter-Integrally | Masarík, Tomás et al. | 2019 |
| 3 | Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs | Novotná, Jana et al. | 2019 |
| 4 | Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization | Egri, László et al. | 2018 |
| 5 | QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs | Bonnet, Édouard et al. | 2018 |
| 6 | Complexity of Token Swapping and its Variants | Bonnet, Édouard et al. | 2017 |
| 7 | Fine-Grained Complexity of Coloring Unit Disks and Balls | Biró, Csaba et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |