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