<h2>LIPIcs, Volume 123, ISAAC 2018</h2>
<ul>
<li>
<span class="authors">Wen-Lian Hsu, Der-Tsai Lee, and Chung-Shou Liao</span>
<span class="title">LIPIcs, Volume 123, ISAAC'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018">10.4230/LIPIcs.ISAAC.2018</a>
</li>
<li>
<span class="authors">Wen-Lian Hsu, Der-Tsai Lee, and Chung-Shou Liao</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.0">10.4230/LIPIcs.ISAAC.2018.0</a>
</li>
<li>
<span class="authors">Shang-Hua Teng</span>
<span class="title">Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.1">10.4230/LIPIcs.ISAAC.2018.1</a>
</li>
<li>
<span class="authors">Clifford Stein</span>
<span class="title">Approximate Matchings in Massive Graphs via Local Structure (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.2">10.4230/LIPIcs.ISAAC.2018.2</a>
</li>
<li>
<span class="authors">Andreas Björklund</span>
<span class="title">Exploiting Sparsity for Bipartite Hamiltonicity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.3">10.4230/LIPIcs.ISAAC.2018.3</a>
</li>
<li>
<span class="authors">Ahad N. Zehmakan</span>
<span class="title">Opinion Forming in Erdös-Rényi Random Graph and Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.4">10.4230/LIPIcs.ISAAC.2018.4</a>
</li>
<li>
<span class="authors">Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, and Veronika Slívová</span>
<span class="title">Colouring (P_r+P_s)-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.5">10.4230/LIPIcs.ISAAC.2018.5</a>
</li>
<li>
<span class="authors">Guillaume Ducoffe and Alexandru Popa</span>
<span class="title">The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.6">10.4230/LIPIcs.ISAAC.2018.6</a>
</li>
<li>
<span class="authors">Davide Bilò and Kleitos Papadopoulos</span>
<span class="title">A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.7">10.4230/LIPIcs.ISAAC.2018.7</a>
</li>
<li>
<span class="authors">Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, and Takeaki Uno</span>
<span class="title">Efficient Enumeration of Dominating Sets for Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.8">10.4230/LIPIcs.ISAAC.2018.8</a>
</li>
<li>
<span class="authors">Md Lutfar Rahman and Thomas Watson</span>
<span class="title">Complexity of Unordered CNF Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.9">10.4230/LIPIcs.ISAAC.2018.9</a>
</li>
<li>
<span class="authors">Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, and Alexander V. Smal</span>
<span class="title">Half-Duplex Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.10">10.4230/LIPIcs.ISAAC.2018.10</a>
</li>
<li>
<span class="authors">Takashi Ishizuka and Naoyuki Kamiyama</span>
<span class="title">On the Complexity of Stable Fractional Hypergraph Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.11">10.4230/LIPIcs.ISAAC.2018.11</a>
</li>
<li>
<span class="authors">Matthew P. Johnson</span>
<span class="title">Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.12">10.4230/LIPIcs.ISAAC.2018.12</a>
</li>
<li>
<span class="authors">Johanna E. Preißer and Jens M. Schmidt</span>
<span class="title">Computing Vertex-Disjoint Paths in Large Graphs Using MAOs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.13">10.4230/LIPIcs.ISAAC.2018.13</a>
</li>
<li>
<span class="authors">Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, and Naoki Katoh</span>
<span class="title">An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.14">10.4230/LIPIcs.ISAAC.2018.14</a>
</li>
<li>
<span class="authors">Delia Garijo, Alberto Márquez, Natalia Rodríguez, and Rodrigo I. Silveira</span>
<span class="title">Computing Optimal Shortcuts for Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.15">10.4230/LIPIcs.ISAAC.2018.15</a>
</li>
<li>
<span class="authors">Georgia Avarikioti, Yuyi Wang, and Roger Wattenhofer</span>
<span class="title">Algorithmic Channel Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.16">10.4230/LIPIcs.ISAAC.2018.16</a>
</li>
<li>
<span class="authors">Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto</span>
<span class="title">Counting Connected Subgraphs with Maximum-Degree-Aware Sieving</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.17">10.4230/LIPIcs.ISAAC.2018.17</a>
</li>
<li>
<span class="authors">Pavel Dvorák, Dusan Knop, and Tomás Toufar</span>
<span class="title">Target Set Selection in Dense Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.18">10.4230/LIPIcs.ISAAC.2018.18</a>
</li>
<li>
<span class="authors">Andreas Björklund and Thore Husfeldt</span>
<span class="title">Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.19">10.4230/LIPIcs.ISAAC.2018.19</a>
</li>
<li>
<span class="authors">Eun Jung Kim, Maria Serna, and Dimitrios M. Thilikos</span>
<span class="title">Data-Compression for Parametrized Counting Problems on Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.20">10.4230/LIPIcs.ISAAC.2018.20</a>
</li>
<li>
<span class="authors">Samir Datta, Raghav Kulkarni, Ashish Kumar, and Anish Mukherjee</span>
<span class="title">Planar Maximum Matching: Towards a Parallel Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.21">10.4230/LIPIcs.ISAAC.2018.21</a>
</li>
<li>
<span class="authors">Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, and Marcin Witkowski</span>
<span class="title">Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.22">10.4230/LIPIcs.ISAAC.2018.22</a>
</li>
<li>
<span class="authors">Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, and Shinnosuke Seki</span>
<span class="title">Proving the Turing Universality of Oritatami Co-Transcriptional Folding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.23">10.4230/LIPIcs.ISAAC.2018.23</a>
</li>
<li>
<span class="authors">Jiehua Chen, Hendrik Molter, Manuel Sorge, and Ondrej Suchý</span>
<span class="title">Cluster Editing in Multi-Layer and Temporal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.24">10.4230/LIPIcs.ISAAC.2018.24</a>
</li>
<li>
<span class="authors">Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, and Saket Saurabh</span>
<span class="title">Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.25">10.4230/LIPIcs.ISAAC.2018.25</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, and Allen Xiao</span>
<span class="title">Approximate Minimum-Weight Matching with Outliers Under Translation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.26">10.4230/LIPIcs.ISAAC.2018.26</a>
</li>
<li>
<span class="authors">Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, and Takeyuki Tamura</span>
<span class="title">New and Improved Algorithms for Unordered Tree Inclusion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.27">10.4230/LIPIcs.ISAAC.2018.27</a>
</li>
<li>
<span class="authors">Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, and Torsten Ueckerdt</span>
<span class="title">Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.28">10.4230/LIPIcs.ISAAC.2018.28</a>
</li>
<li>
<span class="authors">Yen-Ting Chen, Meng-Tsung Tsai, and Shi-Chun Tsai</span>
<span class="title">A Dichotomy Result for Cyclic-Order Traversing Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.29">10.4230/LIPIcs.ISAAC.2018.29</a>
</li>
<li>
<span class="authors">Guillaume Ducoffe and Alexandru Popa</span>
<span class="title">The b-Matching Problem in Distance-Hereditary Graphs and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.30">10.4230/LIPIcs.ISAAC.2018.30</a>
</li>
<li>
<span class="authors">Qilong Feng, Guanlan Tan, Senmin Zhu, Bin Fu, and Jianxin Wang</span>
<span class="title">New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.31">10.4230/LIPIcs.ISAAC.2018.31</a>
</li>
<li>
<span class="authors">Michael Matheny and Jeff M. Phillips</span>
<span class="title">Computing Approximate Statistical Discrepancy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.32">10.4230/LIPIcs.ISAAC.2018.32</a>
</li>
<li>
<span class="authors">Alfonso Cevallos, Friedrich Eisenbrand, and Sarah Morell</span>
<span class="title">Diversity Maximization in Doubling Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.33">10.4230/LIPIcs.ISAAC.2018.33</a>
</li>
<li>
<span class="authors">Nader H. Bshouty and Waseem Makhoul</span>
<span class="title">On Polynomial Time Constructions of Minimum Height Decision Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.34">10.4230/LIPIcs.ISAAC.2018.34</a>
</li>
<li>
<span class="authors">Divesh Aggarwal and Priyanka Mukhopadhyay</span>
<span class="title">Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.35">10.4230/LIPIcs.ISAAC.2018.35</a>
</li>
<li>
<span class="authors">Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, and Rolf Niedermeier</span>
<span class="title">An Adaptive Version of Brandes' Algorithm for Betweenness Centrality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.36">10.4230/LIPIcs.ISAAC.2018.36</a>
</li>
<li>
<span class="authors">Hiroki Osawa, Akira Suzuki, Takehiro Ito, and Xiao Zhou</span>
<span class="title">Algorithms for Coloring Reconfiguration Under Recolorability Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.37">10.4230/LIPIcs.ISAAC.2018.37</a>
</li>
<li>
<span class="authors">On-Hei S. Lo and Jens M. Schmidt</span>
<span class="title">A Cut Tree Representation for Pendant Pairs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.38">10.4230/LIPIcs.ISAAC.2018.38</a>
</li>
<li>
<span class="authors">Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, and Fabrizio Montecchiani</span>
<span class="title">Polyline Drawings with Topological Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.39">10.4230/LIPIcs.ISAAC.2018.39</a>
</li>
<li>
<span class="authors">Davide Bilò</span>
<span class="title">Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.40">10.4230/LIPIcs.ISAAC.2018.40</a>
</li>
<li>
<span class="authors">Giordano Da Lozzo and Ignaz Rutter</span>
<span class="title">Approximation Algorithms for Facial Cycles in Planar Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.41">10.4230/LIPIcs.ISAAC.2018.41</a>
</li>
<li>
<span class="authors">Adam Kunysz</span>
<span class="title">An Algorithm for the Maximum Weight Strongly Stable Matching Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.42">10.4230/LIPIcs.ISAAC.2018.42</a>
</li>
<li>
<span class="authors">Eunpyeong Hong and Mong-Jen Kao</span>
<span class="title">Approximation Algorithm for Vertex Cover with Multiple Covering Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.43">10.4230/LIPIcs.ISAAC.2018.43</a>
</li>
<li>
<span class="authors">David F. Gleich, Nate Veldt, and Anthony Wirth</span>
<span class="title">Correlation Clustering Generalized</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.44">10.4230/LIPIcs.ISAAC.2018.44</a>
</li>
<li>
<span class="authors">Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, and Frits C. R. Spieksma</span>
<span class="title">Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.45">10.4230/LIPIcs.ISAAC.2018.45</a>
</li>
<li>
<span class="authors">Johannes Blömer, Sascha Brauer, and Kathrin Bujna</span>
<span class="title">Coresets for Fuzzy K-Means with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">10.4230/LIPIcs.ISAAC.2018.46</a>
</li>
<li>
<span class="authors">Martín Farach-Colton, Meng Li, and Meng-Tsung Tsai</span>
<span class="title">Streaming Algorithms for Planar Convex Hulls</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.47">10.4230/LIPIcs.ISAAC.2018.47</a>
</li>
<li>
<span class="authors">Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, and Franck Petit</span>
<span class="title">Deterministic Treasure Hunt in the Plane with Angular Hints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.48">10.4230/LIPIcs.ISAAC.2018.48</a>
</li>
<li>
<span class="authors">Quirijn Bouts, Thom Castermans, Arthur van Goethem, Marc van Kreveld, and Wouter Meulemans</span>
<span class="title">Competitive Searching for a Line on a Line Arrangement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.49">10.4230/LIPIcs.ISAAC.2018.49</a>
</li>
<li>
<span class="authors">Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, and Max Willert</span>
<span class="title">Stabbing Pairwise Intersecting Disks by Five Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.50">10.4230/LIPIcs.ISAAC.2018.50</a>
</li>
<li>
<span class="authors">Eunjin Oh</span>
<span class="title">Point Location in Incremental Planar Subdivisions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.51">10.4230/LIPIcs.ISAAC.2018.51</a>
</li>
<li>
<span class="authors">Vahideh Keikha, Mees van de Kerkhof, Marc van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, and Lionov Wiratma</span>
<span class="title">Convex Partial Transversals of Planar Regions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.52">10.4230/LIPIcs.ISAAC.2018.52</a>
</li>
<li>
<span class="authors">Alexander Pilz and Patrick Schnider</span>
<span class="title">Extending the Centerpoint Theorem to Multiple Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.53">10.4230/LIPIcs.ISAAC.2018.53</a>
</li>
<li>
<span class="authors">Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti, and Shubham Ugare</span>
<span class="title">Approximate Query Processing over Static Sets and Sliding Windows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.54">10.4230/LIPIcs.ISAAC.2018.54</a>
</li>
<li>
<span class="authors">Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, and Thatchaphol Saranurak</span>
<span class="title">Multi-Finger Binary Search Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.55">10.4230/LIPIcs.ISAAC.2018.55</a>
</li>
<li>
<span class="authors">Ivona Bezáková and Andrew Searns</span>
<span class="title">On Counting Oracles for Path Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.56">10.4230/LIPIcs.ISAAC.2018.56</a>
</li>
<li>
<span class="authors">Hiroshi Hirai and Yuni Iwamasa</span>
<span class="title">Reconstructing Phylogenetic Tree From Multipartite Quartet System</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.57">10.4230/LIPIcs.ISAAC.2018.57</a>
</li>
<li>
<span class="authors">Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, and Marcel Roeloffzen</span>
<span class="title">Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.58">10.4230/LIPIcs.ISAAC.2018.58</a>
</li>
<li>
<span class="authors">Eunjin Oh</span>
<span class="title">Minimizing Distance-to-Sight in Polygonal Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.59">10.4230/LIPIcs.ISAAC.2018.59</a>
</li>
<li>
<span class="authors">Franz Aurenhammer, Michael Steinkogler, and Rolf Klein</span>
<span class="title">Partially Walking a Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.60">10.4230/LIPIcs.ISAAC.2018.60</a>
</li>
<li>
<span class="authors">Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, and Alexander Wolff</span>
<span class="title">Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.61">10.4230/LIPIcs.ISAAC.2018.61</a>
</li>
<li>
<span class="authors">Xingwu Liu, Zhida Pan, Yuyi Wang, and Roger Wattenhofer</span>
<span class="title">Impatient Online Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.62">10.4230/LIPIcs.ISAAC.2018.62</a>
</li>
<li>
<span class="authors">Siu-Wing Cheng and Lie Yan</span>
<span class="title">Extensions of Self-Improving Sorters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.63">10.4230/LIPIcs.ISAAC.2018.63</a>
</li>
<li>
<span class="authors">Kelin Luo, Thomas Erlebach, and Yinfeng Xu</span>
<span class="title">Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.64">10.4230/LIPIcs.ISAAC.2018.64</a>
</li>
<li>
<span class="authors">Martin Hoefer and Lisa Wilhelmi</span>
<span class="title">Packing Returning Secretaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.65">10.4230/LIPIcs.ISAAC.2018.65</a>
</li>
<li>
<span class="authors">Frank Kammer and Andrej Sajenko</span>
<span class="title">Simple 2^f-Color Choice Dictionaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.66">10.4230/LIPIcs.ISAAC.2018.66</a>
</li>
<li>
<span class="authors">J. Ian Munro and Kaiyu Wu</span>
<span class="title">Succinct Data Structures for Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.67">10.4230/LIPIcs.ISAAC.2018.67</a>
</li>
<li>
<span class="authors">Travis Gagie, Meng He, and Gonzalo Navarro</span>
<span class="title">Tree Path Majority Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.68">10.4230/LIPIcs.ISAAC.2018.68</a>
</li>
<li>
<span class="authors">Seungbum Jo and Srinivasa Rao Satti</span>
<span class="title">Encoding Two-Dimensional Range Top-k Queries Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.69">10.4230/LIPIcs.ISAAC.2018.69</a>
</li>
<li>
<span class="authors">Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, and Solon P. Pissis</span>
<span class="title">Longest Unbordered Factor in Quasilinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.70">10.4230/LIPIcs.ISAAC.2018.70</a>
</li>
<li>
<span class="authors">Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, and Georg von der Brüggen</span>
<span class="title">Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.71">10.4230/LIPIcs.ISAAC.2018.71</a>
</li>
<li>
<span class="authors">Galia Shabtai, Danny Raz, and Yuval Shavitt</span>
<span class="title">A Relaxed FPTAS for Chance-Constrained Knapsack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.72">10.4230/LIPIcs.ISAAC.2018.72</a>
</li>
<li>
<span class="authors">Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, and Abhinav Srivastav</span>
<span class="title">Covering Clients with Types and Budgets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.73">10.4230/LIPIcs.ISAAC.2018.73</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