Front Matter, Table of Contents, Preface, External Reviewers

28th International Symposium on Algorithms and Computation ISAAC 2017, December 9–12, 2017, Phuket, Thailand Edited by Yoshio Okamoto Takeshi Tokuyama L I P I c s – Vo l . 9 2 – I S A AC 2 0 1 7 www.dagstuhl.de/lipics Editors Yoshio Okamoto Graduate School of Informatics and Engineering The University of Electro-Communications Takeshi Tokuyama Graduate School of Information Sciences Tohoku University ACM Classification 1998 E.1 Data Structures, F. Theory of Computation, G. Mathematics of Computing, I. Computing Methodologies ISBN 978-3-95977-054-5 Published online and open access by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at http://www.dagstuhl.de/dagpub/978-3-95977-054-5. Publication date December, 2017 Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at http://dnb.d-nb.de. License This work is licensed under a Creative Commons Attribution 3.0 Unported license (CC-BY 3.0): http://creativecommons.org/licenses/by/3.0/legalcode. In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors’ moral rights: Attribution: The work must be attributed to its authors. The copyright is retained by the corresponding authors. Digital Object Identifier: 10.4230/LIPIcs.ISAAC.2017.0 ISBN 978-3-95977-054-5 ISSN 1868-8969 http://www.dagstuhl.de/lipics 0:iii LIPIcs – Leibniz International Proceedings in Informatics LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge. Editorial Board Luca Aceto (Chair, Gran Sasso Science Institute and Reykjavik University) Susanne Albers (TU München) Chris Hankin (Imperial College London) Deepak Kapur (University of New Mexico) Michael Mitzenmacher (Harvard University) Madhavan Mukund (Chennai Mathematical Institute) Anca Muscholl (University Bordeaux) Catuscia Palamidessi (INRIA) Raimund Seidel (Saarland University and Schloss Dagstuhl – Leibniz-Zentrum für Informatik) Thomas Schwentick (TU Dortmund) Reinhard Wilhelm (Saarland University) ISSN 1868-8969 http://www.dagstuhl.de/lipics ISAAC 2017 Contents Preface Yoshio Okamoto and Takeshi Tokuyama . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0:xi Invited Talks Weighted Linear Matroid Parity Satoru Iwata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:1–1:5 Computational Philosophy: On Fairness in Automated Decision Making Suresh Venkatasubramanian . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:1–2:1 Contributed Talks Faster Algorithms for Growing Prioritized Disks and Rectangles Hee-Kap Ahn, Sang Won Bae, Jongmin Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, and Antoine Vigneron . . . . . . . . . . . . . 3:1–3:13 Placing your Coins on a Shelf Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, and Fabian Stehn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:1–4:12 On the Number of p4-Tilings by an n-Omino Kazuyuki Amano and Yoshinobu Haruyama . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:1–5:12 Network Optimization on Partitioned Pairs of Points Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, and Joseph S. B. Mitchell . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6:1–6:12 Voronoi Diagrams for Parallel Halflines and Line Segments in Space Franz Aurenhammer, Bert Jüttler, and Günter Paulini . . . . . . . . . . . . . . . . . . . . . . . . . . . 7:1–7:10 Faster Algorithms for Half-Integral T -Path Packing Maxim Babenko and Stepan Artamonov . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8:1–8:12 Shortcuts for the Circle Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, and Christos Levcopoulos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9:1–9:13 Routing in Polygonal Domains Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10:1–10:13 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, and Arne Schmidt . . . . . . . . . . . . . . . . . . . . . . . . . . . 11:1–11:13 A Simple Greedy Algorithm for Dynamic Graph Orientation Edvin Berglin and Gerth Stølting Brodal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12:1–12:12 28th International Symposium on Algorithms and Computation (ISAAC 2017). Editors: Yoshio Okamoto and Takeshi Tokuyama Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany 0:vi Contents Crossing Number for Graphs with Bounded Pathwidth Therese Biedl, Markus Chimani, Martin Derka, and Petra Mutzel . . . . . . . . . . . . . . . . 13:1–13:13 An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, and Guido Proietti 14:1–14:13 Decomposing a Graph into Shortest Paths with Bounded Eccentricity Etienne Birmelé, Fabien de Montgolfier, Léo Planche, and Laurent Viennot . . . . . . 15:1–15:13 Independent Feedback Vertex Set for P5 -free Graphs Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, and Daniël Paulusma . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16:1–16:12 On the Convergence Time of a Natural Dynamics for Linear Programming Vincenzo Bonifaci . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17:1–17:12 Routing on the Visibility Graph Prosenjit Bose, Matias Korman, André van Renssen, and Sander Verdonschot . . . 18:1–18:12 An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint Gruia Cǎlinescu, Florian Jaehn, Minming Li, and Kai Wang . . . . . . . . . . . . . . . . . . . . 19:1–19:13 An Efficient Fixed-Parameter Algor (...truncated)