LIPIcs, Volume 181, ISAAC 2020

• Yixin Cao, Siu-Wing Cheng, and Minming Li LIPIcs, Volume 181, ISAAC 2020, Complete Volume 10.4230/LIPIcs.ISAAC.2020
• Yixin Cao, Siu-Wing Cheng, and Minming Li Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ISAAC.2020.0
• Sang-il Oum How to Decompose a Graph into a Tree-Like Structure (Invited Talk) 10.4230/LIPIcs.ISAAC.2020.1
• Ke Yi Worst-Case Optimal Join Algorithms (Invited Talk) 10.4230/LIPIcs.ISAAC.2020.2
• Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, and Nikolaos Melissinos (In)approximability of Maximum Minimal FVS 10.4230/LIPIcs.ISAAC.2020.3
• Anadi Agrawal and Paweł Gawrychowski A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem 10.4230/LIPIcs.ISAAC.2020.4
• Qilong Feng, Zhen Zhang, Ziyun Huang, Jinhui Xu, and Jianxin Wang A Unified Framework of FPT Approximation Algorithms for Clustering Problems 10.4230/LIPIcs.ISAAC.2020.5
• Yoshifumi Sakai and Shunsuke Inenaga A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length 10.4230/LIPIcs.ISAAC.2020.6
• Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, and Bodhayan Roy Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs 10.4230/LIPIcs.ISAAC.2020.7
• Guido Brückner and Ignaz Rutter An SPQR-Tree-Like Embedding Representation for Level Planarity 10.4230/LIPIcs.ISAAC.2020.8
• Joachim Gudmundsson, Yuan Sha, and Sampson Wong Approximating the Packedness of Polygonal Curves 10.4230/LIPIcs.ISAAC.2020.9
• Haozhou Pang and Mohammad R. Salavatipour Approximation Algorithms for Generalized Path Scheduling 10.4230/LIPIcs.ISAAC.2020.10
• Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, and Mohammad R. Salavatipour Approximations for Throughput Maximization 10.4230/LIPIcs.ISAAC.2020.11
• Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, and Lillian Zhang Arithmetic Expression Construction 10.4230/LIPIcs.ISAAC.2020.12
• Marc van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, and Jordi L. Vermeulen Between Shapes, Using the Hausdorff Distance 10.4230/LIPIcs.ISAAC.2020.13
• Trung Thanh Nguyen and Jörg Rothe Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs 10.4230/LIPIcs.ISAAC.2020.14
• Takao Asano and Hiroyuki Umeda Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts 10.4230/LIPIcs.ISAAC.2020.15
• Wolfgang Mulzer and Max Willert Compact Routing in Unit Disk Graphs 10.4230/LIPIcs.ISAAC.2020.16
• Josh Brunner, Erik D. Demaine, Dylan Hendrickson, and Julian Wellman Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard 10.4230/LIPIcs.ISAAC.2020.17
• Martin Koutecký and Johannes Zink Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines 10.4230/LIPIcs.ISAAC.2020.18
• Fabian Frei, Edith Hemaspaandra, and Jörg Rothe Complexity of Stability 10.4230/LIPIcs.ISAAC.2020.19
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer Computing Dense and Sparse Subgraphs of Weakly Closed Graphs 10.4230/LIPIcs.ISAAC.2020.20
• Kangsan Kim, Yongho Shin, and Hyung-Chan An Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem 10.4230/LIPIcs.ISAAC.2020.21
• Walter Kern and Daniël Paulusma Contracting to a Longest Path in H-Free Graphs 10.4230/LIPIcs.ISAAC.2020.22
• Bartłomiej Dudek and Paweł Gawrychowski Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs 10.4230/LIPIcs.ISAAC.2020.23
• Sanjana Dey, Florent Foucaud, Subhas C. Nandy, and Arunabha Sen Discriminating Codes in Geometric Setups 10.4230/LIPIcs.ISAAC.2020.24
• Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, and Kaiyu Wu Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees 10.4230/LIPIcs.ISAAC.2020.25
• Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, and Danil Sagunov Diverse Pairs of Matchings 10.4230/LIPIcs.ISAAC.2020.26
• Maciej Dulęba, Paweł Gawrychowski, and Wojciech Janczewski Efficient Labeling for Reachability in Directed Acyclic Graphs 10.4230/LIPIcs.ISAAC.2020.27
• Stefan Funke and Felix Weitbrecht Efficiently Computing All Delaunay Triangles Occurring over All Contiguous Subsequences 10.4230/LIPIcs.ISAAC.2020.28
• Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, and Srinivasa Rao Satti Enumerating Range Modes 10.4230/LIPIcs.ISAAC.2020.29
• Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche Finding Temporal Paths Under Waiting Time Constraints 10.4230/LIPIcs.ISAAC.2020.30
• Peter Bradshaw, Tomáš Masařk, and Ladislav Stacho Flexible List Colorings in Graphs with Special Degeneracy Conditions 10.4230/LIPIcs.ISAAC.2020.31
• Boris Aronov and Jean Cardinal Geometric Pattern Matching Reduces to k-SUM 10.4230/LIPIcs.ISAAC.2020.32
• Joep Hamersma, Marc van Kreveld, Yushi Uno, and Tom C. van der Zanden Gourds: A Sliding-Block Puzzle with Turning 10.4230/LIPIcs.ISAAC.2020.33
• Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, and Saket Saurabh Improved FPT Algorithms for Deletion to Forest-Like Structures 10.4230/LIPIcs.ISAAC.2020.34
• Sung-Hwan Kim and Hwan-Gue Cho Indexing Isodirectional Pointer Sequences 10.4230/LIPIcs.ISAAC.2020.35
• Matthias Bentert, Klaus Heeger, and Dušan Knop Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters 10.4230/LIPIcs.ISAAC.2020.36
• Nicolas Bousquet, Alice Joffard, and Paul Ouvrard Linear Transformations Between Dominating Sets in the TAR-Model 10.4230/LIPIcs.ISAAC.2020.37
• Loukas Georgiadis and Evangelos Kosinas Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems 10.4230/LIPIcs.ISAAC.2020.38
• Kristóf Bérczi, Naonori Kakimura, and Yusuke Kobayashi Market Pricing for Matroid Rank Valuations 10.4230/LIPIcs.ISAAC.2020.39
• Yuma Tamura, Takehiro Ito, and Xiao Zhou Minimization and Parameterized Variants of Vertex Partition Problems on Graphs 10.4230/LIPIcs.ISAAC.2020.40
• Nikhil Kumar Multicommodity Flows in Planar Graphs with Demands on Faces 10.4230/LIPIcs.ISAAC.2020.41
• Ke Chen and Adrian Dumitrescu Multiparty Selection 10.4230/LIPIcs.ISAAC.2020.42
• Till Fluschnik, Rolf Niedermeier, Carsten Schubert, and Philipp Zschoche Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs 10.4230/LIPIcs.ISAAC.2020.43
• Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, and Amer E. Mouawad On Girth and the Parameterized Complexity of Token Sliding and Token Jumping 10.4230/LIPIcs.ISAAC.2020.44
• Nguyễn Kim Thắng Online Primal-Dual Algorithms with Configuration Linear Programs 10.4230/LIPIcs.ISAAC.2020.45
• Umang Bhaskar and Gunjan Kumar Partial Function Extension with Applications to Learning and Property Testing 10.4230/LIPIcs.ISAAC.2020.46
• Nai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, and Chunhao Wang Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension 10.4230/LIPIcs.ISAAC.2020.47
• Philip Bille and Inge Li Gørtz Random Access in Persistent Strings 10.4230/LIPIcs.ISAAC.2020.48
• William L. Holland, Anthony Wirth, and Justin Zobel Recency Queries with Succinct Representation 10.4230/LIPIcs.ISAAC.2020.49
• Erik D. Demaine, Justin Kopinsky, and Jayson Lynch Recursed Is Not Recursive: A Jarring Result 10.4230/LIPIcs.ISAAC.2020.50
• Pedro Montealegre, Diego Ramírez-Romero, and Ivan Rapaport Shared vs Private Randomness in Distributed Interactive Proofs 10.4230/LIPIcs.ISAAC.2020.51
• Eunjin Oh Shortest-Path Queries in Geometric Networks 10.4230/LIPIcs.ISAAC.2020.52
• Angel A. Cantu, Austin Luchsinger, Robert Schweller, and Tim Wylie Signal Passing Self-Assembly Simulates Tile Automata 10.4230/LIPIcs.ISAAC.2020.53
• Kei Uchizawa Size, Depth and Energy of Threshold Circuits Computing Parity Function 10.4230/LIPIcs.ISAAC.2020.54
• Anthony Labarre Sorting by Prefix Block-Interchanges 10.4230/LIPIcs.ISAAC.2020.55
• Xuangui Huang Space Hardness of Solving Structured Linear Systems 10.4230/LIPIcs.ISAAC.2020.56
• Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth Sparse Hop Spanners for Unit Disk Graphs 10.4230/LIPIcs.ISAAC.2020.57
• Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, and Paweł Rzążewski Sparsification Lower Bounds for List H-Coloring 10.4230/LIPIcs.ISAAC.2020.58
• Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, and Manuel Sorge The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs 10.4230/LIPIcs.ISAAC.2020.59
• Mark de Berg, Aleksandar Markovic, and Seeun William Umboh The Online Broadcast Range-Assignment Problem 10.4230/LIPIcs.ISAAC.2020.60
• Predrag Krnetić, Darya Melnyk, Yuyi Wang, and Roger Wattenhofer The k-Server Problem with Delays on the Uniform Metric Space 10.4230/LIPIcs.ISAAC.2020.61
• Jungho Ahn, Eun Jung Kim, and Euiwoong Lee Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion 10.4230/LIPIcs.ISAAC.2020.62
• Amihood Amir and Itai Boneh Update Query Time Trade-Off for Dynamic Suffix Arrays 10.4230/LIPIcs.ISAAC.2020.63
• Richard Santiago and Yuichi Yoshida Weakly Submodular Function Maximization Using Local Submodularity Ratio 10.4230/LIPIcs.ISAAC.2020.64
• Taku Onodera and Tetsuo Shibuya Wear Leveling Revisited 10.4230/LIPIcs.ISAAC.2020.65