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