@InProceedings{mithardnessgroup_et_al:LIPIcs.FUN.2024.25,
  author =	{MIT Hardness Group and Hendrickson, Della and Tockman, Andy},
  title =	{{Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants}},
  booktitle =	{12th International Conference on Fun with Algorithms (FUN 2024)},
  pages =	{25:1--25:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-314-0},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{291},
  editor =	{Broder, Andrei Z. and Tamir, Tami},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.25},
  URN =		{urn:nbn:de:0030-drops-199335},
  doi =		{10.4230/LIPIcs.FUN.2024.25},
  annote =	{Keywords: NP, coNP, hardness, minesweeper, solvability, gadgets, simulation}
}