Two Dots is NP-complete

Neeldhara Misra. Two Dots is NP-complete. In Erik D. Demaine, Fabrizio Grandoni, editors, 8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy. Volume 49 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.