Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto

Browse the full ICALP paper archive.