BibTeX record conf/cocoon/LinHT21

• > Home > conf/cocoon/LinHT21

@inproceedings{DBLP:conf/cocoon/LinHT21,
  author       = {Chun Lin and
                  Chao{-}Yuan Huang and
                  Ming{-}Jer Tsai},
  editor       = {Chi{-}Yeh Chen and
                  Wing{-}Kai Hon and
                  Ling{-}Ju Hung and
                  Chia{-}Wei Lee},
  title        = {An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences},
  booktitle    = {Computing and Combinatorics - 27th International Conference, {COCOON}
                  2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13025},
  pages        = {25--36},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-89543-3\_3},
  doi          = {10.1007/978-3-030-89543-3\_3},
  timestamp    = {Fri, 22 Oct 2021 15:23:42 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/LinHT21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}