| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph | Mizutani, Yosuke et al. | 2022 |
| 2 | Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391) | Král’, Daniel et al. | 2022 |
| 3 | Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class | Demaine, Erik D. et al. | 2019 |
| 4 | A Fast Parameterized Algorithm for Co-Path Set | Sullivan, Blair D. et al. | 2017 |
| 5 | Being Even Slightly Shallow Makes Life Hard | Muzi, Irene et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |