Piecewise Linear Paths Among Convex Obstacles

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 291
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorBerg, Mark de-
dc.contributor.authorMatousek, Jiri-
dc.contributor.authorCheong, Otfried-
dc.date.accessioned2013-03-14T11:42:40Z-
dc.date.available2013-03-14T11:42:40Z-
dc.date.created2012-02-06-
dc.date.issued1993-05-16-
dc.identifier.citation25th Annual ACM Symposium on Theory of Computing (STOC 1993), v., no., pp.505 - 514-
dc.identifier.urihttp://hdl.handle.net/10203/108313-
dc.languageENG-
dc.titlePiecewise Linear Paths Among Convex Obstacles-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage505-
dc.citation.endingpage514-
dc.citation.publicationname25th Annual ACM Symposium on Theory of Computing (STOC 1993)-
dc.identifier.conferencecountryUnited States-
dc.identifier.conferencecountryUnited States-
dc.contributor.localauthorCheong, Otfried-
dc.contributor.nonIdAuthorBerg, Mark de-
dc.contributor.nonIdAuthorMatousek, Jiri-
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0