| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra | Ito, Takehiro et al. | 2023 |
| 2 | Rerouting Planar Curves and Disjoint Paths | Ito, Takehiro et al. | 2023 |
| 3 | Market Pricing for Matroid Rank Valuations | Bérczi, Kristóf et al. | 2020 |
| 4 | Shortest Reconfiguration of Perfect Matchings via Alternating Cycles | Ito, Takehiro et al. | 2019 |
| 5 | Spectral Aspects of Symmetric Matrix Signings | Carlson, Charles et al. | 2019 |
| 6 | The b-Branching Problem in Digraphs | Kakimura, Naonori et al. | 2018 |
| 7 | Complexity of the Multi-Service Center Problem | Ito, Takehiro et al. | 2017 |
| 8 | Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint | Huang, Chien-Chung et al. | 2017 |
| 9 | Parameterized Complexity of Sparse Linear Complementarity Problems | Sumita, Hanna et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |