@InProceedings{ito_et_al:LIPIcs.ICALP.2023.82,
author = {Ito, Takehiro and Kakimura, Naonori and Kamiyama, Naoyuki and Kobayashi, Yusuke and Maezawa, Shun-ichi and Nozaki, Yuta and Okamoto, Yoshio},
title = {{Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {82:1--82:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.82},
URN = {urn:nbn:de:0030-drops-181344},
doi = {10.4230/LIPIcs.ICALP.2023.82},
annote = {Keywords: Graph associahedra, combinatorial shortest path, NP-hardness, polymatroids}
}