BibTeX records: Ajish Kumar K. S

download as .bib file

@article{DBLP:journals/endm/MS16,
  author       = {Amal P. M and
                  Ajish Kumar K. S},
  title        = {An Algorithm for k\({}^{\mbox{th}}\) Minimum Spanning Tree},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {53},
  pages        = {343--354},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.endm.2016.05.029},
  doi          = {10.1016/J.ENDM.2016.05.029},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/MS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/endm/KMS16,
  author       = {Divya K and
                  Amal P. M and
                  Ajish Kumar K. S},
  title        = {A degree based approach to find Steiner Trees},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {53},
  pages        = {383--393},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.endm.2016.05.033},
  doi          = {10.1016/J.ENDM.2016.05.033},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/KMS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.