default search action
15th WADS 2017: St. John's, NL, Canada
- Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings. Lecture Notes in Computer Science 10389, Springer 2017, ISBN 978-3-319-62126-5 - Ankush Acharyya
, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering Segments with Unit Squares. 1-12 - Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral:
Replica Placement on Bounded Treewidth Graphs. 13-24 - Akanksha Agrawal, Pranabendu Misra, Fahad Panolan
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. 25-36 - Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia:
The Complexity of Tree Partitioning. 37-48 - Sayan Bandyapadhyay, Aniket Basu Roy
Effectiveness of Local Search for Art Gallery Problems. 49-60 - Aritra Banik, Fahad Panolan
Parameterized Complexity of Geometric Covering Problems Having Conflicts. 61-72 - Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow:
Obedient Plane Drawings for Disk Intersection Graphs. 73-84 - Gali Bar-On, Paz Carmi:
\delta -Greedy t-spanner. 85-96 - Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen
Dynamic Graph Coloring. 97-108 - Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron. 109-120 - Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. 121-132 - Binay Bhattacharya, Mordecai J. Golin
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. 133-144 - Therese Biedl, Philippe Demontigny:
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. 145-156 - Therese Biedl, Martin Derka:
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. 157-168 - Marcin Bienkowski
A Deterministic Algorithm for Online Steiner Tree Leasing. 169-180 - Gianfranco Bilardi, Lorenzo De Stefani:
The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. 181-192 - Ahmad Biniaz, Prosenjit Bose
Maximum Plane Trees in Multipartite Geometric Graphs. 193-204 - Prosenjit Bose
Local Routing in Spanners Based on WSPDs. 205-216 - Joan Boyar
Relaxing the Irrevocability Requirement for Online Graph Algorithms. 217-228 - Sebastian Brandt
Approximating Small Balanced Vertex Separators in Almost Linear Time. 229-240 - Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto
Balanced Line Separators of Unit Disk Graphs. 241-252 - Timothy M. Chan, Dimitrios Skrepetos:
All-Pairs Shortest Paths in Geometric Intersection Graphs. 253-264 - Steven Chaplick
The Complexity of Drawing Graphs on Few Lines and Few Planes. 265-276 - Philip Dasler
Modular Circulation and Applications to Traffic Management. 277-288 - Mark de Berg, Hans L. Bodlaender
The Homogeneous Broadcast Problem in Narrow and Wide Strips. 289-300 - Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. 301-312 - Erik D. Demaine, Quanquan C. Liu:
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. 313-324 - Hu Ding, Lunjia Hu
Capacitated Center Problems with Two-Sided Bounds and Outliers. 325-336 - Ran Duan, Le Zhang:
Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity. 337-348 - Ran Duan, Tianyi Zhang
Improved Distance Sensitivity Oracles via Tree Partitioning. 349-360 - Marcel Ehrhardt
Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space. 361-372 - Sándor P. Fekete, Sebastian Morr, Christian Scheffer:
Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density. 373-384 - Leo Ferres
Fast and Compact Planar Embeddings. 385-396 - Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When Can Graph Hyperbolicity Be Computed in Linear Time? 397-408 - Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Query Time for Encoding Range Majority. 409-420 - Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Conditional Lower Bounds for Space/Time Tradeoffs. 421-436 - Magnús M. Halldórsson
Posimodular Function Optimization. 437-448 - Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald
How to Play Hot and Cold on a Line. 449-460 - Ziyun Huang, Hu Ding, Jinhui Xu:
Faster Algorithm for Truth Discovery via Range Cover. 461-472 - John Iacono
Searching Edges in the Overlap of Two Plane Graphs. 473-484 - Kazuo Iwama, Junichi Teruyama:
Improved Average Complexity for Comparison-Based Sorting. 485-496 - Klaus Jansen, Marten Maack:
An EPTAS for Scheduling on Unrelated Machines of Few Different Types. 497-508 - Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. 509-520 - Frederic Koehler, Samir Khuller:
Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract). 521-532 - Shimin Li, Haitao Wang:
Algorithms for Covering Multiple Barriers. 533-544 - Haitao Wang:
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space. 545-556 - Haitao Wang, Jingru Zhang:
Covering Uncertain Points in a Tree. 557-568 - Jie Xue, Yuan Li:
Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces. 569-580 - Jie Xue, Yuan Li, Ravi Janardan:
On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull. 581-592
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-23 19:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: