Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/wads/wads2017.bht:"
@inproceedings{DBLP:conf/wads/000117, author = {Haitao Wang}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {545--556}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_46}, doi = {10.1007/978-3-319-62127-2\_46}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/wads/000117.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/AcharyyaNPR17, author = {Ankush Acharyya and Subhas C. Nandy and Supantha Pandit and Sasanka Roy}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Covering Segments with Unit Squares}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {1--12}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_1}, doi = {10.1007/978-3-319-62127-2\_1}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/AcharyyaNPR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/AggarwalCGSST17, author = {Anshul Aggarwal and Venkatesan T. Chakaravarthy and Neelima Gupta and Yogish Sabharwal and Sachin Sharma and Sonika Thakral}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Replica Placement on Bounded Treewidth Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {13--24}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_2}, doi = {10.1007/978-3-319-62127-2\_2}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/AggarwalCGSST17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/AgrawalMPS17, author = {Akanksha Agrawal and Pranabendu Misra and Fahad Panolan and Saket Saurabh}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Fast Exact Algorithms for Survivable Network Design with Uniform Requirements}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {25--36}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_3}, doi = {10.1007/978-3-319-62127-2\_3}, timestamp = {Tue, 02 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/AgrawalMPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/AnFKX17, author = {Zhao An and Qilong Feng and Iyad A. Kanj and Ge Xia}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {The Complexity of Tree Partitioning}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {37--48}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_4}, doi = {10.1007/978-3-319-62127-2\_4}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/AnFKX17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BandyapadhyayR17, author = {Sayan Bandyapadhyay and Aniket Basu Roy}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Effectiveness of Local Search for Art Gallery Problems}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {49--60}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_5}, doi = {10.1007/978-3-319-62127-2\_5}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/BandyapadhyayR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BanikP0SS17, author = {Aritra Banik and Fahad Panolan and Venkatesh Raman and Vibha Sahlot and Saket Saurabh}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Parameterized Complexity of Geometric Covering Problems Having Conflicts}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {61--72}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_6}, doi = {10.1007/978-3-319-62127-2\_6}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/BanikP0SS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BanyassadyHKLM17, author = {Bahareh Banyassady and Michael Hoffmann and Boris Klemz and Maarten L{\"{o}}ffler and Tillmann Miltzow}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Obedient Plane Drawings for Disk Intersection Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {73--84}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_7}, doi = {10.1007/978-3-319-62127-2\_7}, timestamp = {Wed, 15 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/BanyassadyHKLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/Bar-OnC17, author = {Gali Bar{-}On and Paz Carmi}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {{\textbackslash}delta -Greedy t-spanner}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {85--96}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_8}, doi = {10.1007/978-3-319-62127-2\_8}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/Bar-OnC17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BarbaCKLRRV17, author = {Luis Barba and Jean Cardinal and Matias Korman and Stefan Langerman and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Sander Verdonschot}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Dynamic Graph Coloring}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {97--108}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_9}, doi = {10.1007/978-3-319-62127-2\_9}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/BarbaCKLRRV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BenbernouDDL17, author = {Nadia M. Benbernou and Erik D. Demaine and Martin L. Demaine and Anna Lubiw}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {109--120}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_10}, doi = {10.1007/978-3-319-62127-2\_10}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/BenbernouDDL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BergBK17, author = {Mark de Berg and Hans L. Bodlaender and S{\'{a}}ndor Kisfaludi{-}Bak}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {The Homogeneous Broadcast Problem in Narrow and Wide Strips}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {289--300}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_25}, doi = {10.1007/978-3-319-62127-2\_25}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/BergBK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BergougnouxKK17, author = {Benjamin Bergougnoux and Mamadou Moustapha Kant{\'{e}} and O{-}joung Kwon}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {An Optimal {XP} Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {121--132}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_11}, doi = {10.1007/978-3-319-62127-2\_11}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/BergougnouxKK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BhattacharyaGHK17, author = {Binay Bhattacharya and Mordecai J. Golin and Yuya Higashikawa and Tsunehiko Kameda and Naoki Katoh}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {133--144}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_12}, doi = {10.1007/978-3-319-62127-2\_12}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/BhattacharyaGHK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BiedlD17, author = {Therese Biedl and Philippe Demontigny}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {145--156}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_13}, doi = {10.1007/978-3-319-62127-2\_13}, timestamp = {Thu, 11 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/BiedlD17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BiedlD17a, author = {Therese Biedl and Martin Derka}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Splitting B{\_}2 -VPG Graphs into Outer-String and Co-Comparability Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {157--168}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_14}, doi = {10.1007/978-3-319-62127-2\_14}, timestamp = {Thu, 11 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/BiedlD17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BienkowskiKS17, author = {Marcin Bienkowski and Artur Kraska and Pawel Schmidt}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {A Deterministic Algorithm for Online Steiner Tree Leasing}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {169--180}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_15}, doi = {10.1007/978-3-319-62127-2\_15}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/BienkowskiKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BilardiS17, author = {Gianfranco Bilardi and Lorenzo De Stefani}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {The {I/O} Complexity of Strassen's Matrix Multiplication with Recomputation}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {181--192}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_16}, doi = {10.1007/978-3-319-62127-2\_16}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/BilardiS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BiniazBCCEMS17, author = {Ahmad Biniaz and Prosenjit Bose and Kimberly Crosbie and Jean{-}Lou De Carufel and David Eppstein and Anil Maheshwari and Michiel H. M. Smid}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Maximum Plane Trees in Multipartite Geometric Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {193--204}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_17}, doi = {10.1007/978-3-319-62127-2\_17}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/BiniazBCCEMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BoseCDP17, author = {Prosenjit Bose and Jean{-}Lou De Carufel and Vida Dujmovic and Fr{\'{e}}d{\'{e}}rik Paradis}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Local Routing in Spanners Based on WSPDs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {205--216}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_18}, doi = {10.1007/978-3-319-62127-2\_18}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/BoseCDP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BoyarFKL17, author = {Joan Boyar and Lene M. Favrholdt and Michal Kotrbc{\'{\i}}k and Kim S. Larsen}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Relaxing the Irrevocability Requirement for Online Graph Algorithms}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {217--228}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_19}, doi = {10.1007/978-3-319-62127-2\_19}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/BoyarFKL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BrandtW17, author = {Sebastian Brandt and Roger Wattenhofer}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Approximating Small Balanced Vertex Separators in Almost Linear Time}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {229--240}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_20}, doi = {10.1007/978-3-319-62127-2\_20}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/BrandtW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/CarmiCKKORRSS17, author = {Paz Carmi and Man{-}Kwun Chiu and Matthew J. Katz and Matias Korman and Yoshio Okamoto and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Taichi Shiitada and Shakhar Smorodinsky}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Balanced Line Separators of Unit Disk Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {241--252}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_21}, doi = {10.1007/978-3-319-62127-2\_21}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/CarmiCKKORRSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/CarufelGSS17, author = {Jean{-}Lou De Carufel and Carsten Grimm and Stefan Schirra and Michiel H. M. Smid}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {301--312}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_26}, doi = {10.1007/978-3-319-62127-2\_26}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/CarufelGSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/ChanS17, author = {Timothy M. Chan and Dimitrios Skrepetos}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {All-Pairs Shortest Paths in Geometric Intersection Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {253--264}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_22}, doi = {10.1007/978-3-319-62127-2\_22}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/ChanS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/ChaplickFLRVW17, author = {Steven Chaplick and Krzysztof Fleszar and Fabian Lipp and Alexander Ravsky and Oleg Verbitsky and Alexander Wolff}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {The Complexity of Drawing Graphs on Few Lines and Few Planes}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {265--276}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_23}, doi = {10.1007/978-3-319-62127-2\_23}, timestamp = {Thu, 13 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/ChaplickFLRVW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/DaslerM17, author = {Philip Dasler and David M. Mount}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Modular Circulation and Applications to Traffic Management}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {277--288}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_24}, doi = {10.1007/978-3-319-62127-2\_24}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/DaslerM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/DemaineL17, author = {Erik D. Demaine and Quanquan C. Liu}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {313--324}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_27}, doi = {10.1007/978-3-319-62127-2\_27}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/DemaineL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/DingHHL17, author = {Hu Ding and Lunjia Hu and Lingxiao Huang and Jian Li}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Capacitated Center Problems with Two-Sided Bounds and Outliers}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {325--336}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_28}, doi = {10.1007/978-3-319-62127-2\_28}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/DingHHL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/DuanZ17, author = {Ran Duan and Le Zhang}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {337--348}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_29}, doi = {10.1007/978-3-319-62127-2\_29}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/DuanZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/DuanZ17a, author = {Ran Duan and Tianyi Zhang}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Improved Distance Sensitivity Oracles via Tree Partitioning}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {349--360}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_30}, doi = {10.1007/978-3-319-62127-2\_30}, timestamp = {Wed, 03 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/DuanZ17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/EhrhardtM17, author = {Marcel Ehrhardt and Wolfgang Mulzer}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {361--372}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_31}, doi = {10.1007/978-3-319-62127-2\_31}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/EhrhardtM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/FeketeMS17, author = {S{\'{a}}ndor P. Fekete and Sebastian Morr and Christian Scheffer}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {373--384}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_32}, doi = {10.1007/978-3-319-62127-2\_32}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/FeketeMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/FerresSG0N17, author = {Leo Ferres and Jos{\'{e}} Fuentes{-}Sep{\'{u}}lveda and Travis Gagie and Meng He and Gonzalo Navarro}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Fast and Compact Planar Embeddings}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {385--396}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_33}, doi = {10.1007/978-3-319-62127-2\_33}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/FerresSG0N17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/FluschnikKMNNT17, author = {Till Fluschnik and Christian Komusiewicz and George B. Mertzios and Andr{\'{e}} Nichterlein and Rolf Niedermeier and Nimrod Talmon}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {When Can Graph Hyperbolicity Be Computed in Linear Time?}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {397--408}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_34}, doi = {10.1007/978-3-319-62127-2\_34}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/FluschnikKMNNT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/GawrychowskiN17, author = {Pawel Gawrychowski and Patrick K. Nicholson}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Optimal Query Time for Encoding Range Majority}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {409--420}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_35}, doi = {10.1007/978-3-319-62127-2\_35}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/GawrychowskiN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/GoldsteinKLP17, author = {Isaac Goldstein and Tsvi Kopelowitz and Moshe Lewenstein and Ely Porat}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Conditional Lower Bounds for Space/Time Tradeoffs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {421--436}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_36}, doi = {10.1007/978-3-319-62127-2\_36}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/GoldsteinKLP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/HalldorssonIMT17, author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Toshimasa Ishii and Kazuhisa Makino and Kenjiro Takazawa}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Posimodular Function Optimization}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {437--448}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_37}, doi = {10.1007/978-3-319-62127-2\_37}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/HalldorssonIMT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/HaverkortKLS17, author = {Herman J. Haverkort and David K{\"{u}}bel and Elmar Langetepe and Barbara Schwarzwald}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {How to Play Hot and Cold on a Line}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {449--460}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_38}, doi = {10.1007/978-3-319-62127-2\_38}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/HaverkortKLS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/HuangD017, author = {Ziyun Huang and Hu Ding and Jinhui Xu}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Faster Algorithm for Truth Discovery via Range Cover}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {461--472}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_39}, doi = {10.1007/978-3-319-62127-2\_39}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/HuangD017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/IaconoKL17, author = {John Iacono and Elena Khramtcova and Stefan Langerman}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Searching Edges in the Overlap of Two Plane Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {473--484}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_40}, doi = {10.1007/978-3-319-62127-2\_40}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/IaconoKL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/IwamaT17, author = {Kazuo Iwama and Junichi Teruyama}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Improved Average Complexity for Comparison-Based Sorting}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {485--496}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_41}, doi = {10.1007/978-3-319-62127-2\_41}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/IwamaT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/JansenM17, author = {Klaus Jansen and Marten Maack}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {An {EPTAS} for Scheduling on Unrelated Machines of Few Different Types}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {497--508}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_42}, doi = {10.1007/978-3-319-62127-2\_42}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/JansenM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/KimK17, author = {Eun Jung Kim and O{-}joung Kwon}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {A Polynomial Kernel for Distance-Hereditary Vertex Deletion}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {509--520}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_43}, doi = {10.1007/978-3-319-62127-2\_43}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/KimK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/KoehlerK17, author = {Frederic Koehler and Samir Khuller}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract)}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {521--532}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_44}, doi = {10.1007/978-3-319-62127-2\_44}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/KoehlerK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/Li017, author = {Shimin Li and Haitao Wang}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Algorithms for Covering Multiple Barriers}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {533--544}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_45}, doi = {10.1007/978-3-319-62127-2\_45}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/Li017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/WangZ17, author = {Haitao Wang and Jingru Zhang}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Covering Uncertain Points in a Tree}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {557--568}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_47}, doi = {10.1007/978-3-319-62127-2\_47}, timestamp = {Sun, 23 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/WangZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/XueL17, author = {Jie Xue and Yuan Li}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {569--580}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_48}, doi = {10.1007/978-3-319-62127-2\_48}, timestamp = {Fri, 27 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/XueL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/XueLJ17, author = {Jie Xue and Yuan Li and Ravi Janardan}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {581--592}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_49}, doi = {10.1007/978-3-319-62127-2\_49}, timestamp = {Fri, 27 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/XueLJ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wads/2017, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2}, doi = {10.1007/978-3-319-62127-2}, isbn = {978-3-319-62126-5}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/2017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.