Search dblp for Publications

export results for "Computing a Longest Common Palindromic Subsequence"

 download as .bib file

@article{DBLP:journals/fuin/ChowdhuryHIR14,
  author       = {Shihabur Rahman Chowdhury and
                  Md. Mahbubul Hasan and
                  Sumaiya Iqbal and
                  M. Sohel Rahman},
  title        = {Computing a Longest Common Palindromic Subsequence},
  journal      = {Fundam. Informaticae},
  volume       = {129},
  number       = {4},
  pages        = {329--340},
  year         = {2014},
  url          = {https://doi.org/10.3233/FI-2014-974},
  doi          = {10.3233/FI-2014-974},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fuin/ChowdhuryHIR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/ChowdhuryHIR12,
  author       = {Shihabur Rahman Chowdhury and
                  Md. Mahbubul Hasan and
                  Sumaiya Iqbal and
                  M. Sohel Rahman},
  editor       = {S. Arumugam and
                  W. F. Smyth},
  title        = {Computing a Longest Common Palindromic Subsequence},
  booktitle    = {Combinatorial Algorithms, 23rd International Workshop, {IWOCA} 2012,
                  Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7643},
  pages        = {219--223},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-35926-2\_24},
  doi          = {10.1007/978-3-642-35926-2\_24},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/ChowdhuryHIR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-5296,
  author       = {Shihabur Rahman Chowdhury and
                  Md. Mahbubul Hasan and
                  Sumaiya Iqbal and
                  M. Sohel Rahman},
  title        = {Computing a Longest Common Palindromic Subsequence},
  journal      = {CoRR},
  volume       = {abs/1110.5296},
  year         = {2011},
  url          = {http://arxiv.org/abs/1110.5296},
  eprinttype    = {arXiv},
  eprint       = {1110.5296},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1110-5296.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics