Accepted Papers

Proceedings

Now the proceedings are available. LIPIcs Proceedings on line

Accepted Papers List

• Valentin Polishchuk and Leonid Sedov. Gender-aware facility location in multi-gender world
• Chuzo Iwamoto, Masato Haruishi and Tatsuaki Ibusuki. Herugolf and Makaro are NP-complete
• Ronald de Haan and Petra Wolf. Restricted Power -- Computational Complexity Results for Strategic Defense Games
• Florian David Schwahn and Clemens Thielen. The Complexity of Escaping Labyrinths and Enchanted Forests
• Paolo Boldi and Sebastiano Vigna. Kings, Name Days, Lazy Servants and Magic
• David Eppstein. Faster Evaluation of Subtraction Games
• David Eppstein. Making Change in 2048
• Tami Tamir. The Power of One Secret Agent
• Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas and Pascal Lafourcade. A Cryptographer's Conspiracy Santa
• Kazumasa Shinagawa and Takaaki Mizuki. Card-based Protocols Using Triangle Cards
• Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti and Mirko Rossi. On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games
• Jeffrey Bosboom, Erik D. Demaine and Mikhail Rudoy. Computational Complexity of Generalized Push Fight
• Hans L. Bodlaender and Tom van der Zanden. On the Exact Complexity of Polyomino Packing
• Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny and Sunil Shende. God Save the Queen
• Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis and Yota Otachi. How Bad is the Freedom to Flood-It?
• Guangqi Cui, John Dickerson, Naveen Durvasula, William Gasarch, Erik Metz, Jacob Prinz, Naveen Raman, Daniel Smolyak and Sung Hyun Yoo. A Muffin-Theorem Generator
• Erik D. Demaine, Joshua Lockhart and Jayson Lynch. The Computational Complexity of Portal and Other 3D Video Games
• Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior and Andreas Tönnis. SUPERSET: A (super)natural variant of the card game SET
• Christine Markarian, Heiko Hamann, Friedhelm Meyer Auf der Heide and Mostafa Wahby. Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets
• Kei Kimura, Takuya Kamehashi and Toshihiro Fujito. The Fewest Clues Problem of Picross 3D
• Markus Holzer and Jan-Tobias Maurer. Selection \textit{Via} the Bogo-Method---More on the Analysis of Perversely Awful Randomized Algorithms
• Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe and Dorian Mazauric. How long does it take for all users in a social network to choose their communities?
• Tatsuya Sasaki, Takaaki Mizuki and Hideaki Sone. Card-Based Zero-Knowledge Proof for Sudoku
• Davide Bilò, Luciano Gualà, Stefano Leucci and Neeldhara Misra. On the Complexity of TwoDots for Narrow Boards and Few Colors
• Michael Coulombe and Jayson Lynch. Cooperating in Video Games? Impossible! Undecideability of Team Multiplayer Games
• Manuel Lafond. The complexity of speedrunning video games
• Naoki Kitamura, Yuya Kawabata and Taisuke Izumi. Uniform Distribution On Pachinko
• Matteo Almanza, Stefano Leucci and Alessandro Panconesi. Tracks from Hell - when finding a proof may be easier than checking it
• Erik Demaine, Isaac Grosof, Jayson Lynch and Mikhail Rudoy. Computational Complexity of Motion Planning of a Robot through Simple Gadgets
• Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch and Mikhail Rudoy. Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible