BibTeX record conf/esa/Kociumaka023

download as .bib file

@inproceedings{DBLP:conf/esa/Kociumaka023,
  author       = {Tomasz Kociumaka and
                  Adam Polak},
  editor       = {Inge Li G{\o}rtz and
                  Martin Farach{-}Colton and
                  Simon J. Puglisi and
                  Grzegorz Herman},
  title        = {Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths},
  booktitle    = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
                  4-6, 2023, Amsterdam, The Netherlands},
  series       = {LIPIcs},
  volume       = {274},
  pages        = {72:1--72:10},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2023.72},
  doi          = {10.4230/LIPICS.ESA.2023.72},
  timestamp    = {Mon, 05 Feb 2024 20:32:36 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/Kociumaka023.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.