ISAAC 2019 Accepted Papers

Yixin Cao, Guozhen Rong, Jianxin Wang and Zhifeng Wang. Graph Searches and Their End Vertices
Nader Bshouty. Lower Bound for Non-Adaptive Estimation of the Number of Defective Items
Kazuya Haraguchi and Hiroshi Nagamochi. A Polynomial-delay Algorithm for Enumerating Connectors under Various Connectivity Conditions
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau and Oren Weimann. Top Tree Compression of Tries
Ahad N. Zehmakan. Two Phase Transitions in Two-way Bootstrap Percolation
Moses Ganardi, Danny Hucke, Markus Lohrey and Tatiana Starikovskaya. Sliding window property testing for regular languages
Isaac B. Goldstein, Moshe Lewenstein and Ely Porat. On the Hardness of Set Disjointness and Set Intersection with Bounded Universe
Ryan Killick, Evangelos Kranakis, Paola Flocchini, Nicola Santoro and Masafumi Yamashita. Gathering and Election by Mobile Robots in a Continuous Cycle
Koki Hamada, Shuichi Miyazaki and Hiroki Yanagisawa. Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists
David Naori and Danny Raz. Online Multidimensional Packing Problems in the Random-Order Model
R Inkulu and Sanjiv Kapoor. Approximate Euclidean shortest paths in polygonal domains
Rahul Jain and Raghunath Tewari. Reachability in High Treewidth Graphs
Ruben Brokkelkamp, Sven Polak, Guido Schäfer and Yllka Velaj. Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node
Marcin Bienkowski, Łukasz Jeż and Paweł Schmidt. Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics
Gordon Hoi and Frank Stephan. Measure and Conquer for Max Hamming Distance XSAT
Christophe Crespelle, Carl Feghali and Petr Golovach. Cyclability in Graph Classes
Alexander Kulikov, Ivan Mikhailin, Andrey Mokhov and Vladimir Podolskii. Complexity of Linear Operators
Susanne Albers and Leon Ladewig. New Results for the k-Secretary Problem
Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh and Gopinath Mishra. Triangle Estimation using Tripartite Independent Set Queries
Luca Becchetti, Emilio Cruciani, Francesco Pasquale and Sara Rizzo. Step-by-Step Community Detection in Volume-Regular Graphs
Esther Galby, Paloma de Lima and Bernard Ries. Blocking dominating sets for H-free graphs via edge contractions
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Modamed, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. Internal Dictionary Matching
Kyle Fox and Xinyi Li. Approximating the Geometric Edit Distance
Wei Chen and Binghui Peng. On Adaptivity Gaps of Influence Maximization under the Independent Cascade Model with Full Adoption Feedback
Sang Won Bae. Minimum-Width Double-Strip and Parallelogram Annulus
Ziyun Huang, Qilong Feng, Jianxin Wang and Jinhui Xu. Small Candidate Set for Translational Pattern Search
Binay Bhattacharya, Sandip Das and Subhadeep Dev. The Weighted k-center Problem in Trees for Fixed k
Xin Han, Yasushi Kawase, Kazuhisa Makino and Haruki Yokomaku. Online Knapsack Problems with a Resource Buffer
Matthew Kahle, Minghao Tian and Yusu Wang. Local cliques in ER-perturbed random geometric graphs
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt Nilsson and André van Renssen. Local Routing in Sparse and Lightweight Geometric Graphs
Dominik Scheder, Shuyang Tang and Jiaheng Zhang. Searching for Cryptogenography Upper Bounds via Sum of Square Programming
Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki and Ryuhei Uehara. On the Complexity of Lattice Puzzles
Lorenzo De Stefani. The I/O complexity of hybrid algorithms for square matrix multiplication
Alessio Mazzetto, Andrea Pietracaprina and Geppino Pucci. Accurate MapReduce Algorithms for k-median and k-means in General Metric Spaces
Rolf Fagerberg, David Hammer and Ulrich Meyer. On Optimal Balance in B-trees: What Does it Cost to Stay in Perfect Shape?
Sándor Kisfaludi-Bak, Dániel Marx and Tom van der Zanden. How does object fatness impact the complexity of packing in d dimensions?
Mark de Berg, Sándor Kisfaludi-Bak and Mehran Mehr. On One-Round Discrete Voronoi Games
V. Arvind, Abhranil Chatterjee, Rajit Datta and Partha Mukhopadhyay. On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials
Kim Thang Nguyen. A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. An improved data structure for left-right maximal generic words problem
Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil and Saket Saurabh. Parameterized Dichotomy of Deletion to List Matrix-Partition for low-order Matrices
Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg and Dror Rawitz. The Generalized Microscopic Image Reconstruction Problem
Pál András Papp and Roger Wattenhofer. Stabilization Time in Minority Processes
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
Meng He and Serikzhan Kazi. Path and Ancestor Queries over Trees with Multidimensional Weight Vectors
Yong Chen, Randy Goebel, Bing Su, Weitian Tong, Yao Xu and An Zhang. A 21/16-approximation for the minimum 3-path partition problem
Amotz Bar-Noy, Keerti Choudhary, David Peleg and Dror Rawitz. Efficiently Realizing Interval Sequences
Chris Hickey and Graham Cormode. Efficient Interactive Proofs for Linear Algebra
Nicolas Bousquet, Edouard Bonnet, Rémi Watrigant and Stéphan Thomassé. When Maximum Stable can be solved in FPT time
Hugo A. Akitaya, Maike Buchin, Leonie Ryvkin and Jérôme Urhausen. The $k$-Fréchet distance: How to walk your dog while teleporting
Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael Goodrich, Stephen Kobourov, Pedro Matias and Valentin Polishchuk. New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs
Fabian Frei and Koichi Wada. Efficient Circuit Simulation in MapReduce
Abdolhamid Ghodselahi, Fabian Kuhn and Volker Turau. Concurrent Distributed Serving with Mobile Servers
David Eppstein, Michael T. Goodrich, James A. Liu and Pedro A. Matias. Tracking Paths in Planar Graphs
Hugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben and Carola Wenk. Distance Measures for Embedded Graphs
Philip Dasler and David Mount. Online Algorithms for Warehouse Management
Hicham El-Zein, Meng He, Ian Munro, Yakov Nekrich and Bryce Sandlund. On Approximate Range Mode and Range Selection
John Iacono, Ben Karsin and Grigorios Koumoutsos. External Memory Planar Point Location with Fast Updates
Serge Gaspers and Joshua Lau. Minimizing and Computing the Inverse Geodesic Length on Trees
Narthana Epa, Junhao Gan and Anthony Wirth. Result-Sensitive Fault-Tolerant Binary Search
Qilong Feng, Zhen Zhang, Ziyun Huang, Jinhui Xu and Jianxin Wang. Improved Algorithms for Clustering with Outliers
Gill Barequet, Evanthia Papadopoulou and Martin Suderland. Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions
Oscar Defrain and Lhouari Nourine. Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in P7-free and P8-free chordal graphs
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna and Guido Proietti. Dual-mode greedy algorithms can save energy