Towards an algorithmic guide to Spiral Galaxies

DOI10.1016/j.tcs.2015.01.051zbMath1327.68131OpenAlexW1979895933MaRDI QIDQ2347000

Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz

Publication date: 26 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.051

zbMATH Keywords

fixed-parameter algorithmsNP-hard problemsone-player game

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Rectangular spiral galaxies are still hard

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Exact exponential algorithms.
• The four-colour theorem
• Minimum-weight triangulation is NP-hard
• Minimal rectangular partitions of digitized blobs
• Minkowski's Convex Body Theorem and Integer Programming
• Paths, Trees, and Flowers

This page was built for publication: Towards an algorithmic guide to Spiral Galaxies