BibTeX record conf/soda/ElkinPS15

download as .bib file

@inproceedings{DBLP:conf/soda/ElkinPS15,
  author       = {Michael Elkin and
                  Seth Pettie and
                  Hsin{-}Hao Su},
  editor       = {Piotr Indyk},
  title        = {(2{\(\Delta\)} - l)-Edge-Coloring is Much Easier than Maximal Matching
                  in the Distributed Setting},
  booktitle    = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages        = {355--370},
  publisher    = {{SIAM}},
  year         = {2015},
  url          = {https://doi.org/10.1137/1.9781611973730.26},
  doi          = {10.1137/1.9781611973730.26},
  timestamp    = {Tue, 02 Feb 2021 17:07:35 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ElkinPS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics