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