BibTeX record conf/stoc/ChalopinG09

download as .bib file

@inproceedings{DBLP:conf/stoc/ChalopinG09,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Daniel Gon{\c{c}}alves},
  editor       = {Michael Mitzenmacher},
  title        = {Every planar graph is the intersection graph of segments in the plane:
                  extended abstract},
  booktitle    = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
                  {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
  pages        = {631--638},
  publisher    = {{ACM}},
  year         = {2009},
  url          = {https://doi.org/10.1145/1536414.1536500},
  doi          = {10.1145/1536414.1536500},
  timestamp    = {Tue, 06 Nov 2018 11:07:05 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ChalopinG09.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.