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