WADS 2019 Accepted Papers

Yang Jiao and R Ravi. Inventory Routing Problem with Facility Location
Hans Bodlaender, Sudeshna Kolay and Astrid Pieterse. Parameterized Complexity of Conflict-free Graph Coloring
Moran Feldman. Guess Free Maximization of Submodular and Linear Sums
Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson and Daniel Paulusma. Graph Isomorphism for (H1,H2)-Free Graphs: An Almost Complete Dichotomy
Caleb Levy and Robert Tarjan. Splaying Preorders and Postorders
Giordano Da Lozzo, Giuseppe Di Battista and Fabrizio Frati. Extending Upward Planar Graph Drawings
Ahmad Biniaz. Plane Hop Spanners for Unit Disk Graphs
Jongmin Choi, Sergio Cabello and Hee-Kap Ahn. Maximizing Dominance in the Plane and its Applications
Christopher Johnson and Haitao Wang. A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
Chien-Chung Huang and Naonori Kakimura. Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint
Max Bannach and Sebastian Berndt. Positive-Instance Driven Dynamic Programming for Graph Searching
Timothy M. Chan, Yakov Nekrich and Michiel Smid. Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles
Katerina Altmanová, Petr Kolman and Jan Voborník. On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
Sushmita Gupta, Sanjukta Roy, Saket Saurabh and Meirav Zehavi. Balanced Stable Marriage: How Close is Close Enough?
Tim Baumann and Torben Hagerup. Rank-Select Indices Without Tears
Steven Chaplick, Fedor Fomin, Petr Golovach, Dušan Knop and Peter Zeman. Kernelization of Graph Hamiltonicity: Proper H-Graphs
Sándor Fekete, Sven von Höveling and Christian Scheffer. Online Circle Packing
Toni Böhnlein, Oliver Schaudt and Joachim Schauer. Stackelberg Packing Games
Matteo Ceccarello, Anne Driemel and Francesco Silvestri. FRESH: Fréchet Similarity with Hashing
Prosenjit Bose, Pilar Cano, Maria Saumell and Rodrigo I. Silveira. Hamiltonicity for convex shape Delaunay and Gabriel graphs
Boris Aronov, Omrit Filtser, Michael Horton, Matthew Katz and Khadijeh Sheikhan. Efficient Nearest-Neighbor Query and Clustering of Planar Curves
Aniket Basu Roy, Marin Bougeret, Noam Goldberg and Michael Poss. Approximating the robust bin-packing with budget uncertainty
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi and Michiel Smid. On the Minimum Consistent Subset Problem
Daniel Lokshtanov, Ramanujan M. Sridharan, Saket Saurabh, Roohani Sharma and Meirav Zehavi. Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS
Prosenjit Bose, Paz Carmi, Mark J. Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal and Michiel Smid. Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
Sang-Sub Kim, Rolf Klein, David Kübel, Elmar Langetepe and Barbara Schwarzwald. Geometric Firefighting in the Half-plane
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič and Mary Servatius. Avoidable Vertices and Edges in Graphs
Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk and Frank Staals. Most vital segment barriers
Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara and Yushi Uno. Reconfiguring Undirected Paths
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo and Srinivasa Rao Satti. Succinct Data Structures for Families of Interval Graphs
Clément Maria and Hannah Schreiber. Discrete Morse Theory for Computing Zigzag Persistence
Yu Gao, David Durfee, Anup Rao and Sebastian Wild. Efficient Second-Order Shape-Constrained Function Fitting
Timothy Chan, Saladi Rahul and Jie Xue. Range closest-pair search in higher dimensions
Haitao Wang and Jie Xue. Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points
Vincent Chau, Shengzhong Feng, Minming Li, Yinling Wang, Guochuan Zhang and Yong Zhang. Weighted Throughput Maximization with Calibrations
Amariah Becker and Alice Paul. A Framework for Vehicle Routing Approximation Schemes in Trees
Amariah Becker, Philip Klein and Aaron Schild. A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
Robert Tarjan, Caleb Levy and Stephen Timmel. Zip Trees
Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani and Vincenzo Roselli. How to Morph a Tree on a Small Grid
Joan Boyar, Lene M. Favrholdt, Shahin Kamali and Kim S. Larsen. Online Bin Covering with Advice
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz and Ely Porat. Dynamic Online Dictionary Matching
Bryce Sandlund, Richard Peng and Daniel Sleator. Optimal Offline Dynamic 2,3-Edge/Vertex Connectivity