BibTeX record conf/wads/BalasubramanianRS93

• > Home > conf/wads/BalasubramanianRS93

@inproceedings{DBLP:conf/wads/BalasubramanianRS93,
  author       = {R. Balasubramanian and
                  Venkatesh Raman and
                  G. Srinivasaraghavan},
  editor       = {Frank K. H. A. Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Nicola Santoro and
                  Sue Whitesides},
  title        = {The Complexity of Finding Certain Trees in Tournaments},
  booktitle    = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
                  Canada, August 11-13, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {709},
  pages        = {142--150},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-57155-8\_243},
  doi          = {10.1007/3-540-57155-8\_243},
  timestamp    = {Fri, 21 Oct 2022 15:45:11 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BalasubramanianRS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}