WADS 2017 Accepted Papers

Ankush Acharyya, Subhas C. Nandy, Supantha Pandit and Sasanka Roy. Covering Segments with Unit Squares
Anshul Aggarwal, Venkatesan Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma and Sonika Thakral. Replica Placement on Bounded Treewidth Graphs
Akanksha Agrawal, Pranabendu Misra, Fahad Panolan and Saket Saurabh. Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
Zhao An, Qilong Feng, Iyad Kanj and Ge Xia. The Complexity of Tree Partitioning
Sayan Bandyapadhyay and Aniket Basu Roy. Effectiveness of Local Search for Art Gallery Problems
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot and Saket Saurabh. Parameterized Complexity of Geometric Covering Problems Having Conflicts
Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler and Tillmann Miltzow. Obedient Plane Drawings for Disk Intersection Graphs
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen and Sander Verdonschot. Dynamic Graph Coloring
Gali Bar-On and Paz Carmi. $\delta$-Greedy $t$-spanner
Nadia Benbernou, Erik D. Demaine, Martin L. Demaine and Anna Lubiw. Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
Benjamin Bergougnoux, Mamadou Moustapha Kanté and O-Joung Kwon. An optimal XP algorithm for Hamiltonian Cycle on graphs of bounded clique-width
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda and Naoki Katoh. Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks
Therese Biedl and Philippe Demontigny. A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings
Therese Biedl and Martin Derka. Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs
Marcin Bienkowski, Artur Kraska and Paweł Schmidt. A Deterministic Algorithm for Online Steiner Tree Leasing
Gianfranco Bilardi and Lorenzo De Stefani. The I/O complexity of Strassen’s matrix multiplication with recomputation
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Kimberly Crosbie, David Eppstein, Anil Maheshwari and Michiel Smid. Maximum Plane Trees in Multipartite Geometric Graphs
Prosenjit Bose, Jean-Lou De Carufel, Vida Dujmović and Frédérik Paradis. Local Routing in Spanners Based on WSPDs
Joan Boyar, Lene Favrholdt, Michal Kotrbcik and Kim S. Larsen. Relaxing the Irrevocability Requirement for Online Graph Algorithms
Sebastian Brandt and Roger Wattenhofer. Approximating Small Balanced Vertex Separators in Almost Linear Time
Paz Carmi, Man Kwun Chiu, Matthew Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada and Shakhar Smorodinsky. Balanced Line Separators of Unit Disk Graphs
Timothy Chan and Dimitrios Skrepetos. All-Pairs Shortest Paths in Geometric Intersection Graphs
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky and Alexander Wolff. The Complexity of Drawing Graphs on Few Lines and Few Planes
Philip Dasler and David Mount. Modular Circulation and Applications to Traffic Management
Mark de Berg, Hans L. Bodlaender and Sándor Kisfaludi-Bak. The Homogeneous Broadcast Problem in Narrow and Wide Strips
Jean-Lou De Carufel, Carsten Grimm, Michiel Smid and Stefan Schirra. Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut
Erik Demaine and Quanquan Liu. Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
Hu Ding, Lunjia Hu, Huang Lingxiao and Jian Li. Capacitated Center Problems with Two-Sided Bounds and Outliers
Ran Duan and Le Zhang. Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity
Ran Duan and Tianyi Zhang. Improved distance sensitivity oracles via tree partitioning
Marcel Ehrhardt and Wolfgang Mulzer. Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space
Sándor Fekete, Sebastian Morr and Christian Scheffer. Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density
Leo Ferres, José Fuentes, Travis Gagie, Meng He and Gonzalo Navarro. Fast and Compact Planar Embeddings
Till Fluschnik, Christian Komusiewicz, George Mertzios, André Nichterlein, Rolf Niedermeier and Nimrod Talmon. When can Graph Hyperbolicity be computed in Linear Time?
Pawel Gawrychowski and Patrick K. Nicholson. Optimal Query Time for Encoding Range Majority
Isaac B. Goldstein, Tsvi Kopelowitz, Moshe Lewenstein and Ely Porat. Conditional Lower Bounds for Space/Time Tradeoffs
Magnus M. Halldorsson, Toshimasa Ishii, Kazuhisa Makino and Kenjiro Takazawa. Posimodular Function Optimization
Herman Haverkort, David Kübel, Elmar Langetepe and Barbara Schwarzwald. How to play hot and cold on a line
Ziyun Huang, Hu Ding and Jinhui Xu. Faster Algorithm for Truth Discovery via Range Cover
John Iacono, Elena Khramtcova and Stefan Langerman. Searching edges in the overlap of two plane graphs
Kazuo Iwama and Junichi Teruyama. Improved Average Complexity for Comparison-Based Sorting
Klaus Jansen and Marten Maack. An EPTAS for Scheduling on Unrelated Machines of Few Different Types
Eun Jung Kim and O-Joung Kwon. A polynomial kernel for Distance-Hereditary Vertex Deletion
Frederic Koehler and Samir Khuller. Busy-Time Scheduling on a Bounded Number of Machines
Shimin Li and Haitao Wang. Algorithms for Covering Multiple Barriers
Haitao Wang. An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
Haitao Wang and Jingru Zhang. Covering Uncertain Points in a Tree
Jie Xue and Yuan Li. Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces
Jie Xue, Yuan Li and Ravi Janardan. On the expected diameter, width, and complexity of a stochastic convex-hull