LIPIcs, Volume 64, ISAAC 2016

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