<h2>LIPIcs, Volume 149, ISAAC 2019</h2>
<ul>
<li>
<span class="authors">Pinyan Lu and Guochuan Zhang</span>
<span class="title">LIPIcs, Volume 149, ISAAC'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019">10.4230/LIPIcs.ISAAC.2019</a>
</li>
<li>
<span class="authors">Pinyan Lu and Guochuan Zhang</span>
<span class="title">Front Matter, Table of Contents, Preface, Symposium Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.0">10.4230/LIPIcs.ISAAC.2019.0</a>
</li>
<li>
<span class="authors">Yixin Cao, Zhifeng Wang, Guozhen Rong, and Jianxin Wang</span>
<span class="title">Graph Searches and Their End Vertices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.1">10.4230/LIPIcs.ISAAC.2019.1</a>
</li>
<li>
<span class="authors">Nader H. Bshouty</span>
<span class="title">Lower Bound for Non-Adaptive Estimation of the Number of Defective Items</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.2">10.4230/LIPIcs.ISAAC.2019.2</a>
</li>
<li>
<span class="authors">Kazuya Haraguchi and Hiroshi Nagamochi</span>
<span class="title">A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.3">10.4230/LIPIcs.ISAAC.2019.3</a>
</li>
<li>
<span class="authors">Philip Bille, Paweł Gawrychowski, Inge Li Gørtz, Gad M. Landau, and Oren Weimann</span>
<span class="title">Top Tree Compression of Tries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.4">10.4230/LIPIcs.ISAAC.2019.4</a>
</li>
<li>
<span class="authors">Ahad N. Zehmakan</span>
<span class="title">Two Phase Transitions in Two-Way Bootstrap Percolation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.5">10.4230/LIPIcs.ISAAC.2019.5</a>
</li>
<li>
<span class="authors">Moses Ganardi, Danny Hucke, Markus Lohrey, and Tatiana Starikovskaya</span>
<span class="title">Sliding Window Property Testing for Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.6">10.4230/LIPIcs.ISAAC.2019.6</a>
</li>
<li>
<span class="authors">Isaac Goldstein, Moshe Lewenstein, and Ely Porat</span>
<span class="title">On the Hardness of Set Disjointness and Set Intersection with Bounded Universe</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.7">10.4230/LIPIcs.ISAAC.2019.7</a>
</li>
<li>
<span class="authors">Paola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, and Masafumi Yamashita</span>
<span class="title">Gathering and Election by Mobile Robots in a Continuous Cycle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.8">10.4230/LIPIcs.ISAAC.2019.8</a>
</li>
<li>
<span class="authors">Koki Hamada, Shuichi Miyazaki, and Hiroki Yanagisawa</span>
<span class="title">Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.9">10.4230/LIPIcs.ISAAC.2019.9</a>
</li>
<li>
<span class="authors">David Naori and Danny Raz</span>
<span class="title">Online Multidimensional Packing Problems in the Random-Order Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.10">10.4230/LIPIcs.ISAAC.2019.10</a>
</li>
<li>
<span class="authors">R. Inkulu and Sanjiv Kapoor</span>
<span class="title">Approximate Euclidean Shortest Paths in Polygonal Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.11">10.4230/LIPIcs.ISAAC.2019.11</a>
</li>
<li>
<span class="authors">Rahul Jain and Raghunath Tewari</span>
<span class="title">Reachability in High Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.12">10.4230/LIPIcs.ISAAC.2019.12</a>
</li>
<li>
<span class="authors">Ruben Brokkelkamp, Sven Polak, Guido Schäfer, and Yllka Velaj</span>
<span class="title">Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.13">10.4230/LIPIcs.ISAAC.2019.13</a>
</li>
<li>
<span class="authors">Marcin Bienkowski, Łukasz Jeż, and Paweł Schmidt</span>
<span class="title">Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.14">10.4230/LIPIcs.ISAAC.2019.14</a>
</li>
<li>
<span class="authors">Gordon Hoi and Frank Stephan</span>
<span class="title">Measure and Conquer for Max Hamming Distance XSAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.15">10.4230/LIPIcs.ISAAC.2019.15</a>
</li>
<li>
<span class="authors">Christophe Crespelle, Carl Feghali, and Petr A. Golovach</span>
<span class="title">Cyclability in Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.16">10.4230/LIPIcs.ISAAC.2019.16</a>
</li>
<li>
<span class="authors">Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, and Vladimir Podolskii</span>
<span class="title">Complexity of Linear Operators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.17">10.4230/LIPIcs.ISAAC.2019.17</a>
</li>
<li>
<span class="authors">Susanne Albers and Leon Ladewig</span>
<span class="title">New Results for the k-Secretary Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.18">10.4230/LIPIcs.ISAAC.2019.18</a>
</li>
<li>
<span class="authors">Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra</span>
<span class="title">Triangle Estimation Using Tripartite Independent Set Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.19">10.4230/LIPIcs.ISAAC.2019.19</a>
</li>
<li>
<span class="authors">Luca Becchetti, Emilio Cruciani, Francesco Pasquale, and Sara Rizzo</span>
<span class="title">Step-By-Step Community Detection in Volume-Regular Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.20">10.4230/LIPIcs.ISAAC.2019.20</a>
</li>
<li>
<span class="authors">Esther Galby, Paloma T. Lima, and Bernard Ries</span>
<span class="title">Blocking Dominating Sets for H-Free Graphs via Edge Contractions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.21">10.4230/LIPIcs.ISAAC.2019.21</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, and Tomasz Waleń</span>
<span class="title">Internal Dictionary Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.22">10.4230/LIPIcs.ISAAC.2019.22</a>
</li>
<li>
<span class="authors">Kyle Fox and Xinyi Li</span>
<span class="title">Approximating the Geometric Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.23">10.4230/LIPIcs.ISAAC.2019.23</a>
</li>
<li>
<span class="authors">Wei Chen and Binghui Peng</span>
<span class="title">On Adaptivity Gaps of Influence Maximization Under the Independent Cascade Model with Full-Adoption Feedback</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.24">10.4230/LIPIcs.ISAAC.2019.24</a>
</li>
<li>
<span class="authors">Sang Won Bae</span>
<span class="title">Minimum-Width Double-Strip and Parallelogram Annulus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.25">10.4230/LIPIcs.ISAAC.2019.25</a>
</li>
<li>
<span class="authors">Ziyun Huang, Qilong Feng, Jianxin Wang, and Jinhui Xu</span>
<span class="title">Small Candidate Set for Translational Pattern Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.26">10.4230/LIPIcs.ISAAC.2019.26</a>
</li>
<li>
<span class="authors">Binay Bhattacharya, Sandip Das, and Subhadeep Ranjan Dev</span>
<span class="title">The Weighted k-Center Problem in Trees for Fixed k</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.27">10.4230/LIPIcs.ISAAC.2019.27</a>
</li>
<li>
<span class="authors">Xin Han, Yasushi Kawase, Kazuhisa Makino, and Haruki Yokomaku</span>
<span class="title">Online Knapsack Problems with a Resource Buffer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.28">10.4230/LIPIcs.ISAAC.2019.28</a>
</li>
<li>
<span class="authors">Matthew Kahle, Minghao Tian, and Yusu Wang</span>
<span class="title">Local Cliques in ER-Perturbed Random Geometric Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.29">10.4230/LIPIcs.ISAAC.2019.29</a>
</li>
<li>
<span class="authors">Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, and André van Renssen</span>
<span class="title">Local Routing in Sparse and Lightweight Geometric Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.30">10.4230/LIPIcs.ISAAC.2019.30</a>
</li>
<li>
<span class="authors">Dominik Scheder, Shuyang Tang, and Jiaheng Zhang</span>
<span class="title">Searching for Cryptogenography Upper Bounds via Sum of Square Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.31">10.4230/LIPIcs.ISAAC.2019.31</a>
</li>
<li>
<span class="authors">Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, and Ryuhei Uehara</span>
<span class="title">On the Complexity of Lattice Puzzles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.32">10.4230/LIPIcs.ISAAC.2019.32</a>
</li>
<li>
<span class="authors">Lorenzo De Stefani</span>
<span class="title">The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.33">10.4230/LIPIcs.ISAAC.2019.33</a>
</li>
<li>
<span class="authors">Alessio Mazzetto, Andrea Pietracaprina, and Geppino Pucci</span>
<span class="title">Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.34">10.4230/LIPIcs.ISAAC.2019.34</a>
</li>
<li>
<span class="authors">Rolf Fagerberg, David Hammer, and Ulrich Meyer</span>
<span class="title">On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.35">10.4230/LIPIcs.ISAAC.2019.35</a>
</li>
<li>
<span class="authors">Sándor Kisfaludi-Bak, Dániel Marx, and Tom C. van der Zanden</span>
<span class="title">How Does Object Fatness Impact the Complexity of Packing in d Dimensions?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.36">10.4230/LIPIcs.ISAAC.2019.36</a>
</li>
<li>
<span class="authors">Mark de Berg, Sándor Kisfaludi-Bak, and Mehran Mehr</span>
<span class="title">On One-Round Discrete Voronoi Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.37">10.4230/LIPIcs.ISAAC.2019.37</a>
</li>
<li>
<span class="authors">V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay</span>
<span class="title">On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.38">10.4230/LIPIcs.ISAAC.2019.38</a>
</li>
<li>
<span class="authors">Thắng Nguyễn Kim</span>
<span class="title">A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.39">10.4230/LIPIcs.ISAAC.2019.39</a>
</li>
<li>
<span class="authors">Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">An Improved Data Structure for Left-Right Maximal Generic Words Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.40">10.4230/LIPIcs.ISAAC.2019.40</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, and Saket Saurabh</span>
<span class="title">Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.41">10.4230/LIPIcs.ISAAC.2019.41</a>
</li>
<li>
<span class="authors">Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, and Dror Rawitz</span>
<span class="title">The Generalized Microscopic Image Reconstruction Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.42">10.4230/LIPIcs.ISAAC.2019.42</a>
</li>
<li>
<span class="authors">Pál András Papp and Roger Wattenhofer</span>
<span class="title">Stabilization Time in Minority Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.43">10.4230/LIPIcs.ISAAC.2019.43</a>
</li>
<li>
<span class="authors">Robert Bredereck, Klaus Heeger, Dušan Knop, and Rolf Niedermeier</span>
<span class="title">Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.44">10.4230/LIPIcs.ISAAC.2019.44</a>
</li>
<li>
<span class="authors">Meng He and Serikzhan Kazi</span>
<span class="title">Path and Ancestor Queries over Trees with Multidimensional Weight Vectors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.45">10.4230/LIPIcs.ISAAC.2019.45</a>
</li>
<li>
<span class="authors">Yong Chen, Randy Goebel, Bing Su, Weitian Tong, Yao Xu, and An Zhang</span>
<span class="title">A 21/16-Approximation for the Minimum 3-Path Partition Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.46">10.4230/LIPIcs.ISAAC.2019.46</a>
</li>
<li>
<span class="authors">Amotz Bar-Noy, Keerti Choudhary, David Peleg, and Dror Rawitz</span>
<span class="title">Efficiently Realizing Interval Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.47">10.4230/LIPIcs.ISAAC.2019.47</a>
</li>
<li>
<span class="authors">Graham Cormode and Chris Hickey</span>
<span class="title">Efficient Interactive Proofs for Linear Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.48">10.4230/LIPIcs.ISAAC.2019.48</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, and Rémi Watrigant</span>
<span class="title">When Maximum Stable Set Can Be Solved in FPT Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.49">10.4230/LIPIcs.ISAAC.2019.49</a>
</li>
<li>
<span class="authors">Hugo Alves Akitaya, Maike Buchin, Leonie Ryvkin, and Jérôme Urhausen</span>
<span class="title">The k-Fréchet Distance: How to Walk Your Dog While Teleporting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.50">10.4230/LIPIcs.ISAAC.2019.50</a>
</li>
<li>
<span class="authors">Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen Kobourov, Pedro Matias, and Valentin Polishchuk</span>
<span class="title">New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.51">10.4230/LIPIcs.ISAAC.2019.51</a>
</li>
<li>
<span class="authors">Fabian Frei and Koichi Wada</span>
<span class="title">Efficient Circuit Simulation in MapReduce</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.52">10.4230/LIPIcs.ISAAC.2019.52</a>
</li>
<li>
<span class="authors">Abdolhamid Ghodselahi, Fabian Kuhn, and Volker Turau</span>
<span class="title">Concurrent Distributed Serving with Mobile Servers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.53">10.4230/LIPIcs.ISAAC.2019.53</a>
</li>
<li>
<span class="authors">David Eppstein, Michael T. Goodrich, James A. Liu, and Pedro Matias</span>
<span class="title">Tracking Paths in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.54">10.4230/LIPIcs.ISAAC.2019.54</a>
</li>
<li>
<span class="authors">Hugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, and Carola Wenk</span>
<span class="title">Distance Measures for Embedded Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.55">10.4230/LIPIcs.ISAAC.2019.55</a>
</li>
<li>
<span class="authors">Philip Dasler and David M. Mount</span>
<span class="title">Online Algorithms for Warehouse Management</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.56">10.4230/LIPIcs.ISAAC.2019.56</a>
</li>
<li>
<span class="authors">Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, and Bryce Sandlund</span>
<span class="title">On Approximate Range Mode and Range Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.57">10.4230/LIPIcs.ISAAC.2019.57</a>
</li>
<li>
<span class="authors">John Iacono, Ben Karsin, and Grigorios Koumoutsos</span>
<span class="title">External Memory Planar Point Location with Fast Updates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.58">10.4230/LIPIcs.ISAAC.2019.58</a>
</li>
<li>
<span class="authors">Serge Gaspers and Joshua Lau</span>
<span class="title">Minimizing and Computing the Inverse Geodesic Length on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.59">10.4230/LIPIcs.ISAAC.2019.59</a>
</li>
<li>
<span class="authors">Narthana S. Epa, Junhao Gan, and Anthony Wirth</span>
<span class="title">Result-Sensitive Binary Search with Noisy Information</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.60">10.4230/LIPIcs.ISAAC.2019.60</a>
</li>
<li>
<span class="authors">Qilong Feng, Zhen Zhang, Ziyun Huang, Jinhui Xu, and Jianxin Wang</span>
<span class="title">Improved Algorithms for Clustering with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.61">10.4230/LIPIcs.ISAAC.2019.61</a>
</li>
<li>
<span class="authors">Gill Barequet, Evanthia Papadopoulou, and Martin Suderland</span>
<span class="title">Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.62">10.4230/LIPIcs.ISAAC.2019.62</a>
</li>
<li>
<span class="authors">Oscar Defrain and Lhouari Nourine</span>
<span class="title">Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P_7 - Free and P_8 - Free Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.63">10.4230/LIPIcs.ISAAC.2019.63</a>
</li>
<li>
<span class="authors">Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, and Guido Proietti</span>
<span class="title">Dual-Mode Greedy Algorithms Can Save Energy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2019.64">10.4230/LIPIcs.ISAAC.2019.64</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