BibTeX record conf/socs/FiegerB0S19

download as .bib file

@inproceedings{DBLP:conf/socs/FiegerB0S19,
  author       = {Kai Fieger and
                  Tom{\'{a}}s Balyo and
                  Christian Schulz and
                  Dominik Schreiber},
  editor       = {Pavel Surynek and
                  William Yeoh},
  title        = {Finding Optimal Longest Paths by Dynamic Programming in Parallel},
  booktitle    = {Proceedings of the Twelfth International Symposium on Combinatorial
                  Search, {SOCS} 2019, Napa, California, 16-17 July 2019},
  pages        = {61--69},
  publisher    = {{AAAI} Press},
  year         = {2019},
  url          = {https://doi.org/10.1609/socs.v10i1.18503},
  doi          = {10.1609/SOCS.V10I1.18503},
  timestamp    = {Mon, 18 Dec 2023 16:58:34 +0100},
  biburl       = {https://dblp.org/rec/conf/socs/FiegerB0S19.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.