BibTeX records: Bino Sebastian V.

download as .bib file

@article{DBLP:journals/dam/VUBB17,
  author       = {Bino Sebastian V. and
                  A. Unnikrishnan and
                  Kannan Balakrishnan and
                  Ramkumar Padinjare Pisharath Balakrishna},
  title        = {Morphological filtering on hypergraphs},
  journal      = {Discret. Appl. Math.},
  volume       = {216},
  pages        = {307--320},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2015.02.008},
  doi          = {10.1016/J.DAM.2015.02.008},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/VUBB17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/VUBR14,
  author       = {Bino Sebastian V. and
                  A. Unnikrishnan and
                  Kannan Balakrishnan and
                  Ramkumar Padinjare Pisharath Balakrishna},
  title        = {Morphological filtering on hypergraphs},
  journal      = {CoRR},
  volume       = {abs/1402.4258},
  year         = {2014},
  url          = {http://arxiv.org/abs/1402.4258},
  eprinttype    = {arXiv},
  eprint       = {1402.4258},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/VUBR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-4831,
  author       = {Bino Sebastian V. and
                  A. Unnikrishnan and
                  Kannan Balakrishnan},
  title        = {Gray Level Co-Occurrence Matrices: Generalisation and Some New Features},
  journal      = {CoRR},
  volume       = {abs/1205.4831},
  year         = {2012},
  url          = {http://arxiv.org/abs/1205.4831},
  eprinttype    = {arXiv},
  eprint       = {1205.4831},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1205-4831.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics