BibTeX record conf/compgeom/DasN94a

download as .bib file

@inproceedings{DBLP:conf/compgeom/DasN94a,
  author       = {Gautam Das and
                  Giri Narasimhan},
  editor       = {Kurt Mehlhorn},
  title        = {Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment
                  in a Polygon},
  booktitle    = {Proceedings of the Tenth Annual Symposium on Computational Geometry,
                  Stony Brook, New York, USA, June 6-8, 1994},
  pages        = {259--266},
  publisher    = {{ACM}},
  year         = {1994},
  url          = {https://doi.org/10.1145/177424.177984},
  doi          = {10.1145/177424.177984},
  timestamp    = {Mon, 05 Feb 2024 20:28:28 +0100},
  biburl       = {https://dblp.org/rec/conf/compgeom/DasN94a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.