| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra | Ito, Takehiro et al. | 2023 |
| 2 | Shortest Reconfiguration of Perfect Matchings via Alternating Cycles | Ito, Takehiro et al. | 2019 |
| 3 | On the Complexity of Stable Fractional Hypergraph Matching | Ishizuka, Takashi et al. | 2018 |
| 4 | The b-Branching Problem in Digraphs | Kakimura, Naonori et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 4 |