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 Caleb Levy and Robert Tarjan. Splaying Preorders and Postorders
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 Katerina Altmanová, Petr Kolman and Jan Voborník. On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow Steven Chaplick, Fedor Fomin, Petr Golovach, Dušan Knop and Peter Zeman. Kernelization of Graph Hamiltonicity: Proper H-Graphs Prosenjit Bose, Pilar Cano, Maria Saumell and Rodrigo I. Silveira. Hamiltonicity for convex shape Delaunay and Gabriel graphs
Aniket Basu Roy, Marin Bougeret, Noam Goldberg and Michael Poss. Approximating the robust bin-packing with budget uncertainty 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 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