Table of Contents

• Card-based Protocols Using Triangle CardsKazumasa Shinagawa, Takaaki Mizuki. [doi]
• Making Change in 2048David Eppstein. [doi]
• Uniform Distribution On PachinkoNaoki Kitamura, Yuya Kawabata, Taisuke Izumi. [doi]
• Restricted Power - Computational Complexity Results for Strategic Defense GamesRonald de Haan, Petra Wolf. [doi]
• Tracks from hell - when finding a proof may be easier than checking itMatteo Almanza, Stefano Leucci 0001, Alessandro Panconesi. [doi]
• Evolution of Impossible Objects (Invited Paper)Kokichi Sugihara. [doi]
• A Muffin-Theorem GeneratorGuangqi Cui, John Dickerson, Naveen Durvasula, William Gasarch, Erik Metz, Jacob Prinz, Naveen Raman, Daniel Smolyak, Sung Hyun Yoo. [doi]
• Gender-Aware Facility Location in Multi-Gender WorldValentin Polishchuk, Leonid Sedov. [doi]
• Card-Based Zero-Knowledge Proof for SudokuTatsuya Sasaki, Takaaki Mizuki, Hideaki Sone. [doi]
• God Save the QueenJurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende. [doi]
• Computational Complexity of Motion Planning of a Robot through Simple GadgetsErik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy. [doi]
• The Complexity of Escaping Labyrinths and Enchanted ForestsFlorian D. Schwahn, Clemens Thielen. [doi]
• Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossibleZachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy. [doi]
• On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping GamesDavide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti, Mirko Rossi. [doi]
• The Power of One Secret AgentTami Tamir. [doi]
• How Bad is the Freedom to Flood-It?Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi. [doi]
• SUPERSET: A (Super)Natural Variant of the Card Game SETFábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis. [doi]
• The Computational Complexity of Portal and Other 3D Video GamesErik D. Demaine, Joshua Lockhart, Jayson Lynch. [doi]
• A Cryptographer's Conspiracy SantaXavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade 0001. [doi]
• Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer GamesMichael J. Coulombe, Jayson Lynch. [doi]
• Faster Evaluation of Subtraction GamesDavid Eppstein. [doi]
• Herugolf and Makaro are NP-completeChuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki. [doi]
• How long does it take for all users in a social network to choose their communities?Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe , Dorian Mazauric. [doi]
• Kings, Name Days, Lazy Servants and MagicPaolo Boldi, Sebastiano Vigna. [doi]
• Computational Complexity of Generalized Push FightJeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy. [doi]
• On the Exact Complexity of Polyomino PackingHans L. Bodlaender, Tom C. van der Zanden. [doi]
• The Fewest Clues Problem of Picross 3DKei Kimura, Takuya Kamehashi, Toshihiro Fujito. [doi]
• Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating SetsHeiko Hamann, Christine Markarian, Friedhelm Meyer auf der Heide, Mostafa Wahby. [doi]
• Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized AlgorithmsMarkus Holzer 0001, Jan-Tobias Maurer. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• The complexity of speedrunning video gamesManuel Lafond. [doi]
• Mind the Gap (Invited Paper)Martin Farach-Colton. [doi]
• On the Complexity of Two Dots for Narrow Boards and Few ColorsDavide Bilò, Luciano Gualà, Stefano Leucci 0001, Neeldhara Misra. [doi]