11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 1-450, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{fraigniaud_et_al:LIPIcs.FUN.2022, title = {{LIPIcs, Volume 226, FUN 2022, Complete Volume}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {1--450}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022}, URN = {urn:nbn:de:0030-drops-159693}, doi = {10.4230/LIPIcs.FUN.2022}, annote = {Keywords: LIPIcs, Volume 226, FUN 2022, Complete Volume} }
11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fraigniaud_et_al:LIPIcs.FUN.2022.0, author = {Fraigniaud, Pierre and Uno, Yushi}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.0}, URN = {urn:nbn:de:0030-drops-159703}, doi = {10.4230/LIPIcs.FUN.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Hugo A. Akitaya, Maarten Löffler, and Giovanni Viglietta. Pushing Blocks by Sweeping Lines. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 1:1-1:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{a.akitaya_et_al:LIPIcs.FUN.2022.1, author = {A. Akitaya, Hugo and L\"{o}ffler, Maarten and Viglietta, Giovanni}, title = {{Pushing Blocks by Sweeping Lines}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {1:1--1:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.1}, URN = {urn:nbn:de:0030-drops-159719}, doi = {10.4230/LIPIcs.FUN.2022.1}, annote = {Keywords: Reconfiguration, Global Control, Pushing Blocks, Permutation} }
Miguel Ambrona. A Practical Algorithm for Chess Unwinnability. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 2:1-2:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ambrona:LIPIcs.FUN.2022.2, author = {Ambrona, Miguel}, title = {{A Practical Algorithm for Chess Unwinnability}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {2:1--2:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.2}, URN = {urn:nbn:de:0030-drops-159721}, doi = {10.4230/LIPIcs.FUN.2022.2}, annote = {Keywords: chess, helpmate, unwinnability, timeout, dead position} }
Joshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan Hendrickson, and Jayson Lynch. Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 3:1-3:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ani_et_al:LIPIcs.FUN.2022.3, author = {Ani, Joshua and Chung, Lily and Demaine, Erik D. and Diomidov, Yevhenii and Hendrickson, Dylan and Lynch, Jayson}, title = {{Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {3:1--3:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.3}, URN = {urn:nbn:de:0030-drops-159737}, doi = {10.4230/LIPIcs.FUN.2022.3}, annote = {Keywords: gadgets, motion planning, hardness of games} }
Marcella Anselmo, Manuela Flores, and Maria Madonia. Fun Slot Machines and Transformations of Words Avoiding Factors. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{anselmo_et_al:LIPIcs.FUN.2022.4, author = {Anselmo, Marcella and Flores, Manuela and Madonia, Maria}, title = {{Fun Slot Machines and Transformations of Words Avoiding Factors}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.4}, URN = {urn:nbn:de:0030-drops-159743}, doi = {10.4230/LIPIcs.FUN.2022.4}, annote = {Keywords: Isometric words, Words avoiding factors, Index of a word, Overlap, Lee distance} }
N.R. Aravind, Neeldhara Misra, and Harshil Mittal. Chess Is Hard Even for a Single Player. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{aravind_et_al:LIPIcs.FUN.2022.5, author = {Aravind, N.R. and Misra, Neeldhara and Mittal, Harshil}, title = {{Chess Is Hard Even for a Single Player}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {5:1--5:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.5}, URN = {urn:nbn:de:0030-drops-159753}, doi = {10.4230/LIPIcs.FUN.2022.5}, annote = {Keywords: chess, strategy, board games, NP-complete} }
Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, and Aaron Williams. Rolling Polyhedra on Tessellations. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{baes_et_al:LIPIcs.FUN.2022.6, author = {Baes, Akira and Demaine, Erik D. and Demaine, Martin L. and Hartung, Elizabeth and Langerman, Stefan and O'Rourke, Joseph and Uehara, Ryuhei and Uno, Yushi and Williams, Aaron}, title = {{Rolling Polyhedra on Tessellations}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.6}, URN = {urn:nbn:de:0030-drops-159761}, doi = {10.4230/LIPIcs.FUN.2022.6}, annote = {Keywords: polyhedra, tilings} }
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, and Anissa Lamani. Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World?. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 7:1-7:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bramas_et_al:LIPIcs.FUN.2022.7, author = {Bramas, Quentin and Devismes, St\'{e}phane and Durand, Ana\"{i}s and Lafourcade, Pascal and Lamani, Anissa}, title = {{Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World?}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {7:1--7:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.7}, URN = {urn:nbn:de:0030-drops-159771}, doi = {10.4230/LIPIcs.FUN.2022.7}, annote = {Keywords: Bee extinction, luminous swarms of beedroids, perpetual flower pollination problem, greenhouse} }
Gerth Stølting Brodal. Priority Queues with Decreasing Keys. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 8:1-8:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{brodal:LIPIcs.FUN.2022.8, author = {Brodal, Gerth St{\o}lting}, title = {{Priority Queues with Decreasing Keys}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {8:1--8:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.8}, URN = {urn:nbn:de:0030-drops-159787}, doi = {10.4230/LIPIcs.FUN.2022.8}, annote = {Keywords: priority queue, decreasing keys, post-order heap, Dijkstra’s algorithm} }
Xavier Bultel. Zero-Knowledge Proof of Knowledge for Peg Solitaire. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bultel:LIPIcs.FUN.2022.9, author = {Bultel, Xavier}, title = {{Zero-Knowledge Proof of Knowledge for Peg Solitaire}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.9}, URN = {urn:nbn:de:0030-drops-159798}, doi = {10.4230/LIPIcs.FUN.2022.9}, annote = {Keywords: Zero-Knowledge Proof, Peg Solitaire} }
Kyle W. Burke, Matthew Ferland, and Shang-Hua Teng. Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 10:1-10:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{burke_et_al:LIPIcs.FUN.2022.10, author = {Burke, Kyle W. and Ferland, Matthew and Teng, Shang-Hua}, title = {{Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {10:1--10:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.10}, URN = {urn:nbn:de:0030-drops-159808}, doi = {10.4230/LIPIcs.FUN.2022.10}, annote = {Keywords: Combinatorial Games, Nim, Generalized Geography, Sprague-Grundy Theory, Grundy value, Computational Complexity, Functional-Preserving Reductions} }
Kyle W. Burke, Matthew Ferland, and Shang-Hua Teng. Quantum-Inspired Combinatorial Games: Algorithms and Complexity. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 11:1-11:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{burke_et_al:LIPIcs.FUN.2022.11, author = {Burke, Kyle W. and Ferland, Matthew and Teng, Shang-Hua}, title = {{Quantum-Inspired Combinatorial Games: Algorithms and Complexity}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {11:1--11:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.11}, URN = {urn:nbn:de:0030-drops-159812}, doi = {10.4230/LIPIcs.FUN.2022.11}, annote = {Keywords: Quantum-Inspired Games, Combinatorial Games, Computational Complexity, Polynomial Hierarchy, \c{c}lass\{PSPACE\}, Nim, Generalized Geography, Snort} }
Jean-Claude Bermond, Frédéric Havet, and Michel Cosnard. Grabbing Olives on Linear Pizzas and Pissaladières. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 12:1-12:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bermond_et_al:LIPIcs.FUN.2022.12, author = {Bermond, Jean-Claude and Havet, Fr\'{e}d\'{e}ric and Cosnard, Michel}, title = {{Grabbing Olives on Linear Pizzas and Pissaladi\`{e}res}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {12:1--12:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.12}, URN = {urn:nbn:de:0030-drops-159826}, doi = {10.4230/LIPIcs.FUN.2022.12}, annote = {Keywords: Grabbing game, degenerate graph, path, grid} }
Justin Dallant and John Iacono. How Fast Can We Play Tetris Greedily with Rectangular Pieces?. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 13:1-13:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dallant_et_al:LIPIcs.FUN.2022.13, author = {Dallant, Justin and Iacono, John}, title = {{How Fast Can We Play Tetris Greedily with Rectangular Pieces?}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {13:1--13:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.13}, URN = {urn:nbn:de:0030-drops-159839}, doi = {10.4230/LIPIcs.FUN.2022.13}, annote = {Keywords: Tetris, Fine-grained complexity, Dynamic data structures, Axis-aligned rectangles} }
Henning Fernau, Carolina Haase, and Stefan Hoffmann. The Synchronization Game on Subclasses of Automata. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fernau_et_al:LIPIcs.FUN.2022.14, author = {Fernau, Henning and Haase, Carolina and Hoffmann, Stefan}, title = {{The Synchronization Game on Subclasses of Automata}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.14}, URN = {urn:nbn:de:0030-drops-159842}, doi = {10.4230/LIPIcs.FUN.2022.14}, annote = {Keywords: Synchronization of finite automata, computational complexity} }
Samuel D. Hand, Jessica Enright, and Kitty Meeks. Making Life More Confusing for Firefighters. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hand_et_al:LIPIcs.FUN.2022.15, author = {Hand, Samuel D. and Enright, Jessica and Meeks, Kitty}, title = {{Making Life More Confusing for Firefighters}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.15}, URN = {urn:nbn:de:0030-drops-159851}, doi = {10.4230/LIPIcs.FUN.2022.15}, annote = {Keywords: Temporal graphs, Spreading processes, Parameterised complexity} }
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, and Ryo Yoshinaka. Sorting Balls and Water: Equivalence and Computational Complexity. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 16:1-16:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ito_et_al:LIPIcs.FUN.2022.16, author = {Ito, Takehiro and Kawahara, Jun and Minato, Shin-ichi and Otachi, Yota and Saitoh, Toshiki and Suzuki, Akira and Uehara, Ryuhei and Uno, Takeaki and Yamanaka, Katsuhisa and Yoshinaka, Ryo}, title = {{Sorting Balls and Water: Equivalence and Computational Complexity}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {16:1--16:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.16}, URN = {urn:nbn:de:0030-drops-159867}, doi = {10.4230/LIPIcs.FUN.2022.16}, annote = {Keywords: Ball sort puzzle, recreational mathematics, sorting pairs in bins, water sort puzzle} }
James Koppel and Yun William Yu. Skiing Is Easy, Gymnastics Is Hard: Complexity of Routine Construction in Olympic Sports. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 17:1-17:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{koppel_et_al:LIPIcs.FUN.2022.17, author = {Koppel, James and Yu, Yun William}, title = {{Skiing Is Easy, Gymnastics Is Hard: Complexity of Routine Construction in Olympic Sports}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {17:1--17:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.17}, URN = {urn:nbn:de:0030-drops-159877}, doi = {10.4230/LIPIcs.FUN.2022.17}, annote = {Keywords: complexity, games, sports} }
Manuel Lafond. How Brokers Can Optimally Abuse Traders. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 18:1-18:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lafond:LIPIcs.FUN.2022.18, author = {Lafond, Manuel}, title = {{How Brokers Can Optimally Abuse Traders}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {18:1--18:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.18}, URN = {urn:nbn:de:0030-drops-159882}, doi = {10.4230/LIPIcs.FUN.2022.18}, annote = {Keywords: Algorithms, trading, graph theory} }
Daniel Lokshtanov and Bernardo Subercaseaux. Wordle Is NP-Hard. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 19:1-19:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lokshtanov_et_al:LIPIcs.FUN.2022.19, author = {Lokshtanov, Daniel and Subercaseaux, Bernardo}, title = {{Wordle Is NP-Hard}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {19:1--19:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.19}, URN = {urn:nbn:de:0030-drops-159893}, doi = {10.4230/LIPIcs.FUN.2022.19}, annote = {Keywords: wordle, np-hardness, complexity} }
Roey Magen and Moni Naor. Mirror Games Against an Open Book Player. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 20:1-20:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{magen_et_al:LIPIcs.FUN.2022.20, author = {Magen, Roey and Naor, Moni}, title = {{Mirror Games Against an Open Book Player}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {20:1--20:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.20}, URN = {urn:nbn:de:0030-drops-159900}, doi = {10.4230/LIPIcs.FUN.2022.20}, annote = {Keywords: Mirror Games, Space Complexity, Eventown-Oddtown} }
Fabien Mathieu and Sébastien Tixeuil. Fun with FUN. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 21:1-21:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{mathieu_et_al:LIPIcs.FUN.2022.21, author = {Mathieu, Fabien and Tixeuil, S\'{e}bastien}, title = {{Fun with FUN}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {21:1--21:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.21}, URN = {urn:nbn:de:0030-drops-159913}, doi = {10.4230/LIPIcs.FUN.2022.21}, annote = {Keywords: Natural Language Processing, Relevance Propagation, Bibliometry, Community, Scientific Fields} }
Arturo Merino, Torsten Mütze, and Aaron Williams. All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 22:1-22:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{merino_et_al:LIPIcs.FUN.2022.22, author = {Merino, Arturo and M\"{u}tze, Torsten and Williams, Aaron}, title = {{All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {22:1--22:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.22}, URN = {urn:nbn:de:0030-drops-159928}, doi = {10.4230/LIPIcs.FUN.2022.22}, annote = {Keywords: Matroids, base exchange, Gray codes, combinatorial generation, greedy algorithms, spanning trees} }
Ami Paz and Liat Peterfreund. Playing Guess Who with Your Kids. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 23:1-23:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{paz_et_al:LIPIcs.FUN.2022.23, author = {Paz, Ami and Peterfreund, Liat}, title = {{Playing Guess Who with Your Kids}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {23:1--23:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.23}, URN = {urn:nbn:de:0030-drops-159935}, doi = {10.4230/LIPIcs.FUN.2022.23}, annote = {Keywords: Guess Who?, Binary Search, Error Correcting Codes, Erasure Codes} }
Suthee Ruangwises and Toshiya Itoh. How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 24:1-24:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ruangwises_et_al:LIPIcs.FUN.2022.24, author = {Ruangwises, Suthee and Itoh, Toshiya}, title = {{How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {24:1--24:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.24}, URN = {urn:nbn:de:0030-drops-159947}, doi = {10.4230/LIPIcs.FUN.2022.24}, annote = {Keywords: Zero-knowledge proof, Card-based cryptography, Shikaku, Puzzles, Games} }
Feedback for Dagstuhl Publishing