<h2>LIPIcs, Volume 64, ISAAC 2016</h2>
<ul>
<li>
<span class="authors">Seok-Hee Hong</span>
<span class="title">LIPIcs, Volume 64, ISAAC'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016">10.4230/LIPIcs.ISAAC.2016</a>
</li>
<li>
<span class="authors">Seok-Hee Hong</span>
<span class="title">Front Matter, Table of Contents, Preface, Program Committee, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.0">10.4230/LIPIcs.ISAAC.2016.0</a>
</li>
<li>
<span class="authors">Xuemin Lin</span>
<span class="title">Towards Processing of Big Graphs: from Theory, Algorithm to System (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.1">10.4230/LIPIcs.ISAAC.2016.1</a>
</li>
<li>
<span class="authors">Kunsoo Park</span>
<span class="title">Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.2">10.4230/LIPIcs.ISAAC.2016.2</a>
</li>
<li>
<span class="authors">Amirali Abdullah, Samira Daruki, Chitradeep Dutta Roy, and Suresh Venkatasubramanian</span>
<span class="title">Streaming Verification of Graph Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.3">10.4230/LIPIcs.ISAAC.2016.3</a>
</li>
<li>
<span class="authors">Faisal Abu-Khzam, Cristina Bazgan, Katrin Casel, and Henning Fernau</span>
<span class="title">Building Clusters with Lower-Bounded Sizes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.4">10.4230/LIPIcs.ISAAC.2016.4</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Fahad Panolan, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Simultaneous Feedback Edge Set: A Parameterized Perspective</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.5">10.4230/LIPIcs.ISAAC.2016.5</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Saket Saurabh, Roohani Sharma, and Meirav Zehavi</span>
<span class="title">Kernels for Deletion to Classes of Acyclic Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.6">10.4230/LIPIcs.ISAAC.2016.6</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Jiangwei Pan, and Will Victor</span>
<span class="title">An Efficient Algorithm for Placing Electric Vehicle Charging Stations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.7">10.4230/LIPIcs.ISAAC.2016.7</a>
</li>
<li>
<span class="authors">Udit Agarwal and Vijaya Ramachandran</span>
<span class="title">Finding k Simple Shortest Paths and Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.8">10.4230/LIPIcs.ISAAC.2016.8</a>
</li>
<li>
<span class="authors">Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, and Birgit Vogtenhuber</span>
<span class="title">Packing Short Plane Spanning Trees in Complete Geometric Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.9">10.4230/LIPIcs.ISAAC.2016.9</a>
</li>
<li>
<span class="authors">Hugo A. Akitaya and Csaba D. Tóth</span>
<span class="title">Reconstruction of Weakly Simple Polygons from their Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.10">10.4230/LIPIcs.ISAAC.2016.10</a>
</li>
<li>
<span class="authors">Helmut Alt and Nadja Scharf</span>
<span class="title">Approximating Smallest Containers for Packing Three-Dimensional Convex Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.11">10.4230/LIPIcs.ISAAC.2016.11</a>
</li>
<li>
<span class="authors">Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, and B. Riva Shalom</span>
<span class="title">Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.12">10.4230/LIPIcs.ISAAC.2016.12</a>
</li>
<li>
<span class="authors">Patrizio Angelini and Giordano Da Lozzo</span>
<span class="title">Clustered Planarity with Pipes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.13">10.4230/LIPIcs.ISAAC.2016.13</a>
</li>
<li>
<span class="authors">Sang Won Bae</span>
<span class="title">L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.14">10.4230/LIPIcs.ISAAC.2016.14</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay and Kasturi Varadarajan</span>
<span class="title">Approximate Clustering via Metric Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.15">10.4230/LIPIcs.ISAAC.2016.15</a>
</li>
<li>
<span class="authors">Sebastian Berndt and Maciej Liskiewicz</span>
<span class="title">Hard Communication Channels for Steganography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.16">10.4230/LIPIcs.ISAAC.2016.16</a>
</li>
<li>
<span class="authors">Therese Biedl and Saeed Mehrabi</span>
<span class="title">On r-Guarding Thin Orthogonal Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.17">10.4230/LIPIcs.ISAAC.2016.17</a>
</li>
<li>
<span class="authors">Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, and Søren Vind</span>
<span class="title">Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.18">10.4230/LIPIcs.ISAAC.2016.18</a>
</li>
<li>
<span class="authors">Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, and Michiel Smid</span>
<span class="title">Towards Plane Spanners of Degree 3</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.19">10.4230/LIPIcs.ISAAC.2016.19</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Hirotaka Ono, and Yota Otachi</span>
<span class="title">Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.20">10.4230/LIPIcs.ISAAC.2016.20</a>
</li>
<li>
<span class="authors">Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, and Pavel Veselý</span>
<span class="title">Online Packet Scheduling with Bounded Delay and Lookahead</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.21">10.4230/LIPIcs.ISAAC.2016.21</a>
</li>
<li>
<span class="authors">Sankardeep Chakraborty, Venkatesh Raman, and Srinivasa Rao Satti</span>
<span class="title">Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.22">10.4230/LIPIcs.ISAAC.2016.22</a>
</li>
<li>
<span class="authors">T-H. Hubert Chan, Zhihao Gavin Tang, and Xiaowei Wu</span>
<span class="title">On (1, epsilon)-Restricted Max-Min Fair Allocation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.23">10.4230/LIPIcs.ISAAC.2016.23</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Dimitrios Skrepetos</span>
<span class="title">All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.24">10.4230/LIPIcs.ISAAC.2016.24</a>
</li>
<li>
<span class="authors">Di Chen and Mordecai Golin</span>
<span class="title">Sink Evacuation on Trees with Dynamic Confluent Flows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.25">10.4230/LIPIcs.ISAAC.2016.25</a>
</li>
<li>
<span class="authors">Lijie Chen</span>
<span class="title">Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.26">10.4230/LIPIcs.ISAAC.2016.26</a>
</li>
<li>
<span class="authors">Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, and Sunil Shende</span>
<span class="title">Search on a Line by Byzantine Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.27">10.4230/LIPIcs.ISAAC.2016.27</a>
</li>
<li>
<span class="authors">Nevzat Onur Domanic, Chi-Kit Lam, and C. Gregory Plaxton</span>
<span class="title">Bipartite Matching with Linear Edge Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.28">10.4230/LIPIcs.ISAAC.2016.28</a>
</li>
<li>
<span class="authors">Hicham El-Zein, J. Ian Munro, and Matthew Robertson</span>
<span class="title">Raising Permutations to Powers in Place</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.29">10.4230/LIPIcs.ISAAC.2016.29</a>
</li>
<li>
<span class="authors">Amr Elmasry and Frank Kammer</span>
<span class="title">Space-Efficient Plane-Sweep Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.30">10.4230/LIPIcs.ISAAC.2016.30</a>
</li>
<li>
<span class="authors">Michael Etscheid and Matthias Mnich</span>
<span class="title">Linear Kernels and Linear-Time Algorithms for Finding Large Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.31">10.4230/LIPIcs.ISAAC.2016.31</a>
</li>
<li>
<span class="authors">Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, and Christian Scheffer</span>
<span class="title">Universal Guard Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.32">10.4230/LIPIcs.ISAAC.2016.32</a>
</li>
<li>
<span class="authors">Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, and Laura Sanità</span>
<span class="title">Fast Approximation Algorithms for the Generalized Survivable Network Design Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.33">10.4230/LIPIcs.ISAAC.2016.33</a>
</li>
<li>
<span class="authors">Arnab Ganguly, Wing-Kai Hon, Rahul Shah, and Sharma V. Thankachan</span>
<span class="title">Space-Time Trade-Offs for the Shortest Unique Substring Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.34">10.4230/LIPIcs.ISAAC.2016.34</a>
</li>
<li>
<span class="authors">Shahram Ghandeharizadeh, Sandy Irani, and Jenny Lam</span>
<span class="title">The Subset Assignment Problem for Data Placement in Caches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.35">10.4230/LIPIcs.ISAAC.2016.35</a>
</li>
<li>
<span class="authors">Lucy Ham</span>
<span class="title">A Gap Trichotomy for Boolean Constraint Problems: Extending Schaefer's Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.36">10.4230/LIPIcs.ISAAC.2016.36</a>
</li>
<li>
<span class="authors">Duc A. Hoang and Ryuhei Uehara</span>
<span class="title">Sliding Tokens on a Cactus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.37">10.4230/LIPIcs.ISAAC.2016.37</a>
</li>
<li>
<span class="authors">Dmitry Itsykson, Alexander Knop, and Dmitry Sokolov</span>
<span class="title">Complexity of Distributions and Average-Case Hardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.38">10.4230/LIPIcs.ISAAC.2016.38</a>
</li>
<li>
<span class="authors">Kai Jin</span>
<span class="title">Computing the Pattern Waiting Time: A Revisit of the Intuitive Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.39">10.4230/LIPIcs.ISAAC.2016.39</a>
</li>
<li>
<span class="authors">Mong-Jen Kao, Hai-Lun Tu, and D. T. Lee</span>
<span class="title">O(f) Bi-Approximation for Capacitated Covering with Hard Capacities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.40">10.4230/LIPIcs.ISAAC.2016.40</a>
</li>
<li>
<span class="authors">Yasushi Kawase and Kazuhisa Makino</span>
<span class="title">Surrogate Optimization for p-Norms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.41">10.4230/LIPIcs.ISAAC.2016.41</a>
</li>
<li>
<span class="authors">Yasushi Kawase, Kazuhisa Makino, and Kento Seimi</span>
<span class="title">Optimal Composition Ordering Problems for Piecewise Linear Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.42">10.4230/LIPIcs.ISAAC.2016.42</a>
</li>
<li>
<span class="authors">Yasushi Kawase, Tomomi Matsui, and Atsushi Miyauchi</span>
<span class="title">Additive Approximation Algorithms for Modularity Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.43">10.4230/LIPIcs.ISAAC.2016.43</a>
</li>
<li>
<span class="authors">Yasushi Kawase and Atsushi Miyauchi</span>
<span class="title">The Densest Subgraph Problem with a Convex/Concave Size Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.44">10.4230/LIPIcs.ISAAC.2016.44</a>
</li>
<li>
<span class="authors">Pavel Klavík, Yota Otachi, and Jiri Šejnoha</span>
<span class="title">On the Classes of Interval Graphs of Limited Nesting and Count of Lengths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.45">10.4230/LIPIcs.ISAAC.2016.45</a>
</li>
<li>
<span class="authors">Tomasz Kociumaka, Solon P. Pissis, and Jakub Radoszewski</span>
<span class="title">Pattern Matching and Consensus Problems on Weighted Sequences and Profiles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.46">10.4230/LIPIcs.ISAAC.2016.46</a>
</li>
<li>
<span class="authors">Spyros Kontogiannis, Dorothea Wagner, and Christos Zaroliagis</span>
<span class="title">Hierarchical Time-Dependent Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.47">10.4230/LIPIcs.ISAAC.2016.47</a>
</li>
<li>
<span class="authors">Marc van Kreveld, Maarten Löffler, Frank Staals, and Lionov Wiratma</span>
<span class="title">A Refined Definition for Groups of Moving Entities and its Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.48">10.4230/LIPIcs.ISAAC.2016.48</a>
</li>
<li>
<span class="authors">Denis Kurz and Petra Mutzel</span>
<span class="title">A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.49">10.4230/LIPIcs.ISAAC.2016.49</a>
</li>
<li>
<span class="authors">Hoang-Oanh Le and Van Bang Le</span>
<span class="title">On the Complexity of Matching Cut in Graphs of Fixed Diameter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.50">10.4230/LIPIcs.ISAAC.2016.50</a>
</li>
<li>
<span class="authors">Qian Li, Xiaoming Sun, and Jialin Zhang</span>
<span class="title">On the Optimality of Tape Merge of Two Lists with Similar Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.51">10.4230/LIPIcs.ISAAC.2016.51</a>
</li>
<li>
<span class="authors">Shimin Li and Haitao Wang</span>
<span class="title">Dispersing Points on Intervals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.52">10.4230/LIPIcs.ISAAC.2016.52</a>
</li>
<li>
<span class="authors">Fu-Hong Liu, Hsiang-Hsuan Liu, and Prudence W. H. Wong</span>
<span class="title">Optimal Nonpreemptive Scheduling in a Smart Grid Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.53">10.4230/LIPIcs.ISAAC.2016.53</a>
</li>
<li>
<span class="authors">Yangwei Liu, Hu Ding, Ziyun Huang, and Jinhui Xu</span>
<span class="title">Distributed and Robust Support Vector Machine</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.54">10.4230/LIPIcs.ISAAC.2016.54</a>
</li>
<li>
<span class="authors">Wenchang Luo, Yao Xu, Weitian Tong, and Guohui Lin</span>
<span class="title">Single Machine Scheduling with Job-Dependent Machine Deterioration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.55">10.4230/LIPIcs.ISAAC.2016.55</a>
</li>
<li>
<span class="authors">Christopher S. Martin and Mohammad R. Salavatipour</span>
<span class="title">Approximation Algorithms for Capacitated k-Travelling Repairmen Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.56">10.4230/LIPIcs.ISAAC.2016.56</a>
</li>
<li>
<span class="authors">Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, and Fabio Tardella</span>
<span class="title">Scaling and Proximity Properties of Integrally Convex Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.57">10.4230/LIPIcs.ISAAC.2016.57</a>
</li>
<li>
<span class="authors">Eunjin Oh and Hee-Kap Ahn</span>
<span class="title">Assigning Weights to Minimize the Covering Radius in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.58">10.4230/LIPIcs.ISAAC.2016.58</a>
</li>
<li>
<span class="authors">Eunjin Oh and Hee-Kap Ahn</span>
<span class="title">A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.59">10.4230/LIPIcs.ISAAC.2016.59</a>
</li>
<li>
<span class="authors">Christian Scheffer and Jan Vahrenhold</span>
<span class="title">Approximate Shortest Distances Among Smooth Obstacles in 3D</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.60">10.4230/LIPIcs.ISAAC.2016.60</a>
</li>
<li>
<span class="authors">Te-Li Wang, Chih-Kuan Yeh, and Ho-Lin Chen</span>
<span class="title">An Improved Tax Scheme for Selfish Routing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.61">10.4230/LIPIcs.ISAAC.2016.61</a>
</li>
<li>
<span class="authors">Mingyu Xiao and Hiroshi Nagamochi</span>
<span class="title">A Linear-Time Algorithm for Integral Multiterminal Flows in Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.62">10.4230/LIPIcs.ISAAC.2016.62</a>
</li>
<li>
<span class="authors">Yutaro Yamaguchi</span>
<span class="title">Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.63">10.4230/LIPIcs.ISAAC.2016.63</a>
</li>
<li>
<span class="authors">Hung-I Yu, Tien-Ching Lin, and Der-Tsai Lee</span>
<span class="title">The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2016.64">10.4230/LIPIcs.ISAAC.2016.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