LIPIcs, Volume 212, ISAAC 2021

• Hee-Kap Ahn and Kunihiko Sadakane LIPIcs, Volume 212, ISAAC 2021, Complete Volume 10.4230/LIPIcs.ISAAC.2021
• Hee-Kap Ahn and Kunihiko Sadakane Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ISAAC.2021.0
• Tatiana Starikovskaya Streaming Pattern Matching (Invited Talk) 10.4230/LIPIcs.ISAAC.2021.1
• Prosenjit Bose Spanning Properties of Variants of the Delaunay Graph (Invited Talk) 10.4230/LIPIcs.ISAAC.2021.2
• Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, and Micha Sharir Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model 10.4230/LIPIcs.ISAAC.2021.3
• Michael Matheny and Jeff M. Phillips Approximate Maximum Halfspace Discrepancy 10.4230/LIPIcs.ISAAC.2021.4
• Matt Gibson-Lopez and Zhongxiu Yang The VC-Dimension of Limited Visibility Terrains 10.4230/LIPIcs.ISAAC.2021.5
• Hongyao Huang, Georgiy Klimenko, and Benjamin Raichel Clustering with Neighborhoods 10.4230/LIPIcs.ISAAC.2021.6
• Ahmad Biniaz Approximating Longest Spanning Tree with Neighborhoods 10.4230/LIPIcs.ISAAC.2021.7
• Siu-Wing Cheng and Man Ting Wong Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions 10.4230/LIPIcs.ISAAC.2021.8
• Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, and Christian Scheffer Connected Coordinated Motion Planning with Bounded Stretch 10.4230/LIPIcs.ISAAC.2021.9
• Patrick Schnider Enclosing Depth and Other Depth Measures 10.4230/LIPIcs.ISAAC.2021.10
• Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, and Paweł Żyliński Illuminating the x-Axis by α-Floodlights 10.4230/LIPIcs.ISAAC.2021.11
• Aritra Banik, Rajiv Raman, and Saurabh Ray On Geometric Priority Set Cover Problems 10.4230/LIPIcs.ISAAC.2021.12
• Patrick Schnider The Complexity of Sharing a Pizza 10.4230/LIPIcs.ISAAC.2021.13
• Sarita de Berg and Frank Staals Dynamic Data Structures for k-Nearest Neighbor Queries 10.4230/LIPIcs.ISAAC.2021.14
• Florian Barth, Stefan Funke, and Claudius Proissl Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets 10.4230/LIPIcs.ISAAC.2021.15
• Sam Barr and Therese Biedl Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest 10.4230/LIPIcs.ISAAC.2021.16
• Mathew C. Francis, Pavol Hell, and Dalu Jacob On the Kernel and Related Problems in Interval Digraphs 10.4230/LIPIcs.ISAAC.2021.17
• Soh Kumabe Interval Query Problem on Cube-Free Median Graphs 10.4230/LIPIcs.ISAAC.2021.18
• Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, and Hsiang-Yun Wu Untangling Circular Drawings: Algorithms and Complexity 10.4230/LIPIcs.ISAAC.2021.19
• Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, and Veli Mäkinen Algorithms and Complexity on Indexing Elastic Founder Graphs 10.4230/LIPIcs.ISAAC.2021.20
• Christoph Brause, Petr Golovach, Barnaby Martin, Daniël Paulusma, and Siani Smith Partitioning H-Free Graphs of Bounded Diameter 10.4230/LIPIcs.ISAAC.2021.21
• Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, and Leonidas Theocharous Clique-Based Separators for Geometric Intersection Graphs 10.4230/LIPIcs.ISAAC.2021.22
• Jacob Evald, Viktor Fredslund-Hansen, and Christian Wulff-Nilsen Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs 10.4230/LIPIcs.ISAAC.2021.23
• Markus Anders, Jendrik Brachter, and Pascal Schweitzer A Characterization of Individualization-Refinement Trees 10.4230/LIPIcs.ISAAC.2021.24
• Viktor Fredslund-Hansen, Shay Mozes, and Christian Wulff-Nilsen Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs 10.4230/LIPIcs.ISAAC.2021.25
• Anna Małafiejska, Michał Małafiejski, Krzysztof M. Ocetkiewicz, and Krzysztof Pastuszak Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees 10.4230/LIPIcs.ISAAC.2021.26
• Amotz Bar-Noy, David Peleg, Dror Rawitz, and Elad Yehezkel Selected Neighbor Degree Forest Realization 10.4230/LIPIcs.ISAAC.2021.27
• Sotiris Nikoletseas, Christoforos Raptopoulos, and Paul Spirakis MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems 10.4230/LIPIcs.ISAAC.2021.28
• Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, and Louise Molitor The Impact of Geometry on Monochrome Regions in the Flip Schelling Process 10.4230/LIPIcs.ISAAC.2021.29
• Franz Aurenhammer, Evanthia Papadopoulou, and Martin Suderland Piecewise-Linear Farthest-Site Voronoi Diagrams 10.4230/LIPIcs.ISAAC.2021.30
• Mitchell Black and William Maxwell Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm 10.4230/LIPIcs.ISAAC.2021.31
• Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, and Vaishali Surianarayanan Anonymity-Preserving Space Partitions 10.4230/LIPIcs.ISAAC.2021.32
• Shibo Li and Dominik Scheder Impatient PPSZ - A Faster Algorithm for CSP 10.4230/LIPIcs.ISAAC.2021.33
• Michael Lampis and Valia Mitsou Fine-Grained Meta-Theorems for Vertex Integrity 10.4230/LIPIcs.ISAAC.2021.34
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer Essentially Tight Kernels For (Weakly) Closed Graphs 10.4230/LIPIcs.ISAAC.2021.35
• Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, and Nikolaos Melissinos Filling Crosswords Is Very Hard 10.4230/LIPIcs.ISAAC.2021.36
• Siddharth Gupta, Guy Sa'ar, and Meirav Zehavi Grid Recognition: Classical and Parameterized Computational Perspectives 10.4230/LIPIcs.ISAAC.2021.37
• Joseph Cheriyan, Robert Cummings, Jack Dippel, and Jasper Zhu An Improved Approximation Algorithm for the Matching Augmentation Problem 10.4230/LIPIcs.ISAAC.2021.38
• Qian-Ping Gu and JiaJian Liang Multimodal Transportation with Ridesharing of Personal Vehicles 10.4230/LIPIcs.ISAAC.2021.39
• Eloi Araujo, Luiz C. Rozante, Diego P. Rubert, and Fábio V. Martinez Algorithms for Normalized Multiple Sequence Alignments 10.4230/LIPIcs.ISAAC.2021.40
• Marzieh Eskandari, Bhavika Khare, and Nirman Kumar Separated Red Blue Center Clustering 10.4230/LIPIcs.ISAAC.2021.41
• Julián Mestre, Sergey Pupyrev, and Seeun William Umboh On the Extended TSP Problem 10.4230/LIPIcs.ISAAC.2021.42
• Claire Mathieu and Hang Zhou Probabilistic Analysis of Euclidean Capacitated Vehicle Routing 10.4230/LIPIcs.ISAAC.2021.43
• Sayan Bandyapadhyay, Anil Maheshwari, and Michiel Smid Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane 10.4230/LIPIcs.ISAAC.2021.44
• Joachim Gudmundsson, Yuan Sha, and Fan Yao Augmenting Graphs to Minimize the Radius 10.4230/LIPIcs.ISAAC.2021.45
• Kyungjin Cho and Eunjin Oh Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces 10.4230/LIPIcs.ISAAC.2021.46
• Shinwoo An and Eunjin Oh Feedback Vertex Set on Geometric Intersection Graphs 10.4230/LIPIcs.ISAAC.2021.47
• Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, and Ge Xia Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time 10.4230/LIPIcs.ISAAC.2021.48
• Yongho Shin and Hyung-Chan An Making Three out of Two: Three-Way Online Correlated Selection 10.4230/LIPIcs.ISAAC.2021.49
• Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, and Kazuo Iwama Tight Competitive Analyses of Online Car-Sharing Problems 10.4230/LIPIcs.ISAAC.2021.50
• Antonios Antoniadis, Gunjan Kumar, and Nikhil Kumar Skeletons and Minimum Energy Scheduling 10.4230/LIPIcs.ISAAC.2021.51
• Susanne Albers, Waldo Gálvez, and Maximilian Janke Machine Covering in the Random-Order Model 10.4230/LIPIcs.ISAAC.2021.52
• Noam Touitou Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay 10.4230/LIPIcs.ISAAC.2021.53
• Eric Allender, John Gouwar, Shuichi Hirahara, and Caleb Robelle Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity 10.4230/LIPIcs.ISAAC.2021.54
• Clément L. Canonne and Karl Wimmer Identity Testing Under Label Mismatch 10.4230/LIPIcs.ISAAC.2021.55
• Tali Kaufman and David Mass Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion 10.4230/LIPIcs.ISAAC.2021.56
• Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, and Sunil Shende Group Evacuation on a Line by Agents with Different Communication Abilities 10.4230/LIPIcs.ISAAC.2021.57
• François Le Gall and Masayuki Miyamoto Lower Bounds for Induced Cycle Detection in Distributed Computing 10.4230/LIPIcs.ISAAC.2021.58
• Andrzej Czygrinow, Michał Hanćkowiak, and Marcin Witkowski Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion 10.4230/LIPIcs.ISAAC.2021.59
• Dhrumil Patel and Rahul Shah Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space 10.4230/LIPIcs.ISAAC.2021.60
• Rathish Das, Andrea Lincoln, Jayson Lynch, and J. Ian Munro Dynamic Boolean Formula Evaluation 10.4230/LIPIcs.ISAAC.2021.61
• Joyce Bacic, Saeed Mehrabi, and Michiel Smid Shortest Beer Path Queries in Outerplanar Graphs 10.4230/LIPIcs.ISAAC.2021.62
• Sujoy Bhore and Rahul Jain Space-Efficient Algorithms for Reachability in Directed Geometric Graphs 10.4230/LIPIcs.ISAAC.2021.63
• Paolo Ferragina, Giovanni Manzini, and Giorgio Vinciguerra Repetition- and Linearity-Aware Rank/Select Dictionaries 10.4230/LIPIcs.ISAAC.2021.64
• Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, and Jakub Radoszewski Pattern Masking for Dictionary Matching 10.4230/LIPIcs.ISAAC.2021.65
• Luciano Gualà, Stefano Leucci, and Isabella Ziccardi Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 10.4230/LIPIcs.ISAAC.2021.66
• Shuhao Tan Computing Shapley Values for Mean Width in 3-D 10.4230/LIPIcs.ISAAC.2021.67
• Takao Asano Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts 10.4230/LIPIcs.ISAAC.2021.68
• Shaojie Tang and Jing Yuan Adaptive Regularized Submodular Maximization 10.4230/LIPIcs.ISAAC.2021.69
• Donggyu Kim, Duksang Lee, and Sang-il Oum Γ-Graphic Delta-Matroids and Their Applications 10.4230/LIPIcs.ISAAC.2021.70
• Yu Yokoi An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints 10.4230/LIPIcs.ISAAC.2021.71
• Julian Enoch, Kyle Fox, Dor Mesica, and Shay Mozes A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities 10.4230/LIPIcs.ISAAC.2021.72
• Leyla Biabani, Mark de Berg, and Morteza Monemizadeh Maximum-Weight Matching in Sliding Windows and Beyond 10.4230/LIPIcs.ISAAC.2021.73
• Atsuya Hasegawa and François Le Gall Quantum Advantage with Shallow Circuits Under Arbitrary Corruption 10.4230/LIPIcs.ISAAC.2021.74