LIPIcs, Volume 149, ISAAC 2019

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