Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Hexasort -- The Complexity of Stacking Colors on Graphs
Linus Klocker, Simon D. Fink
Many popular puzzle and matching games have been analyzed through the lens of computational complexity. Prominent examples include Sudoku, Candy Crush, and Flood-It. A common theme…
cs.CC2024
Pathways to Tractability for Geometric Thickness
Thomas Depian, Simon Dominik Fink, Alexander Firbas +2
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible…