Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs

Ferran Hurtado, Giuseppe Liotta, Henk Meijer. Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Roberto Tamassia, editors, Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings. Volume 2125 of Lecture Notes in Computer Science, pages 2-13, Springer, 2001. [doi]

@inproceedings{HurtadoLM01,
  title = {Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs},
  author = {Ferran Hurtado and Giuseppe Liotta and Henk Meijer},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2125/21250002.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/HurtadoLM01},
  cites = {0},
  citedby = {0},
  pages = {2-13},
  booktitle = {Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
  editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Roberto Tamassia},
  volume = {2125},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42423-7},
}