| 2017 | 28th International Symposium on Algorithms and Computation, ISAAC 2017, Phuket, Thailand, December 9-12, 2017 Yoshio Okamoto, Takeshi Tokuyama |
| 2017 | A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang |
| 2017 | A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. Eunjin Oh, Hee-Kap Ahn |
| 2017 | A Simple Greedy Algorithm for Dynamic Graph Orientation. Edvin Berglin, Gerth Stølting Brodal |
| 2017 | Agnostically Learning Boolean Functions with Finite Polynomial Representation. Ning Ding |
| 2017 | Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith |
| 2017 | An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions. Ziyun Huang, Jinhui Xu |
| 2017 | An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang |
| 2017 | An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti |
| 2017 | Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. Piotr Sankowski, Piotr Wygocki |
| 2017 | Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele |
| 2017 | Complexity of Coloring Reconfiguration under Recolorability Constraints. Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou |
| 2017 | Complexity of the Multi-Service Center Problem. Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi |
| 2017 | Computational Philosophy: On Fairness in Automated Decision Making. Suresh Venkatasubramanian |
| 2017 | Conflict-Free Coloring of Intersection Graphs. Sándor P. Fekete, Phillip Keldenich |
| 2017 | Crossing Number for Graphs with Bounded~Pathwidth. Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel |
| 2017 | Decomposing a Graph into Shortest Paths with Bounded Eccentricity. Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot |
| 2017 | Dominance Product and High-Dimensional Closest Pair under L_infty. Omer Gold, Micha Sharir |
| 2017 | Dynamic Conflict-Free Colorings in the Plane. Mark de Berg, Aleksandar Markovic |
| 2017 | Embedding Graphs into Embedded Graphs. Radoslav Fulek |
| 2017 | Envy-free Matchings with Lower Quotas. Yu Yokoi |
| 2017 | Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. J. Ian Munro, Gonzalo Navarro, Yakov Nekrich |
| 2017 | Faster Algorithms for Growing Prioritized Disks and Rectangles. Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron |
| 2017 | Faster Algorithms for Half-Integral T-Path Packing. Maxim A. Babenko, Stepan Artamonov |
| 2017 | Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces. Mark de Berg, Ade Gunawan, Marcel Roeloffzen |
| 2017 | Finding Pairwise Intersections of Rectangles in a Query Rectangle. Eunjin Oh, Hee-Kap Ahn |
| 2017 | Front Matter, Table of Contents, Preface, External Reviewers. |
| 2017 | Fully Dynamic Connectivity Oracles under General Vertex Updates. Kengo Nakamura |
| 2017 | Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger |
| 2017 | Hybrid VCSPs with Crisp and Valued Conservative Templates. Rustem Takhanov |
| 2017 | Improved Algorithms for Scheduling Unsplittable Flows on Paths. Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman |
| 2017 | Improved Bounds for Online Dominating Sets of Trees. Koji M. Kobayashi |
| 2017 | Independent Feedback Vertex Set for P_5-free Graphs. Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma |
| 2017 | Jointly Stable Matchings. Shuichi Miyazaki, Kazuya Okamoto |
| 2017 | Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. Athanasios L. Konstantinidis, Charis Papadopoulos |
| 2017 | Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. Michel Habib, Lalla Mouatadid |
| 2017 | Network Optimization on Partitioned Pairs of Points. Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell |
| 2017 | Non-Crossing Geometric Steiner Arborescences. Irina Kostitsyna, Bettina Speckmann, Kevin Verbeek |
| 2017 | Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. Mordecai J. Golin, Hadi Khodabande, Bo Qin |
| 2017 | On Directed Covering and Domination Problems. Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono |
| 2017 | On Maximal Cliques with Connectivity Constraints in Directed Graphs. Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa |
| 2017 | On Structural Parameterizations of the Edge Disjoint Paths Problem. Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan |
| 2017 | On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. Casper Benjamin Freksen, Kasper Green Larsen |
| 2017 | On the Convergence Time of a Natural Dynamics for Linear Programming. Vincenzo Bonifaci |
| 2017 | On the Number of p4-Tilings by an n-Omino. Kazuyuki Amano, Yoshinobu Haruyama |
| 2017 | On-the-Fly Array Initialization in Less Space. Torben Hagerup, Frank Kammer |
| 2017 | Optimal Matroid Partitioning Problems. Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita |
| 2017 | Orthogonal Vectors Indexing. Isaac Goldstein, Moshe Lewenstein, Ely Porat |
| 2017 | Placing your Coins on a Shelf. Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn |
| 2017 | Precedence-Constrained Min Sum Set Cover. Jessica McClintock, Julián Mestre, Anthony Wirth |
| 2017 | Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons. Joachim Gudmundsson, Rasmus Pagh |
| 2017 | Routing in Polygonal Domains. Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert |
| 2017 | Routing on the Visibility Graph. Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot |
| 2017 | Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama |
| 2017 | Settlement Fund Circulation Problem. Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2017 | Shortcuts for the Circle. Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos |
| 2017 | Smart Contract Execution - the (+-)-Biased Ballot Problem. Lin Chen, Lei Xu, Zhimin Gao, Nolan Shah, Yang Lu, Weidong Shi |
| 2017 | Sorting with Recurrent Comparison Errors. Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna |
| 2017 | Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson |
| 2017 | Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2017 | Structural Pattern Matching - Succinctly. Arnab Ganguly, Rahul Shah, Sharma V. Thankachan |
| 2017 | Study of a Combinatorial Game in Graphs Through Linear Programming. Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes |
| 2017 | Succinct Color Searching in One Dimension. Hicham El-Zein, J. Ian Munro, Yakov Nekrich |
| 2017 | Temporal Hierarchical Clustering. Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos |
| 2017 | Tight Approximation for Partial Vertex Cover with Hard Capacities. Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee |
| 2017 | Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces. Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt |
| 2017 | Voronoi Diagrams for Parallel Halflines and Line Segments in Space. Franz Aurenhammer, Bert Jüttler, Günter Paulini |
| 2017 | Weighted Linear Matroid Parity. Satoru Iwata |