WADS B

50 papers

YearTitle / Authors
2017A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings.
Therese Biedl, Philippe Demontigny
2017A Deterministic Algorithm for Online Steiner Tree Leasing.
Marcin Bienkowski, Artur Kraska, Pawel Schmidt
2017A Polynomial Kernel for Distance-Hereditary Vertex Deletion.
Eun Jung Kim, O-joung Kwon
2017Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings
Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack
2017Algorithms for Covering Multiple Barriers.
Shimin Li, Haitao Wang
2017All-Pairs Shortest Paths in Geometric Intersection Graphs.
Timothy M. Chan, Dimitrios Skrepetos
2017An EPTAS for Scheduling on Unrelated Machines of Few Different Types.
Klaus Jansen, Marten Maack
2017An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space.
Haitao Wang
2017An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2017Approximating Small Balanced Vertex Separators in Almost Linear Time.
Sebastian Brandt, Roger Wattenhofer
2017Balanced Line Separators of Unit Disk Graphs.
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2017Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract).
Frederic Koehler, Samir Khuller
2017Capacitated Center Problems with Two-Sided Bounds and Outliers.
Hu Ding, Lunjia Hu, Lingxiao Huang, Jian Li
2017Conditional Lower Bounds for Space/Time Tradeoffs.
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
2017Covering Segments with Unit Squares.
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
2017Covering Uncertain Points in a Tree.
Haitao Wang, Jingru Zhang
2017Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space.
Marcel Ehrhardt, Wolfgang Mulzer
2017Dynamic Graph Coloring.
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
2017Effectiveness of Local Search for Art Gallery Problems.
Sayan Bandyapadhyay, Aniket Basu Roy
2017Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.
Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2017Fast and Compact Planar Embeddings.
Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
2017Faster Algorithm for Truth Discovery via Range Cover.
Ziyun Huang, Hu Ding, Jinhui Xu
2017Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity.
Ran Duan, Le Zhang
2017How to Play Hot and Cold on a Line.
Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald
2017Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks.
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2017Improved Average Complexity for Comparison-Based Sorting.
Kazuo Iwama, Junichi Teruyama
2017Improved Distance Sensitivity Oracles via Tree Partitioning.
Ran Duan, Tianyi Zhang
2017Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs.
Erik D. Demaine, Quanquan C. Liu
2017Local Routing in Spanners Based on WSPDs.
Prosenjit Bose, Jean-Lou De Carufel, Vida Dujmovic, Frédérik Paradis
2017Maximum Plane Trees in Multipartite Geometric Graphs.
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
2017Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut.
Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid
2017Modular Circulation and Applications to Traffic Management.
Philip Dasler, David M. Mount
2017Obedient Plane Drawings for Disk Intersection Graphs.
Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow
2017On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull.
Jie Xue, Yuan Li, Ravi Janardan
2017Optimal Query Time for Encoding Range Majority.
Pawel Gawrychowski, Patrick K. Nicholson
2017Parameterized Complexity of Geometric Covering Problems Having Conflicts.
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
2017Posimodular Function Optimization.
Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
2017Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2017Replica Placement on Bounded Treewidth Graphs.
Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral
2017Searching Edges in the Overlap of Two Plane Graphs.
John Iacono, Elena Khramtcova, Stefan Langerman
2017Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density.
Sándor P. Fekete, Sebastian Morr, Christian Scheffer
2017Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs.
Therese Biedl, Martin Derka
2017Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces.
Jie Xue, Yuan Li
2017The Complexity of Drawing Graphs on Few Lines and Few Planes.
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
2017The Complexity of Tree Partitioning.
Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
2017The Homogeneous Broadcast Problem in Narrow and Wide Strips.
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2017The I/O Complexity of Strassen's Matrix Multiplication with Recomputation.
Gianfranco Bilardi, Lorenzo De Stefani
2017Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron.
Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw
2017When Can Graph Hyperbolicity Be Computed in Linear Time?
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2017\delta -Greedy t-spanner.
Gali Bar-On, Paz Carmi