BibTeX record conf/compgeom/Har-PeledY22

download as .bib file

@inproceedings{DBLP:conf/compgeom/Har-PeledY22,
  author       = {Sariel Har{-}Peled and
                  Everett Yang},
  editor       = {Xavier Goaoc and
                  Michael Kerber},
  title        = {Approximation Algorithms for Maximum Matchings in Geometric Intersection
                  Graphs},
  booktitle    = {38th International Symposium on Computational Geometry, SoCG 2022,
                  June 7-10, 2022, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {224},
  pages        = {47:1--47:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2022.47},
  doi          = {10.4230/LIPICS.SOCG.2022.47},
  timestamp    = {Wed, 01 Jun 2022 17:01:01 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/Har-PeledY22.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.