Table of Contents

• Covering Segments with Unit SquaresAnkush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy. 1-12 [doi]
• Replica Placement on Bounded Treewidth GraphsAnshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral. 13-24 [doi]
• Fast Exact Algorithms for Survivable Network Design with Uniform RequirementsAkanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh. 25-36 [doi]
• The Complexity of Tree PartitioningZhao An, Qilong Feng, Iyad A. Kanj, Ge Xia. 37-48 [doi]
• Effectiveness of Local Search for Art Gallery ProblemsSayan Bandyapadhyay, Aniket Basu Roy. 49-60 [doi]
• Parameterized Complexity of Geometric Covering Problems Having ConflictsAritra Banik, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot, Saket Saurabh. 61-72 [doi]
• Obedient Plane Drawings for Disk Intersection GraphsBahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow. 73-84 [doi]
• \delta -Greedy t-spannerGali Bar-On, Paz Carmi. 85-96 [doi]
• Dynamic Graph ColoringLuis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot. 97-108 [doi]
• Universal Hinge Patterns for Folding Strips Efficiently into Any Grid PolyhedronNadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw. 109-120 [doi]
• An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-WidthBenjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon. 121-132 [doi]
• Improved Algorithms for Computing k-Sink on Dynamic Flow Path NetworksBinay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh. 133-144 [doi]
• A 2-Approximation for the Height of Maximal Outerplanar Graph DrawingsTherese C. Biedl, Philippe Demontigny. 145-156 [doi]
• Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability GraphsTherese C. Biedl, Martin Derka. 157-168 [doi]
• A Deterministic Algorithm for Online Steiner Tree LeasingMarcin Bienkowski, Artur Kraska, Pawel Schmidt. 169-180 [doi]
• The I/O Complexity of Strassen's Matrix Multiplication with RecomputationGianfranco Bilardi, Lorenzo De Stefani. 181-192 [doi]
• Maximum Plane Trees in Multipartite Geometric GraphsAhmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid. 193-204 [doi]
• Local Routing in Spanners Based on WSPDsProsenjit Bose, Jean-Lou De Carufel, Vida Dujmovic, Frédérik Paradis. 205-216 [doi]
• Relaxing the Irrevocability Requirement for Online Graph AlgorithmsJoan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen. 217-228 [doi]
• Approximating Small Balanced Vertex Separators in Almost Linear TimeSebastian Brandt, Roger Wattenhofer. 229-240 [doi]
• Balanced Line Separators of Unit Disk GraphsPaz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky. 241-252 [doi]
• All-Pairs Shortest Paths in Geometric Intersection GraphsTimothy M. Chan, Dimitrios Skrepetos. 253-264 [doi]
• The Complexity of Drawing Graphs on Few Lines and Few PlanesSteven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff. 265-276 [doi]
• Modular Circulation and Applications to Traffic ManagementPhilip Dasler, David M. Mount. 277-288 [doi]
• The Homogeneous Broadcast Problem in Narrow and Wide StripsMark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak. 289-300 [doi]
• Minimizing the Continuous Diameter When Augmenting a Tree with a ShortcutJean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid. 301-312 [doi]
• Inapproximability of the Standard Pebble Game and Hard to Pebble GraphsErik D. Demaine, Quanquan C. Liu. 313-324 [doi]
• Capacitated Center Problems with Two-Sided Bounds and OutliersHu Ding, Lunjia Hu, Lingxiao Huang, Jian Li. 325-336 [doi]
• Faster Randomized Worst-Case Update Time for Dynamic Subgraph ConnectivityRan Duan, Le Zhang. 337-348 [doi]
• Improved Distance Sensitivity Oracles via Tree PartitioningRan Duan, Tianyi Zhang. 349-360 [doi]
• Delta-Fast Tries: Local Searches in Bounded Universes with Linear SpaceMarcel Ehrhardt, Wolfgang Mulzer. 361-372 [doi]
• Split Packing: Packing Circles into Triangles with Optimal Worst-Case DensitySándor P. Fekete, Sebastian Morr, Christian Scheffer. 373-384 [doi]
• Fast and Compact Planar EmbeddingsLeo Ferres, José Fuentes Sepúlveda, Travis Gagie, Meng He 0001, Gonzalo Navarro. 385-396 [doi]
• When Can Graph Hyperbolicity Be Computed in Linear Time?Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon. 397-408 [doi]
• Optimal Query Time for Encoding Range MajorityPawel Gawrychowski, Patrick K. Nicholson. 409-420 [doi]
• Conditional Lower Bounds for Space/Time TradeoffsIsaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat. 421-436 [doi]
• Posimodular Function OptimizationMagnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa. 437-448 [doi]
• How to Play Hot and Cold on a LineHerman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald. 449-460 [doi]
• Faster Algorithm for Truth Discovery via Range CoverZiyun Huang, Hu Ding, Jinhui Xu 0001. 461-472 [doi]
• Searching Edges in the Overlap of Two Plane GraphsJohn Iacono, Elena Khramtcova, Stefan Langerman. 473-484 [doi]
• Improved Average Complexity for Comparison-Based SortingKazuo Iwama, Junichi Teruyama. 485-496 [doi]
• An EPTAS for Scheduling on Unrelated Machines of Few Different TypesKlaus Jansen, Marten Maack. 497-508 [doi]
• A Polynomial Kernel for Distance-Hereditary Vertex DeletionEun Jung Kim, O-joung Kwon. 509-520 [doi]
• Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract)Frederic Koehler, Samir Khuller. 521-532 [doi]
• Algorithms for Covering Multiple BarriersShimin Li, Haitao Wang 0001. 533-544 [doi]
• An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric SpaceHaitao Wang 0001. 545-556 [doi]
• Covering Uncertain Points in a TreeHaitao Wang 0001, Jingru Zhang. 557-568 [doi]
• Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree SpacesJie Xue, Yuan Li. 569-580 [doi]
• On the Expected Diameter, Width, and Complexity of a Stochastic Convex-HullJie Xue, Yuan Li, Ravi Janardan. 581-592 [doi]