| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Covering Many (Or Few) Edges with k Vertices in Sparse Graphs | Koana, Tomohiro et al. | 2022 |
| 2 | Essentially Tight Kernels For (Weakly) Closed Graphs | Koana, Tomohiro et al. | 2021 |
| 3 | Colored Cut Games | Morawietz, Nils et al. | 2020 |
| 4 | Computing Dense and Sparse Subgraphs of Weakly Closed Graphs | Koana, Tomohiro et al. | 2020 |
| 5 | Exploiting c-Closure in Kernelization Algorithms for Graph Problems | Koana, Tomohiro et al. | 2020 |
| 6 | String Factorizations Under Various Collision Constraints | Grüttemeier, Niels et al. | 2020 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |