| No. |
Title |
Author |
Year |
| 1 |
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra |
Ito, Takehiro et al. |
2023 |
| 2 |
Reconfiguration of Colorings in Triangulations of the Sphere |
Ito, Takehiro et al. |
2023 |
| 3 |
Rerouting Planar Curves and Disjoint Paths |
Ito, Takehiro et al. |
2023 |
| 4 |
One-Face Shortest Disjoint Paths with a Deviation Terminal |
Kobayashi, Yusuke et al. |
2022 |
| 5 |
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average |
Kobayashi, Yusuke et al. |
2022 |
| 6 |
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint |
Bousquet, Nicolas et al. |
2022 |
| 7 |
An FPT Algorithm for Minimum Additive Spanner Problem |
Kobayashi, Yusuke |
2020 |
| 8 |
Fixed-Parameter Algorithms for Graph Constraint Logic |
Hatanaka, Tatsuhiko et al. |
2020 |
| 9 |
Market Pricing for Matroid Rank Valuations |
Bérczi, Kristóf et al. |
2020 |
| 10 |
Reconfiguration of Spanning Trees with Many or Few Leaves |
Bousquet, Nicolas et al. |
2020 |
| 11 |
Shortest Reconfiguration of Colorings Under Kempe Changes |
Bonamy, Marthe et al. |
2020 |
| 12 |
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set |
Iwata, Yoichi et al. |
2019 |
| 13 |
Parameterized Algorithms for Maximum Cut with Connectivity Constraints |
Eto, Hiroshi et al. |
2019 |
| 14 |
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles |
Ito, Takehiro et al. |
2019 |
| 15 |
The Perfect Matching Reconfiguration Problem |
Bonamy, Marthe et al. |
2019 |
| 16 |
Complexity of the Multi-Service Center Problem |
Ito, Takehiro et al. |
2017 |
| 17 |
The Directed Disjoint Shortest Paths Problem |
Berczi, Kristof et al. |
2017 |
| 18 |
Edge-disjoint Odd Cycles in 4-edge-connected Graphs |
Kawarabayashi, Ken-ichi et al. |
2012 |
| 19 |
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid |
Kawarabayashi, Ken-ichi et al. |
2012 |
