BibTeX record conf/stacs/KavithaM05

• > Home > conf/stacs/KavithaM05

@inproceedings{DBLP:conf/stacs/KavithaM05,
  author       = {Telikepalli Kavitha and
                  Kurt Mehlhorn},
  title        = {A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  pages        = {654--665},
  year         = {2005},
  crossref     = {DBLP:conf/stacs/2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_54},
  doi          = {10.1007/978-3-540-31856-9\_54},
  timestamp    = {Wed, 19 May 2021 12:05:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KavithaM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/stacs/2005,
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/b106485},
  doi          = {10.1007/B106485},
  isbn         = {3-540-24998-2},
  timestamp    = {Sun, 16 Nov 2025 09:38:18 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/2005.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}