Jeffrey Bosboom
,
Charlotte Chen
,
Lily Chung
,
Spencer Compton
,
Michael Coulombe
,
Erik D. Demaine
,
Martin L. Demaine
,
Ivan Tadeu Ferreira Antunes Filho
,
Dylan Hendrickson
,
Adam Hesterberg
,
Calvin Hsu
,
William Hu
,
Oliver Korten
,
Zhezheng Luo
,
Lillian Zhang
… First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but polynomial-time solvable for nonstrict inequalities. … we provide linear-time algorithms to find antidirected and forbidden-transition Eulerian paths; … First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but polynomial-time solvable for nonstrict inequalities. …
IPSJ