BibTeX record conf/isaac/DumasF0T22

download as .bib file

@inproceedings{DBLP:conf/isaac/DumasF0T22,
  author       = {Ma{\"{e}}l Dumas and
                  Florent Foucaud and
                  Anthony Perez and
                  Ioan Todinca},
  editor       = {Sang Won Bae and
                  Heejin Park},
  title        = {On Graphs Coverable by k Shortest Paths},
  booktitle    = {33rd International Symposium on Algorithms and Computation, {ISAAC}
                  2022, December 19-21, 2022, Seoul, Korea},
  series       = {LIPIcs},
  volume       = {248},
  pages        = {40:1--40:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.40},
  doi          = {10.4230/LIPICS.ISAAC.2022.40},
  timestamp    = {Mon, 03 Jun 2024 16:30:04 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/DumasF0T22.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.