LIPIcs, Volume 123, ISAAC 2018

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