LIPIcs, Volume 92, ISAAC 2017

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