Inproceedings,
Finding the best shortcut in a geometric network.
M. Farshi, P. Giannopoulos, and J. Gudmundsson.SCG, page 327-335. ACM, (2005)
Meta data
- BibTeX key
- conf/compgeom/FarshiGG05
- entry type
- inproceedings
- booktitle
- SCG
- year
- 2005
- pages
- 327-335
- publisher
- ACM
- crossref
- conf/compgeom/2005
- ee
- https://doi.org/10.1145/1064092.1064143
- isbn
- 1-58113-991-8
- url
- http://dblp.uni-trier.de/db/conf/compgeom/compgeom2005.html#FarshiGG05
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/compgeom/FarshiGG05
%A Farshi, Mohammad
%A Giannopoulos, Panos
%A Gudmundsson, Joachim
%B SCG
%D 2005
%E Mitchell, Joseph S. B.
%E Rote, Günter
%I ACM
%K dblp
%P 327-335
%T Finding the best shortcut in a geometric network.
%U http://dblp.uni-trier.de/db/conf/compgeom/compgeom2005.html#FarshiGG05
%@ 1-58113-991-8
@inproceedings{conf/compgeom/FarshiGG05,
added-at = {2021-06-14T00:00:00.000+0200},
author = {Farshi, Mohammad and Giannopoulos, Panos and Gudmundsson, Joachim},
biburl = {https://www.bibsonomy.org/bibtex/29f3a2b3621575466d3cfaba958feb787/dblp},
booktitle = {SCG},
crossref = {conf/compgeom/2005},
editor = {Mitchell, Joseph S. B. and Rote, Günter},
ee = {https://doi.org/10.1145/1064092.1064143},
interhash = {eef39794916174b46670e09397b1f4a7},
intrahash = {9f3a2b3621575466d3cfaba958feb787},
isbn = {1-58113-991-8},
keywords = {dblp},
pages = {327-335},
publisher = {ACM},
timestamp = {2024-04-09T14:32:45.000+0200},
title = {Finding the best shortcut in a geometric network.},
url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom2005.html#FarshiGG05},
year = 2005
}