LIPIcs, Volume 248, ISAAC 2022

• Sang Won Bae and Heejin Park LIPIcs, Volume 248, ISAAC 2022, Complete Volume 10.4230/LIPIcs.ISAAC.2022
• Sang Won Bae and Heejin Park Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ISAAC.2022.0
• Kunihiko Sadakane Succinct Representations of Graphs (Invited Talk) 10.4230/LIPIcs.ISAAC.2022.1
• Jeff Erickson The Tragedy of Being Almost but Not Quite Planar (Invited Talk) 10.4230/LIPIcs.ISAAC.2022.2
• Lisa Hellerstein, Thomas Lidbetter, and R. Teal Witter A Local Search Algorithm for the Min-Sum Submodular Cover Problem 10.4230/LIPIcs.ISAAC.2022.3
• Soichiro Fujii, Yuni Iwamasa, Kei Kimura, and Akira Suzuki Algorithms for Coloring Reconfiguration Under Recolorability Digraphs 10.4230/LIPIcs.ISAAC.2022.4
• Sabine Storandt Algorithms for Landmark Hub Labeling 10.4230/LIPIcs.ISAAC.2022.5
• Atsuya Hasegawa and François Le Gall An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes 10.4230/LIPIcs.ISAAC.2022.6
• Julián Mestre and Sergey Pupyrev Approximating the Minimum Logarithmic Arrangement Problem 10.4230/LIPIcs.ISAAC.2022.7
• Zachary Friggstad and Ramin Mousavi Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP 10.4230/LIPIcs.ISAAC.2022.8
• Gianlorenzo D'Angelo, Esmaeil Delfaraz, and Hugo Gilbert Budgeted Out-Tree Maximization with Submodular Prizes 10.4230/LIPIcs.ISAAC.2022.9
• Kyle Fox, Hongyao Huang, and Benjamin Raichel Clustering with Faulty Centers 10.4230/LIPIcs.ISAAC.2022.10
• Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, and Alexandre Vigny Combinatorial and Algorithmic Aspects of Monadic Stability 10.4230/LIPIcs.ISAAC.2022.11
• 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 10.4230/LIPIcs.ISAAC.2022.12
• Kyle Fox and Thomas Stanley Computation of Cycle Bases in Surface Embedded Graphs 10.4230/LIPIcs.ISAAC.2022.13
• 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 10.4230/LIPIcs.ISAAC.2022.14
• Takuya Mieno, Mitsuru Funakoshi, and Shunsuke Inenaga Computing Palindromes on a Trie in Linear Time 10.4230/LIPIcs.ISAAC.2022.15
• Yossi Azar, Eldad Peretz, and Noam Touitou Distortion-Oblivious Algorithms for Scheduling on Multiple Machines 10.4230/LIPIcs.ISAAC.2022.16
• Sándor P. Fekete, Peter Kramer, Christian Rieck, Christian Scheffer, and Arne Schmidt Efficiently Reconfiguring a Connected Swarm of Labeled Robots 10.4230/LIPIcs.ISAAC.2022.17
• Maciej Skorski Entropy Matters: Understanding Performance of Sparse Random Embeddings 10.4230/LIPIcs.ISAAC.2022.18
• Konstantinos Georgiou, Nikos Giachoudis, and Evangelos Kranakis Evacuation from a Disk for Robots with Asymmetric Communication 10.4230/LIPIcs.ISAAC.2022.19
• Tatsuya Gima and Yota Otachi Extended MSO Model Checking via Small Vertex Integrity 10.4230/LIPIcs.ISAAC.2022.20
• Rathish Das, John Iacono, and Yakov Nekrich External-Memory Dictionaries with Worst-Case Update Cost 10.4230/LIPIcs.ISAAC.2022.21
• Felicia Lucke, Daniël Paulusma, and Bernard Ries Finding Matching Cuts in H-Free Graphs 10.4230/LIPIcs.ISAAC.2022.22
• Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný, and Michael Kaufmann Graph Product Structure for h-Framed Graphs 10.4230/LIPIcs.ISAAC.2022.23
• Tatiana Belova and Ivan Bliznets Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy 10.4230/LIPIcs.ISAAC.2022.24
• Peyman Afshani, Rasmus Killmann, and Kasper Green Larsen Hierarchical Categories in Colored Searching 10.4230/LIPIcs.ISAAC.2022.25
• Junbin Fang, Dominique Unruh, Jun Yan, and Dehua Zhou How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment? 10.4230/LIPIcs.ISAAC.2022.26
• Shay Mozes, Nathan Wallheimer, and Oren Weimann Improved Compression of the Okamura-Seymour Metric 10.4230/LIPIcs.ISAAC.2022.27
• Ya-Chun Liang, Kazuo Iwama, and Chung-Shou Liao Improving the Bounds of the Online Dynamic Power Management Problem 10.4230/LIPIcs.ISAAC.2022.28
• Kazuyuki Amano Integer Complexity and Mixed Binary-Ternary Representation 10.4230/LIPIcs.ISAAC.2022.29
• Pavel Dvořák, Tomáš Masařík, Jana Novotná, Monika Krawczyk, Paweł Rzążewski, and Aneta Żuk List Locally Surjective Homomorphisms in Hereditary Graph Classes 10.4230/LIPIcs.ISAAC.2022.30
• Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, and David Schindl Locally Checkable Problems Parameterized by Clique-Width 10.4230/LIPIcs.ISAAC.2022.31
• Lily Chung, Erik D. Demaine, Dylan Hendrickson, and Jayson Lynch Lower Bounds on Retroactive Data Structures 10.4230/LIPIcs.ISAAC.2022.32
• Xiangyu Guo, Kelin Luo, Shi Li, and Yuhao Zhang Minimizing the Maximum Flow Time in the Online Food Delivery Problem 10.4230/LIPIcs.ISAAC.2022.33
• Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, and Anaïs Villedieu Minimum Link Fencing 10.4230/LIPIcs.ISAAC.2022.34
• Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, and Erin Taylor Multi-Robot Motion Planning for Unit Discs with Revolving Areas 10.4230/LIPIcs.ISAAC.2022.35
• Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, and Seeun William Umboh Nested Active-Time Scheduling 10.4230/LIPIcs.ISAAC.2022.36
• Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki, and Hinano Takeuchi On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding 10.4230/LIPIcs.ISAAC.2022.37
• Ferdinando Cicalese, Clément Dallard, and Martin Milanič On Constrained Intersection Representations of Graphs and Digraphs 10.4230/LIPIcs.ISAAC.2022.38
• Akanksha Agrawal, Soumita Hait, and Amer E. Mouawad On Finding Short Reconfiguration Sequences Between Independent Sets 10.4230/LIPIcs.ISAAC.2022.39
• Maël Dumas, Florent Foucaud, Anthony Perez, and Ioan Todinca On Graphs Coverable by k Shortest Paths 10.4230/LIPIcs.ISAAC.2022.40
• Benjamin Qi On Maximizing Sums of Non-Monotone Submodular and Linear Functions 10.4230/LIPIcs.ISAAC.2022.41
• Pankaj K. Agarwal, Matthew J. Katz, and Micha Sharir On Reverse Shortest Paths in Geometric Proximity Graphs 10.4230/LIPIcs.ISAAC.2022.42
• Jakob Dyrseth and Paloma T. Lima On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs 10.4230/LIPIcs.ISAAC.2022.43
• Tatsuya Akutsu, Tomoya Mori, Naotoshi Nakamura, Satoshi Kozawa, Yuhei Ueno, and Thomas N. Sato On the Complexity of Tree Edit Distance with Variables 10.4230/LIPIcs.ISAAC.2022.44
• Sandip Das and Harmender Gahlawat On the Cop Number of String Graphs 10.4230/LIPIcs.ISAAC.2022.45
• Naoto Ohsaka On the Parameterized Intractability of Determinant Maximization 10.4230/LIPIcs.ISAAC.2022.46
• Yusuke Kobayashi and Tatsuya Terao One-Face Shortest Disjoint Paths with a Deviation Terminal 10.4230/LIPIcs.ISAAC.2022.47
• Eunou Lee Optimizing Quantum Circuit Parameters via SDP 10.4230/LIPIcs.ISAAC.2022.48
• Thomas Erlebach, Kelin Luo, and Frits C.R. Spieksma Package Delivery Using Drones with Restricted Movement Areas 10.4230/LIPIcs.ISAAC.2022.49
• Jianqi Zhou, Peihua Li, and Jiong Guo Parameterized Approximation Algorithms for TSP 10.4230/LIPIcs.ISAAC.2022.50
• Miriam Münch, Ignaz Rutter, and Peter Stumpf Partial and Simultaneous Transitive Orientations via Modular Decompositions 10.4230/LIPIcs.ISAAC.2022.51
• Vladimir Podolskii and Nikolay V. Proskurin Polynomial Threshold Functions for Decision Lists 10.4230/LIPIcs.ISAAC.2022.52
• Paul Lapey and Aaron Williams Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time 10.4230/LIPIcs.ISAAC.2022.53
• Kushagra Chatterjee and Prajakta Nimbhorkar Popular Edges with Critical Nodes 10.4230/LIPIcs.ISAAC.2022.54
• Yusuke Kobayashi and Ryoga Mahara Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average 10.4230/LIPIcs.ISAAC.2022.55
• Prosenjit Bose, Jean-Lou De Carufel, and Thomas Shermer Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor 10.4230/LIPIcs.ISAAC.2022.56
• Shangqi Lu and Yufei Tao Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights 10.4230/LIPIcs.ISAAC.2022.57
• Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, and Frank Staals Segment Visibility Counting Queries in Polygons 10.4230/LIPIcs.ISAAC.2022.58
• Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, and Kaiyu Wu Shortest Beer Path Queries in Interval Graphs 10.4230/LIPIcs.ISAAC.2022.59
• Sungmin Kim, Sang-Ki Ko, and Yo-Sub Han Simon’s Congruence Pattern Matching 10.4230/LIPIcs.ISAAC.2022.60
• Sung-Hwan Kim and Hwan-Gue Cho Simple Order-Isomorphic Matching Index with Expected Compact Space 10.4230/LIPIcs.ISAAC.2022.61
• Frank Kammer and Johannes Meintrup Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings 10.4230/LIPIcs.ISAAC.2022.62
• Ta-Wei Tu Subquadratic Weighted Matroid Intersection Under Rank Oracles 10.4230/LIPIcs.ISAAC.2022.63
• Joel D. Day, Maria Kosche, Florin Manea, and Markus L. Schmid Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems 10.4230/LIPIcs.ISAAC.2022.64
• William L. Holland Succinct List Indexing in Optimal Time 10.4230/LIPIcs.ISAAC.2022.65
• Artur Ignatiev, Ivan Mihajlin, and Alexander Smal Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games 10.4230/LIPIcs.ISAAC.2022.66
• Christian Rieck and Christian Scheffer The Dispersive Art Gallery Problem 10.4230/LIPIcs.ISAAC.2022.67