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]
@inproceedings{GroupHT24,
title = {Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants},
author = {MIT Hardness Group and Della H. Hendrickson and Andy Tockman},
year = {2024},
doi = {10.4230/LIPIcs.FUN.2024.25},
url = {https://doi.org/10.4230/LIPIcs.FUN.2024.25},
researchr = {https://researchr.org/publication/GroupHT24},
cites = {0},
citedby = {0},
booktitle = {12th International Conference on Fun with Algorithms, FUN 2024, June 4-8, 2024, Island of La Maddalena, Sardinia, Italy},
editor = {Andrei Z. Broder and Tami Tamir},
volume = {291},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-314-0},
}