33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 1-1080, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{bae_et_al:LIPIcs.ISAAC.2022, title = {{LIPIcs, Volume 248, ISAAC 2022, Complete Volume}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {1--1080}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022}, URN = {urn:nbn:de:0030-drops-172849}, doi = {10.4230/LIPIcs.ISAAC.2022}, annote = {Keywords: LIPIcs, Volume 248, ISAAC 2022, Complete Volume} }
33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bae_et_al:LIPIcs.ISAAC.2022.0, author = {Bae, Sang Won and Park, Heejin}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.0}, URN = {urn:nbn:de:0030-drops-172858}, doi = {10.4230/LIPIcs.ISAAC.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Kunihiko Sadakane. Succinct Representations of Graphs (Invited Talk). In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{sadakane:LIPIcs.ISAAC.2022.1, author = {Sadakane, Kunihiko}, title = {{Succinct Representations of Graphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.1}, URN = {urn:nbn:de:0030-drops-172865}, doi = {10.4230/LIPIcs.ISAAC.2022.1}, annote = {Keywords: Graph Enumeration, Succinct Data Structure, Compression} }
Jeff Erickson. The Tragedy of Being Almost but Not Quite Planar (Invited Talk). In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{erickson:LIPIcs.ISAAC.2022.2, author = {Erickson, Jeff}, title = {{The Tragedy of Being Almost but Not Quite Planar}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.2}, URN = {urn:nbn:de:0030-drops-172875}, doi = {10.4230/LIPIcs.ISAAC.2022.2}, annote = {Keywords: planar graphs, surface graphs, algorithms, open problems} }
Lisa Hellerstein, Thomas Lidbetter, and R. Teal Witter. A Local Search Algorithm for the Min-Sum Submodular Cover Problem. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 3:1-3:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hellerstein_et_al:LIPIcs.ISAAC.2022.3, author = {Hellerstein, Lisa and Lidbetter, Thomas and Witter, R. Teal}, title = {{A Local Search Algorithm for the Min-Sum Submodular Cover Problem}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {3:1--3:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.3}, URN = {urn:nbn:de:0030-drops-172880}, doi = {10.4230/LIPIcs.ISAAC.2022.3}, annote = {Keywords: Local search, submodularity, second-order supermodularity, min-sum set cover} }
Soichiro Fujii, Yuni Iwamasa, Kei Kimura, and Akira Suzuki. Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fujii_et_al:LIPIcs.ISAAC.2022.4, author = {Fujii, Soichiro and Iwamasa, Yuni and Kimura, Kei and Suzuki, Akira}, title = {{Algorithms for Coloring Reconfiguration Under Recolorability Digraphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {4:1--4:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.4}, URN = {urn:nbn:de:0030-drops-172896}, doi = {10.4230/LIPIcs.ISAAC.2022.4}, annote = {Keywords: combinatorial reconfiguration, graph coloring, recolorability, recoloring} }
Sabine Storandt. Algorithms for Landmark Hub Labeling. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{storandt:LIPIcs.ISAAC.2022.5, author = {Storandt, Sabine}, title = {{Algorithms for Landmark Hub Labeling}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {5:1--5:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.5}, URN = {urn:nbn:de:0030-drops-172901}, doi = {10.4230/LIPIcs.ISAAC.2022.5}, annote = {Keywords: Hub Labeling, Landmark, Geodesic, Hitting Set, Highway Dimension} }
Atsuya Hasegawa and François Le Gall. An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hasegawa_et_al:LIPIcs.ISAAC.2022.6, author = {Hasegawa, Atsuya and Le Gall, Fran\c{c}ois}, title = {{An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.6}, URN = {urn:nbn:de:0030-drops-172918}, doi = {10.4230/LIPIcs.ISAAC.2022.6}, annote = {Keywords: small-depth quantum circuit, hybrid quantum computer, oracle separation} }
Julián Mestre and Sergey Pupyrev. Approximating the Minimum Logarithmic Arrangement Problem. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{mestre_et_al:LIPIcs.ISAAC.2022.7, author = {Mestre, Juli\'{a}n and Pupyrev, Sergey}, title = {{Approximating the Minimum Logarithmic Arrangement Problem}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.7}, URN = {urn:nbn:de:0030-drops-172924}, doi = {10.4230/LIPIcs.ISAAC.2022.7}, annote = {Keywords: approximation algorithms, graph compression} }
Zachary Friggstad and Ramin Mousavi. Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{friggstad_et_al:LIPIcs.ISAAC.2022.8, author = {Friggstad, Zachary and Mousavi, Ramin}, title = {{Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.8}, URN = {urn:nbn:de:0030-drops-172932}, doi = {10.4230/LIPIcs.ISAAC.2022.8}, annote = {Keywords: Linear programming, approximation algorithms, combinatorial optimization} }
Gianlorenzo D'Angelo, Esmaeil Delfaraz, and Hugo Gilbert. Budgeted Out-Tree Maximization with Submodular Prizes. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 9:1-9:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dangelo_et_al:LIPIcs.ISAAC.2022.9, author = {D'Angelo, Gianlorenzo and Delfaraz, Esmaeil and Gilbert, Hugo}, title = {{Budgeted Out-Tree Maximization with Submodular Prizes}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {9:1--9:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.9}, URN = {urn:nbn:de:0030-drops-172945}, doi = {10.4230/LIPIcs.ISAAC.2022.9}, annote = {Keywords: Prize Collecting Steiner Tree, Directed graphs, Approximation Algorithms, Budgeted Problem} }
Kyle Fox, Hongyao Huang, and Benjamin Raichel. Clustering with Faulty Centers. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fox_et_al:LIPIcs.ISAAC.2022.10, author = {Fox, Kyle and Huang, Hongyao and Raichel, Benjamin}, title = {{Clustering with Faulty Centers}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.10}, URN = {urn:nbn:de:0030-drops-172950}, doi = {10.4230/LIPIcs.ISAAC.2022.10}, annote = {Keywords: clustering, approximation, probabilistic input, uncertain input} }
Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, and Alexandre Vigny. Combinatorial and Algorithmic Aspects of Monadic Stability. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 11:1-11:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dreier_et_al:LIPIcs.ISAAC.2022.11, author = {Dreier, Jan and M\"{a}hlmann, Nikolas and Mouawad, Amer E. and Siebertz, Sebastian and Vigny, Alexandre}, title = {{Combinatorial and Algorithmic Aspects of Monadic Stability}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {11:1--11:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.11}, URN = {urn:nbn:de:0030-drops-172961}, doi = {10.4230/LIPIcs.ISAAC.2022.11}, annote = {Keywords: Monadic Stability, Structural Graph Theory, Ramsey Numbers, Regularity, Kernels} }
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, and Subir Kumar Ghosh. Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chakraborty_et_al:LIPIcs.ISAAC.2022.12, author = {Chakraborty, Dibyayan and Dailly, Antoine and Das, Sandip and Foucaud, Florent and Gahlawat, Harmender and Ghosh, Subir Kumar}, title = {{Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.12}, URN = {urn:nbn:de:0030-drops-172974}, doi = {10.4230/LIPIcs.ISAAC.2022.12}, annote = {Keywords: Shortest paths, Isometric path cover, Chordal graph, Interval graph, AT-free graph, Approximation algorithm, FPT algorithm, Treewidth, Chordality, Treelength} }
Kyle Fox and Thomas Stanley. Computation of Cycle Bases in Surface Embedded Graphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fox_et_al:LIPIcs.ISAAC.2022.13, author = {Fox, Kyle and Stanley, Thomas}, title = {{Computation of Cycle Bases in Surface Embedded Graphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.13}, URN = {urn:nbn:de:0030-drops-172982}, doi = {10.4230/LIPIcs.ISAAC.2022.13}, annote = {Keywords: cycle basis, surface embedded graphs, homology} }
Michał Dębski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, and Paweł Rzążewski. Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{debski_et_al:LIPIcs.ISAAC.2022.14, author = {D\k{e}bski, Micha{\l} and Lonc, Zbigniew and Okrasa, Karolina and Piecyk, Marta and Rz\k{a}\.{z}ewski, Pawe{\l}}, title = {{Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.14}, URN = {urn:nbn:de:0030-drops-172996}, doi = {10.4230/LIPIcs.ISAAC.2022.14}, annote = {Keywords: graph homomorphism, forbidden induced subgraphs, precoloring extension} }
Takuya Mieno, Mitsuru Funakoshi, and Shunsuke Inenaga. Computing Palindromes on a Trie in Linear Time. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{mieno_et_al:LIPIcs.ISAAC.2022.15, author = {Mieno, Takuya and Funakoshi, Mitsuru and Inenaga, Shunsuke}, title = {{Computing Palindromes on a Trie in Linear Time}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.15}, URN = {urn:nbn:de:0030-drops-173006}, doi = {10.4230/LIPIcs.ISAAC.2022.15}, annote = {Keywords: palindromes, suffix trees, tries, labeled trees, eertrees} }
Yossi Azar, Eldad Peretz, and Noam Touitou. Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{azar_et_al:LIPIcs.ISAAC.2022.16, author = {Azar, Yossi and Peretz, Eldad and Touitou, Noam}, title = {{Distortion-Oblivious Algorithms for Scheduling on Multiple Machines}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.16}, URN = {urn:nbn:de:0030-drops-173010}, doi = {10.4230/LIPIcs.ISAAC.2022.16}, annote = {Keywords: Online, Scheduling, Predictions, Stretch, Flow Time} }
Sándor P. Fekete, Peter Kramer, Christian Rieck, Christian Scheffer, and Arne Schmidt. Efficiently Reconfiguring a Connected Swarm of Labeled Robots. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fekete_et_al:LIPIcs.ISAAC.2022.17, author = {Fekete, S\'{a}ndor P. and Kramer, Peter and Rieck, Christian and Scheffer, Christian and Schmidt, Arne}, title = {{Efficiently Reconfiguring a Connected Swarm of Labeled Robots}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.17}, URN = {urn:nbn:de:0030-drops-173028}, doi = {10.4230/LIPIcs.ISAAC.2022.17}, annote = {Keywords: Motion planning, parallel motion, bounded stretch, makespan, connectivity, swarm robotics} }
Maciej Skorski. Entropy Matters: Understanding Performance of Sparse Random Embeddings. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{skorski:LIPIcs.ISAAC.2022.18, author = {Skorski, Maciej}, title = {{Entropy Matters: Understanding Performance of Sparse Random Embeddings}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.18}, URN = {urn:nbn:de:0030-drops-173037}, doi = {10.4230/LIPIcs.ISAAC.2022.18}, annote = {Keywords: Random Embeddings, Sparse Projections, Renyi Entropy} }
Konstantinos Georgiou, Nikos Giachoudis, and Evangelos Kranakis. Evacuation from a Disk for Robots with Asymmetric Communication. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{georgiou_et_al:LIPIcs.ISAAC.2022.19, author = {Georgiou, Konstantinos and Giachoudis, Nikos and Kranakis, Evangelos}, title = {{Evacuation from a Disk for Robots with Asymmetric Communication}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.19}, URN = {urn:nbn:de:0030-drops-173047}, doi = {10.4230/LIPIcs.ISAAC.2022.19}, annote = {Keywords: Communication, Cycle, Evacuation, Receiver, Sender, Mobile Agents} }
Tatsuya Gima and Yota Otachi. Extended MSO Model Checking via Small Vertex Integrity. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 20:1-20:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gima_et_al:LIPIcs.ISAAC.2022.20, author = {Gima, Tatsuya and Otachi, Yota}, title = {{Extended MSO Model Checking via Small Vertex Integrity}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {20:1--20:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.20}, URN = {urn:nbn:de:0030-drops-173056}, doi = {10.4230/LIPIcs.ISAAC.2022.20}, annote = {Keywords: vertex integrity, monadic second-order logic, cardinality constraint, fixed-parameter tractability} }
Rathish Das, John Iacono, and Yakov Nekrich. External-Memory Dictionaries with Worst-Case Update Cost. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 21:1-21:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{das_et_al:LIPIcs.ISAAC.2022.21, author = {Das, Rathish and Iacono, John and Nekrich, Yakov}, title = {{External-Memory Dictionaries with Worst-Case Update Cost}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {21:1--21:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.21}, URN = {urn:nbn:de:0030-drops-173060}, doi = {10.4230/LIPIcs.ISAAC.2022.21}, annote = {Keywords: Data Structures, External Memory, Buffer Tree} }
Felicia Lucke, Daniël Paulusma, and Bernard Ries. Finding Matching Cuts in H-Free Graphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lucke_et_al:LIPIcs.ISAAC.2022.22, author = {Lucke, Felicia and Paulusma, Dani\"{e}l and Ries, Bernard}, title = {{Finding Matching Cuts in H-Free Graphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.22}, URN = {urn:nbn:de:0030-drops-173076}, doi = {10.4230/LIPIcs.ISAAC.2022.22}, annote = {Keywords: matching cut, perfect matching, H-free graph, computational complexity} }
Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný, and Michael Kaufmann. Graph Product Structure for h-Framed Graphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bekos_et_al:LIPIcs.ISAAC.2022.23, author = {Bekos, Michael A. and Da Lozzo, Giordano and Hlin\v{e}n\'{y}, Petr and Kaufmann, Michael}, title = {{Graph Product Structure for h-Framed Graphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {23:1--23:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.23}, URN = {urn:nbn:de:0030-drops-173086}, doi = {10.4230/LIPIcs.ISAAC.2022.23}, annote = {Keywords: Graph product structure theory, h-framed graphs, k-map graphs, queue number, twin-width} }
Tatiana Belova and Ivan Bliznets. Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 24:1-24:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{belova_et_al:LIPIcs.ISAAC.2022.24, author = {Belova, Tatiana and Bliznets, Ivan}, title = {{Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.24}, URN = {urn:nbn:de:0030-drops-173097}, doi = {10.4230/LIPIcs.ISAAC.2022.24}, annote = {Keywords: Parameterized complexity, Hardness of approximation, Edge modification problems} }
Peyman Afshani, Rasmus Killmann, and Kasper Green Larsen. Hierarchical Categories in Colored Searching. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 25:1-25:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{afshani_et_al:LIPIcs.ISAAC.2022.25, author = {Afshani, Peyman and Killmann, Rasmus and Larsen, Kasper Green}, title = {{Hierarchical Categories in Colored Searching}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {25:1--25:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.25}, URN = {urn:nbn:de:0030-drops-173100}, doi = {10.4230/LIPIcs.ISAAC.2022.25}, annote = {Keywords: Categorical Data, Computational Geometry} }
Junbin Fang, Dominique Unruh, Jun Yan, and Dehua Zhou. How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment?. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 26:1-26:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fang_et_al:LIPIcs.ISAAC.2022.26, author = {Fang, Junbin and Unruh, Dominique and Yan, Jun and Zhou, Dehua}, title = {{How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment?}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {26:1--26:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.26}, URN = {urn:nbn:de:0030-drops-173112}, doi = {10.4230/LIPIcs.ISAAC.2022.26}, annote = {Keywords: Quantum bit commitment, quantum zero-knowledge, quantum proof-of-knowledge, quantum oblivious transfer} }
Shay Mozes, Nathan Wallheimer, and Oren Weimann. Improved Compression of the Okamura-Seymour Metric. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 27:1-27:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{mozes_et_al:LIPIcs.ISAAC.2022.27, author = {Mozes, Shay and Wallheimer, Nathan and Weimann, Oren}, title = {{Improved Compression of the Okamura-Seymour Metric}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {27:1--27:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.27}, URN = {urn:nbn:de:0030-drops-173123}, doi = {10.4230/LIPIcs.ISAAC.2022.27}, annote = {Keywords: Shortest paths, planar graphs, metric compression, distance oracles} }
Ya-Chun Liang, Kazuo Iwama, and Chung-Shou Liao. Improving the Bounds of the Online Dynamic Power Management Problem. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{liang_et_al:LIPIcs.ISAAC.2022.28, author = {Liang, Ya-Chun and Iwama, Kazuo and Liao, Chung-Shou}, title = {{Improving the Bounds of the Online Dynamic Power Management Problem}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.28}, URN = {urn:nbn:de:0030-drops-173138}, doi = {10.4230/LIPIcs.ISAAC.2022.28}, annote = {Keywords: Online algorithm, Energy scheduling, Dynamic power management} }
Kazuyuki Amano. Integer Complexity and Mixed Binary-Ternary Representation. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{amano:LIPIcs.ISAAC.2022.29, author = {Amano, Kazuyuki}, title = {{Integer Complexity and Mixed Binary-Ternary Representation}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.29}, URN = {urn:nbn:de:0030-drops-173146}, doi = {10.4230/LIPIcs.ISAAC.2022.29}, annote = {Keywords: Integer complexity, Lower bounds, Upper bounds, Horner’s schema, Computer assisted proof} }
Pavel Dvořák, Tomáš Masařík, Jana Novotná, Monika Krawczyk, Paweł Rzążewski, and Aneta Żuk. List Locally Surjective Homomorphisms in Hereditary Graph Classes. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dvorak_et_al:LIPIcs.ISAAC.2022.30, author = {Dvo\v{r}\'{a}k, Pavel and Masa\v{r}{\'\i}k, Tom\'{a}\v{s} and Novotn\'{a}, Jana and Krawczyk, Monika and Rz\k{a}\.{z}ewski, Pawe{\l} and \.{Z}uk, Aneta}, title = {{List Locally Surjective Homomorphisms in Hereditary Graph Classes}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.30}, URN = {urn:nbn:de:0030-drops-173154}, doi = {10.4230/LIPIcs.ISAAC.2022.30}, annote = {Keywords: Homomorphism, Hereditary graphs, Subexponential-time algorithms} }
Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, and David Schindl. Locally Checkable Problems Parameterized by Clique-Width. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 31:1-31:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{baghirova_et_al:LIPIcs.ISAAC.2022.31, author = {Baghirova, Narmina and Gonzalez, Carolina Luc{\'\i}a and Ries, Bernard and Schindl, David}, title = {{Locally Checkable Problems Parameterized by Clique-Width}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {31:1--31:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.31}, URN = {urn:nbn:de:0030-drops-173167}, doi = {10.4230/LIPIcs.ISAAC.2022.31}, annote = {Keywords: locally checkable problem, clique-width, dynamic programming, coloring} }
Lily Chung, Erik D. Demaine, Dylan Hendrickson, and Jayson Lynch. Lower Bounds on Retroactive Data Structures. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 32:1-32:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chung_et_al:LIPIcs.ISAAC.2022.32, author = {Chung, Lily and Demaine, Erik D. and Hendrickson, Dylan and Lynch, Jayson}, title = {{Lower Bounds on Retroactive Data Structures}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {32:1--32:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.32}, URN = {urn:nbn:de:0030-drops-173171}, doi = {10.4230/LIPIcs.ISAAC.2022.32}, annote = {Keywords: Retroactivity, time travel, rollback, fine-grained complexity} }
Xiangyu Guo, Kelin Luo, Shi Li, and Yuhao Zhang. Minimizing the Maximum Flow Time in the Online Food Delivery Problem. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 33:1-33:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{guo_et_al:LIPIcs.ISAAC.2022.33, author = {Guo, Xiangyu and Luo, Kelin and Li, Shi and Zhang, Yuhao}, title = {{Minimizing the Maximum Flow Time in the Online Food Delivery Problem}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {33:1--33:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.33}, URN = {urn:nbn:de:0030-drops-173181}, doi = {10.4230/LIPIcs.ISAAC.2022.33}, annote = {Keywords: Online algorithm, Capacitated Vehicle Routing, Flow Time Optimization} }
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, and Anaïs Villedieu. Minimum Link Fencing. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 34:1-34:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bhore_et_al:LIPIcs.ISAAC.2022.34, author = {Bhore, Sujoy and Klute, Fabian and L\"{o}ffler, Maarten and N\"{o}llenburg, Martin and Terziadis, Soeren and Villedieu, Ana\"{i}s}, title = {{Minimum Link Fencing}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.34}, URN = {urn:nbn:de:0030-drops-173191}, doi = {10.4230/LIPIcs.ISAAC.2022.34}, annote = {Keywords: computational geometry, polygon nesting, polygon separation} }
Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, and Erin Taylor. Multi-Robot Motion Planning for Unit Discs with Revolving Areas. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 35:1-35:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{agarwal_et_al:LIPIcs.ISAAC.2022.35, author = {Agarwal, Pankaj K. and Geft, Tzvika and Halperin, Dan and Taylor, Erin}, title = {{Multi-Robot Motion Planning for Unit Discs with Revolving Areas}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {35:1--35:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.35}, URN = {urn:nbn:de:0030-drops-173204}, doi = {10.4230/LIPIcs.ISAAC.2022.35}, annote = {Keywords: motion planning, optimal motion planning, approximation, complexity, NP-hardness} }
Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, and Seeun William Umboh. Nested Active-Time Scheduling. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cao_et_al:LIPIcs.ISAAC.2022.36, author = {Cao, Nairen and Fineman, Jeremy T. and Li, Shi and Mestre, Juli\'{a}n and Russell, Katina and Umboh, Seeun William}, title = {{Nested Active-Time Scheduling}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.36}, URN = {urn:nbn:de:0030-drops-173214}, doi = {10.4230/LIPIcs.ISAAC.2022.36}, annote = {Keywords: Scheduling algorithms, Active time, Approximation algorithm} }
Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki, and Hinano Takeuchi. On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 37:1-37:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fazekas_et_al:LIPIcs.ISAAC.2022.37, author = {Fazekas, Szil\'{a}rd Zsolt and Kim, Hwee and Matsuoka, Ryuichi and Seki, Shinnosuke and Takeuchi, Hinano}, title = {{On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {37:1--37:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.37}, URN = {urn:nbn:de:0030-drops-173228}, doi = {10.4230/LIPIcs.ISAAC.2022.37}, annote = {Keywords: Algorithmic molecular self-assembly, Co-transcriptional folding, Oritatami system, Self-assembly of squares} }
Ferdinando Cicalese, Clément Dallard, and Martin Milanič. On Constrained Intersection Representations of Graphs and Digraphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 38:1-38:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cicalese_et_al:LIPIcs.ISAAC.2022.38, author = {Cicalese, Ferdinando and Dallard, Cl\'{e}ment and Milani\v{c}, Martin}, title = {{On Constrained Intersection Representations of Graphs and Digraphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {38:1--38:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.38}, URN = {urn:nbn:de:0030-drops-173239}, doi = {10.4230/LIPIcs.ISAAC.2022.38}, annote = {Keywords: Directed intersection representation, intersection number} }
Akanksha Agrawal, Soumita Hait, and Amer E. Mouawad. On Finding Short Reconfiguration Sequences Between Independent Sets. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 39:1-39:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{agrawal_et_al:LIPIcs.ISAAC.2022.39, author = {Agrawal, Akanksha and Hait, Soumita and Mouawad, Amer E.}, title = {{On Finding Short Reconfiguration Sequences Between Independent Sets}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.39}, URN = {urn:nbn:de:0030-drops-173244}, doi = {10.4230/LIPIcs.ISAAC.2022.39}, annote = {Keywords: Token sliding, token jumping, fixed-parameter tractability, combinatorial reconfiguration, shortest reconfiguration sequence} }
Maël Dumas, Florent Foucaud, Anthony Perez, and Ioan Todinca. On Graphs Coverable by k Shortest Paths. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 40:1-40:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dumas_et_al:LIPIcs.ISAAC.2022.40, author = {Dumas, Ma\"{e}l and Foucaud, Florent and Perez, Anthony and Todinca, Ioan}, title = {{On Graphs Coverable by k Shortest Paths}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {40:1--40:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.40}, URN = {urn:nbn:de:0030-drops-173251}, doi = {10.4230/LIPIcs.ISAAC.2022.40}, annote = {Keywords: Shortest paths, covering problems, parameterized complexity} }
Benjamin Qi. On Maximizing Sums of Non-Monotone Submodular and Linear Functions. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 41:1-41:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{qi:LIPIcs.ISAAC.2022.41, author = {Qi, Benjamin}, title = {{On Maximizing Sums of Non-Monotone Submodular and Linear Functions}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {41:1--41:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.41}, URN = {urn:nbn:de:0030-drops-173263}, doi = {10.4230/LIPIcs.ISAAC.2022.41}, annote = {Keywords: submodular maximization, regularization, continuous greedy, inapproximability} }
Pankaj K. Agarwal, Matthew J. Katz, and Micha Sharir. On Reverse Shortest Paths in Geometric Proximity Graphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 42:1-42:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{agarwal_et_al:LIPIcs.ISAAC.2022.42, author = {Agarwal, Pankaj K. and Katz, Matthew J. and Sharir, Micha}, title = {{On Reverse Shortest Paths in Geometric Proximity Graphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {42:1--42:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.42}, URN = {urn:nbn:de:0030-drops-173277}, doi = {10.4230/LIPIcs.ISAAC.2022.42}, annote = {Keywords: Geometric optimization, proximity graphs, semi-algebraic range searching, reverse shortest path} }
Jakob Dyrseth and Paloma T. Lima. On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 43:1-43:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dyrseth_et_al:LIPIcs.ISAAC.2022.43, author = {Dyrseth, Jakob and Lima, Paloma T.}, title = {{On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {43:1--43:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.43}, URN = {urn:nbn:de:0030-drops-173286}, doi = {10.4230/LIPIcs.ISAAC.2022.43}, annote = {Keywords: rainbow vertex colouring, diametral path graphs, interval graphs} }
Tatsuya Akutsu, Tomoya Mori, Naotoshi Nakamura, Satoshi Kozawa, Yuhei Ueno, and Thomas N. Sato. On the Complexity of Tree Edit Distance with Variables. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 44:1-44:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{akutsu_et_al:LIPIcs.ISAAC.2022.44, author = {Akutsu, Tatsuya and Mori, Tomoya and Nakamura, Naotoshi and Kozawa, Satoshi and Ueno, Yuhei and Sato, Thomas N.}, title = {{On the Complexity of Tree Edit Distance with Variables}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.44}, URN = {urn:nbn:de:0030-drops-173295}, doi = {10.4230/LIPIcs.ISAAC.2022.44}, annote = {Keywords: Tree edit distance, unification, parameterized algorithms} }
Sandip Das and Harmender Gahlawat. On the Cop Number of String Graphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 45:1-45:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{das_et_al:LIPIcs.ISAAC.2022.45, author = {Das, Sandip and Gahlawat, Harmender}, title = {{On the Cop Number of String Graphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {45:1--45:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.45}, URN = {urn:nbn:de:0030-drops-173308}, doi = {10.4230/LIPIcs.ISAAC.2022.45}, annote = {Keywords: Cop number, string graphs, intersection graphs, planar graphs, pursuit-evasion games} }
Naoto Ohsaka. On the Parameterized Intractability of Determinant Maximization. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 46:1-46:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ohsaka:LIPIcs.ISAAC.2022.46, author = {Ohsaka, Naoto}, title = {{On the Parameterized Intractability of Determinant Maximization}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {46:1--46:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.46}, URN = {urn:nbn:de:0030-drops-173316}, doi = {10.4230/LIPIcs.ISAAC.2022.46}, annote = {Keywords: Determinant maximization, Parameterized complexity, Approximability} }
Yusuke Kobayashi and Tatsuya Terao. One-Face Shortest Disjoint Paths with a Deviation Terminal. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 47:1-47:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kobayashi_et_al:LIPIcs.ISAAC.2022.47, author = {Kobayashi, Yusuke and Terao, Tatsuya}, title = {{One-Face Shortest Disjoint Paths with a Deviation Terminal}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {47:1--47:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.47}, URN = {urn:nbn:de:0030-drops-173322}, doi = {10.4230/LIPIcs.ISAAC.2022.47}, annote = {Keywords: shortest disjoint paths, polynomial time algorithm, planar graph} }
Eunou Lee. Optimizing Quantum Circuit Parameters via SDP. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 48:1-48:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lee:LIPIcs.ISAAC.2022.48, author = {Lee, Eunou}, title = {{Optimizing Quantum Circuit Parameters via SDP}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {48:1--48:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.48}, URN = {urn:nbn:de:0030-drops-173330}, doi = {10.4230/LIPIcs.ISAAC.2022.48}, annote = {Keywords: Quantum algorithm, Optimization, Rounding algorithm, Quantum Circuit, Approximation} }
Thomas Erlebach, Kelin Luo, and Frits C.R. Spieksma. Package Delivery Using Drones with Restricted Movement Areas. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 49:1-49:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{erlebach_et_al:LIPIcs.ISAAC.2022.49, author = {Erlebach, Thomas and Luo, Kelin and Spieksma, Frits C.R.}, title = {{Package Delivery Using Drones with Restricted Movement Areas}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {49:1--49:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.49}, URN = {urn:nbn:de:0030-drops-173343}, doi = {10.4230/LIPIcs.ISAAC.2022.49}, annote = {Keywords: Mobile agents, approximation algorithm, inapproximability} }
Jianqi Zhou, Peihua Li, and Jiong Guo. Parameterized Approximation Algorithms for TSP. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 50:1-50:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{zhou_et_al:LIPIcs.ISAAC.2022.50, author = {Zhou, Jianqi and Li, Peihua and Guo, Jiong}, title = {{Parameterized Approximation Algorithms for TSP}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {50:1--50:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.50}, URN = {urn:nbn:de:0030-drops-173358}, doi = {10.4230/LIPIcs.ISAAC.2022.50}, annote = {Keywords: FPT-approximation algorithms, the Traveling Salesman problem, the triangle inequality, fixed-parameter tractability, metric graphs} }
Miriam Münch, Ignaz Rutter, and Peter Stumpf. Partial and Simultaneous Transitive Orientations via Modular Decompositions. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 51:1-51:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{munch_et_al:LIPIcs.ISAAC.2022.51, author = {M\"{u}nch, Miriam and Rutter, Ignaz and Stumpf, Peter}, title = {{Partial and Simultaneous Transitive Orientations via Modular Decompositions}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {51:1--51:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.51}, URN = {urn:nbn:de:0030-drops-173369}, doi = {10.4230/LIPIcs.ISAAC.2022.51}, annote = {Keywords: representation extension, simultaneous representation, comparability graph, permutation graph, circular permutation graph, modular decomposition} }
Vladimir Podolskii and Nikolay V. Proskurin. Polynomial Threshold Functions for Decision Lists. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 52:1-52:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{podolskii_et_al:LIPIcs.ISAAC.2022.52, author = {Podolskii, Vladimir and Proskurin, Nikolay V.}, title = {{Polynomial Threshold Functions for Decision Lists}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {52:1--52:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.52}, URN = {urn:nbn:de:0030-drops-173372}, doi = {10.4230/LIPIcs.ISAAC.2022.52}, annote = {Keywords: Threshold function, decision list, Hamming ball} }
Paul Lapey and Aaron Williams. Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 53:1-53:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lapey_et_al:LIPIcs.ISAAC.2022.53, author = {Lapey, Paul and Williams, Aaron}, title = {{Pop \& Push: Ordered Tree Iteration in 𝒪(1)-Time}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {53:1--53:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.53}, URN = {urn:nbn:de:0030-drops-173380}, doi = {10.4230/LIPIcs.ISAAC.2022.53}, annote = {Keywords: combinatorial generation, Gray code, simultaneous Gray code, ordered trees, plane trees, Dyck words, binary trees, Catalan objects, loopless algorithm, cool-lex order} }
Kushagra Chatterjee and Prajakta Nimbhorkar. Popular Edges with Critical Nodes. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 54:1-54:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chatterjee_et_al:LIPIcs.ISAAC.2022.54, author = {Chatterjee, Kushagra and Nimbhorkar, Prajakta}, title = {{Popular Edges with Critical Nodes}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {54:1--54:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.54}, URN = {urn:nbn:de:0030-drops-173399}, doi = {10.4230/LIPIcs.ISAAC.2022.54}, annote = {Keywords: Matching, Stable Matching, Popular feasible Matching} }
Yusuke Kobayashi and Ryoga Mahara. Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 55:1-55:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kobayashi_et_al:LIPIcs.ISAAC.2022.55, author = {Kobayashi, Yusuke and Mahara, Ryoga}, title = {{Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {55:1--55:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.55}, URN = {urn:nbn:de:0030-drops-173402}, doi = {10.4230/LIPIcs.ISAAC.2022.55}, annote = {Keywords: Discrete Fair Division, Indivisible Goods, Proportionality} }
Prosenjit Bose, Jean-Lou De Carufel, and Thomas Shermer. Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 56:1-56:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bose_et_al:LIPIcs.ISAAC.2022.56, author = {Bose, Prosenjit and De Carufel, Jean-Lou and Shermer, Thomas}, title = {{Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {56:1--56:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.56}, URN = {urn:nbn:de:0030-drops-173418}, doi = {10.4230/LIPIcs.ISAAC.2022.56}, annote = {Keywords: Pursuit-evasion games, Outerplanar, Graphs, Treedepth, Treewidth} }
Shangqi Lu and Yufei Tao. Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 57:1-57:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lu_et_al:LIPIcs.ISAAC.2022.57, author = {Lu, Shangqi and Tao, Yufei}, title = {{Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {57:1--57:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.57}, URN = {urn:nbn:de:0030-drops-173427}, doi = {10.4230/LIPIcs.ISAAC.2022.57}, annote = {Keywords: Range Updates, Range Sum Queries, Data Structures, Lower Bounds} }
Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, and Frank Staals. Segment Visibility Counting Queries in Polygons. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 58:1-58:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{buchin_et_al:LIPIcs.ISAAC.2022.58, author = {Buchin, Kevin and Custers, Bram and van der Hoog, Ivor and L\"{o}ffler, Maarten and Popov, Aleksandr and Roeloffzen, Marcel and Staals, Frank}, title = {{Segment Visibility Counting Queries in Polygons}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {58:1--58:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.58}, URN = {urn:nbn:de:0030-drops-173431}, doi = {10.4230/LIPIcs.ISAAC.2022.58}, annote = {Keywords: Visibility, Data Structure, Polygons, Complexity} }
Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, and Kaiyu Wu. Shortest Beer Path Queries in Interval Graphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 59:1-59:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{das_et_al:LIPIcs.ISAAC.2022.59, author = {Das, Rathish and He, Meng and Kondratovsky, Eitan and Munro, J. Ian and Naredla, Anurag Murty and Wu, Kaiyu}, title = {{Shortest Beer Path Queries in Interval Graphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {59:1--59:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.59}, URN = {urn:nbn:de:0030-drops-173442}, doi = {10.4230/LIPIcs.ISAAC.2022.59}, annote = {Keywords: Beer Path, Interval Graph} }
Sungmin Kim, Sang-Ki Ko, and Yo-Sub Han. Simon’s Congruence Pattern Matching. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 60:1-60:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kim_et_al:LIPIcs.ISAAC.2022.60, author = {Kim, Sungmin and Ko, Sang-Ki and Han, Yo-Sub}, title = {{Simon’s Congruence Pattern Matching}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {60:1--60:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.60}, URN = {urn:nbn:de:0030-drops-173456}, doi = {10.4230/LIPIcs.ISAAC.2022.60}, annote = {Keywords: pattern matching, Simon’s congruence, string algorithm, data structure} }
Sung-Hwan Kim and Hwan-Gue Cho. Simple Order-Isomorphic Matching Index with Expected Compact Space. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 61:1-61:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kim_et_al:LIPIcs.ISAAC.2022.61, author = {Kim, Sung-Hwan and Cho, Hwan-Gue}, title = {{Simple Order-Isomorphic Matching Index with Expected Compact Space}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {61:1--61:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.61}, URN = {urn:nbn:de:0030-drops-173466}, doi = {10.4230/LIPIcs.ISAAC.2022.61}, annote = {Keywords: Compact Data Structure, String Matching, Order-Preserving Matching, Suffix Array, FM-index, Binary Search Tree} }
Frank Kammer and Johannes Meintrup. Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 62:1-62:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kammer_et_al:LIPIcs.ISAAC.2022.62, author = {Kammer, Frank and Meintrup, Johannes}, title = {{Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {62:1--62:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.62}, URN = {urn:nbn:de:0030-drops-173478}, doi = {10.4230/LIPIcs.ISAAC.2022.62}, annote = {Keywords: planar graph, H-minor-free, space-efficient, separator, tree decomposition} }
Ta-Wei Tu. Subquadratic Weighted Matroid Intersection Under Rank Oracles. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 63:1-63:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{tu:LIPIcs.ISAAC.2022.63, author = {Tu, Ta-Wei}, title = {{Subquadratic Weighted Matroid Intersection Under Rank Oracles}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {63:1--63:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.63}, URN = {urn:nbn:de:0030-drops-173485}, doi = {10.4230/LIPIcs.ISAAC.2022.63}, annote = {Keywords: Matroids, Weighted Matroid Intersection, Combinatorial Optimization} }
Joel D. Day, Maria Kosche, Florin Manea, and Markus L. Schmid. Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 64:1-64:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{day_et_al:LIPIcs.ISAAC.2022.64, author = {Day, Joel D. and Kosche, Maria and Manea, Florin and Schmid, Markus L.}, title = {{Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {64:1--64:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.64}, URN = {urn:nbn:de:0030-drops-173493}, doi = {10.4230/LIPIcs.ISAAC.2022.64}, annote = {Keywords: String algorithms, subsequences with gap constraints, pattern matching, fine-grained complexity, conditional lower bounds, parameterised complexity} }
William L. Holland. Succinct List Indexing in Optimal Time. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 65:1-65:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{holland:LIPIcs.ISAAC.2022.65, author = {Holland, William L.}, title = {{Succinct List Indexing in Optimal Time}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {65:1--65:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.65}, URN = {urn:nbn:de:0030-drops-173506}, doi = {10.4230/LIPIcs.ISAAC.2022.65}, annote = {Keywords: Succinct Data Structures, Lists, Dynamic Data Structures} }
Artur Ignatiev, Ivan Mihajlin, and Alexander Smal. Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 66:1-66:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ignatiev_et_al:LIPIcs.ISAAC.2022.66, author = {Ignatiev, Artur and Mihajlin, Ivan and Smal, Alexander}, title = {{Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {66:1--66:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.66}, URN = {urn:nbn:de:0030-drops-173510}, doi = {10.4230/LIPIcs.ISAAC.2022.66}, annote = {Keywords: communication complexity, circuit complexity, Karchmer-Wigderson games} }
Christian Rieck and Christian Scheffer. The Dispersive Art Gallery Problem. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 67:1-67:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{rieck_et_al:LIPIcs.ISAAC.2022.67, author = {Rieck, Christian and Scheffer, Christian}, title = {{The Dispersive Art Gallery Problem}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {67:1--67:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.67}, URN = {urn:nbn:de:0030-drops-173522}, doi = {10.4230/LIPIcs.ISAAC.2022.67}, annote = {Keywords: Art gallery, dispersion, polyominoes, NP-completeness, r-visibility, vertex guards, L₁-metric, worst-case optimal} }
Feedback for Dagstuhl Publishing