default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th FUN 2018: La Maddalena, Italy
- Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe:
9th International Conference on Fun with Algorithms, FUN 2018, June 13-15, 2018, La Maddalena, Italy. LIPIcs 100, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-067-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xi
- Martin Farach-Colton:
Mind the Gap (Invited Paper). 1:1-1:1 - Kokichi Sugihara:
Evolution of Impossible Objects (Invited Paper). 2:1-2:8 - Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy:
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. 3:1-3:21 - Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Tracks from hell - when finding a proof may be easier than checking it. 4:1-4:13 - Rémy Belmonte, Mehdi Khosravian Ghadikolaei
, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It?. 5:1-5:13 - Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
How long does it take for all users in a social network to choose their communities?. 6:1-6:21 - Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra:
On the Complexity of Two Dots for Narrow Boards and Few Colors. 7:1-7:15 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. 8:1-8:15 - Hans L. Bodlaender, Tom C. van der Zanden:
On the Exact Complexity of Polyomino Packing. 9:1-9:10 - Paolo Boldi, Sebastiano Vigna:
Kings, Name Days, Lazy Servants and Magic. 10:1-10:13 - Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy:
Computational Complexity of Generalized Push Fight. 11:1-11:21 - Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis:
SUPERSET: A (Super)Natural Variant of the Card Game SET. 12:1-12:17 - Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
A Cryptographer's Conspiracy Santa. 13:1-13:13 - Michael J. Coulombe, Jayson Lynch:
Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games. 14:1-14:16 - Guangqi Cui, John P. Dickerson, Naveen Durvasula, William Gasarch, Erik Metz, Jacob Prinz, Naveen Raman, Daniel Smolyak, Sung Hyun Yoo:
A Muffin-Theorem Generator. 15:1-15:19 - Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
God Save the Queen. 16:1-16:20 - Ronald de Haan, Petra Wolf:
Restricted Power - Computational Complexity Results for Strategic Defense Games. 17:1-17:14 - Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy:
Computational Complexity of Motion Planning of a Robot through Simple Gadgets. 18:1-18:21 - Erik D. Demaine, Joshua Lockhart, Jayson Lynch:
The Computational Complexity of Portal and Other 3D Video Games. 19:1-19:22 - David Eppstein:
Faster Evaluation of Subtraction Games. 20:1-20:12 - David Eppstein:
Making Change in 2048. 21:1-21:13 - Heiko Hamann, Christine Markarian, Friedhelm Meyer auf der Heide, Mostafa Wahby:
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. 22:1-22:13 - Markus Holzer, Jan-Tobias Maurer:
Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms. 23:1-23:21 - Chuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki:
Herugolf and Makaro are NP-complete. 24:1-24:11 - Kei Kimura, Takuya Kamehashi, Toshihiro Fujito:
The Fewest Clues Problem of Picross 3D. 25:1-25:13 - Naoki Kitamura, Yuya Kawabata, Taisuke Izumi:
Uniform Distribution On Pachinko. 26:1-26:14 - Manuel Lafond:
The complexity of speedrunning video games. 27:1-27:19 - Valentin Polishchuk, Leonid Sedov:
Gender-Aware Facility Location in Multi-Gender World. 28:1-28:16 - Tatsuya Sasaki, Takaaki Mizuki, Hideaki Sone:
Card-Based Zero-Knowledge Proof for Sudoku. 29:1-29:10 - Florian D. Schwahn, Clemens Thielen:
The Complexity of Escaping Labyrinths and Enchanted Forests. 30:1-30:13 - Kazumasa Shinagawa, Takaaki Mizuki:
Card-based Protocols Using Triangle Cards. 31:1-31:13 - Tami Tamir:
The Power of One Secret Agent. 32:1-32:15
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-08 21:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
