BibTeX record conf/icalp/LauriaPRT13

download as .bib file

@inproceedings{DBLP:conf/icalp/LauriaPRT13,
  author       = {Massimo Lauria and
                  Pavel Pudl{\'{a}}k and
                  Vojtech R{\"{o}}dl and
                  Neil Thapen},
  editor       = {Fedor V. Fomin and
                  Rusins Freivalds and
                  Marta Z. Kwiatkowska and
                  David Peleg},
  title        = {The Complexity of Proving That a Graph Is Ramsey},
  booktitle    = {Automata, Languages, and Programming - 40th International Colloquium,
                  {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7965},
  pages        = {684--695},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39206-1\_58},
  doi          = {10.1007/978-3-642-39206-1\_58},
  timestamp    = {Sun, 02 Jun 2019 21:28:07 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/LauriaPRT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics