Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants

MIT Hardness Group, Della H. Hendrickson, Andy Tockman. Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants. In Andrei Z. Broder, Tami Tamir, editors, 12th International Conference on Fun with Algorithms, FUN 2024, June 4-8, 2024, Island of La Maddalena, Sardinia, Italy. Volume 291 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]

Authors

MIT Hardness Group

This author has not been identified. Look up 'MIT Hardness Group' in Google

Della H. Hendrickson

This author has not been identified. Look up 'Della H. Hendrickson' in Google

Andy Tockman

This author has not been identified. Look up 'Andy Tockman' in Google