| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited | Gima, Tatsuya et al. | 2022 |
| 2 | Independent Set Reconfiguration on Directed Graphs | Ito, Takehiro et al. | 2022 |
| 3 | Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets | Abhinav, Ankit et al. | 2022 |
| 4 | Efficient Enumerations for Minimal Multicuts and Multiway Cuts | Kurita, Kazuhiro et al. | 2020 |
| 5 | Parameterized Complexity of Graph Burning | Kobayashi, Yasuaki et al. | 2020 |
| 6 | On the Complexity of Lattice Puzzles | Kobayashi, Yasuaki et al. | 2019 |
| 7 | Parameterized Algorithms for Maximum Cut with Connectivity Constraints | Eto, Hiroshi et al. | 2019 |
| 8 | An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization | Kobayashi, Yasuaki et al. | 2018 |
| 9 | Treedepth Parameterized by Vertex Cover Number | Kobayashi, Yasuaki et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |