BibTeX records: N. Sadagopan

download as .bib file

@article{DBLP:journals/jco/MohanapriyaRS24,
  author       = {A. Mohanapriya and
                  P. Renjith and
                  N. Sadagopan},
  title        = {On convexity in split graphs: complexity of Steiner tree and domination},
  journal      = {J. Comb. Optim.},
  volume       = {47},
  number       = {2},
  pages        = {8},
  year         = {2024},
  url          = {https://doi.org/10.1007/s10878-024-01105-1},
  doi          = {10.1007/S10878-024-01105-1},
  timestamp    = {Mon, 01 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/MohanapriyaRS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/caldam/KumarS24,
  author       = {R. Mahendra Kumar and
                  N. Sadagopan},
  editor       = {Subrahmanyam Kalyanasundaram and
                  Anil Maheshwari},
  title        = {Impact of Diameter and Convex Ordering for Hamiltonicity and Domination},
  booktitle    = {Algorithms and Discrete Applied Mathematics - 10th International Conference,
                  {CALDAM} 2024, Bhilai, India, February 15-17, 2024, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14508},
  pages        = {194--208},
  publisher    = {Springer},
  year         = {2024},
  url          = {https://doi.org/10.1007/978-3-031-52213-0\_14},
  doi          = {10.1007/978-3-031-52213-0\_14},
  timestamp    = {Thu, 18 Jan 2024 08:27:17 +0100},
  biburl       = {https://dblp.org/rec/conf/caldam/KumarS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sofsem/BhyravarapuKMPSS24,
  author       = {Sriram Bhyravarapu and
                  Lawqueen Kanesh and
                  A. Mohanapriya and
                  Nidhi Purohit and
                  N. Sadagopan and
                  Saket Saurabh},
  editor       = {Henning Fernau and
                  Serge Gaspers and
                  Ralf Klasing},
  title        = {On the Parameterized Complexity of Minus Domination},
  booktitle    = {{SOFSEM} 2024: Theory and Practice of Computer Science - 49th International
                  Conference on Current Trends in Theory and Practice of Computer Science,
                  {SOFSEM} 2024, Cochem, Germany, February 19-23, 2024, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14519},
  pages        = {96--110},
  publisher    = {Springer},
  year         = {2024},
  url          = {https://doi.org/10.1007/978-3-031-52113-3\_7},
  doi          = {10.1007/978-3-031-52113-3\_7},
  timestamp    = {Sun, 25 Feb 2024 15:20:57 +0100},
  biburl       = {https://dblp.org/rec/conf/sofsem/BhyravarapuKMPSS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dmaa/AggarwalKS23,
  author       = {Devarshi Aggarwal and
                  R. Mahendra Kumar and
                  N. Sadagopan},
  title        = {On 3-degree 4-chordal graphs},
  journal      = {Discret. Math. Algorithms Appl.},
  volume       = {15},
  number       = {1},
  pages        = {2250053:1--2250053:23},
  year         = {2023},
  url          = {https://doi.org/10.1142/S1793830922500537},
  doi          = {10.1142/S1793830922500537},
  timestamp    = {Sat, 29 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dmaa/AggarwalKS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dmaa/RenjithS23,
  author       = {P. Renjith and
                  N. Sadagopan},
  title        = {2-Trees: Structural insights and the study of Hamiltonian paths},
  journal      = {Discret. Math. Algorithms Appl.},
  volume       = {15},
  number       = {4},
  pages        = {2250113:1--2250113:24},
  year         = {2023},
  url          = {https://doi.org/10.1142/S1793830922501130},
  doi          = {10.1142/S1793830922501130},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dmaa/RenjithS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/caldam/MohanapriyaRS23,
  author       = {A. Mohanapriya and
                  P. Renjith and
                  N. Sadagopan},
  editor       = {Amitabha Bagchi and
                  Rahul Muthu},
  title        = {Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem
                  on Bisplit Graphs},
  booktitle    = {Algorithms and Discrete Applied Mathematics - 9th International Conference,
                  {CALDAM} 2023, Gandhinagar, India, February 9-11, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13947},
  pages        = {219--230},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-25211-2\_17},
  doi          = {10.1007/978-3-031-25211-2\_17},
  timestamp    = {Fri, 03 Feb 2023 17:54:57 +0100},
  biburl       = {https://dblp.org/rec/conf/caldam/MohanapriyaRS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/walcom/MohanapriyaRS23,
  author       = {A. Mohanapriya and
                  P. Renjith and
                  N. Sadagopan},
  editor       = {Chun{-}Cheng Lin and
                  Bertrand M. T. Lin and
                  Giuseppe Liotta},
  title        = {Roman k-Domination: Hardness, Approximation and Parameterized Results},
  booktitle    = {{WALCOM:} Algorithms and Computation - 17th International Conference
                  and Workshops, {WALCOM} 2023, Hsinchu, Taiwan, March 22-24, 2023,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13973},
  pages        = {343--355},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-27051-2\_29},
  doi          = {10.1007/978-3-031-27051-2\_29},
  timestamp    = {Fri, 17 Mar 2023 15:41:43 +0100},
  biburl       = {https://dblp.org/rec/conf/walcom/MohanapriyaRS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/RenjithS22,
  author       = {P. Renjith and
                  N. Sadagopan},
  title        = {Hamiltonian Cycle in K1, r-Free Split Graphs - {A} Dichotomy},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {33},
  number       = {1},
  pages        = {1--32},
  year         = {2022},
  url          = {https://doi.org/10.1142/S0129054121500337},
  doi          = {10.1142/S0129054121500337},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/RenjithS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jco/HMRS22,
  author       = {Aneesh D. H and
                  A. Mohanapriya and
                  P. Renjith and
                  N. Sadagopan},
  title        = {Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy},
  journal      = {J. Comb. Optim.},
  volume       = {44},
  number       = {2},
  pages        = {1221--1247},
  year         = {2022},
  url          = {https://doi.org/10.1007/s10878-022-00884-9},
  doi          = {10.1007/S10878-022-00884-9},
  timestamp    = {Thu, 25 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/HMRS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/caldam/MohanapriyaRS22,
  author       = {A. Mohanapriya and
                  P. Renjith and
                  N. Sadagopan},
  editor       = {Niranjan Balachandran and
                  R. Inkulu},
  title        = {P Versus {NPC:} Minimum Steiner Trees in Convex Split Graphs},
  booktitle    = {Algorithms and Discrete Applied Mathematics - 8th International Conference,
                  {CALDAM} 2022, Puducherry, India, February 10-12, 2022, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13179},
  pages        = {115--126},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-030-95018-7\_10},
  doi          = {10.1007/978-3-030-95018-7\_10},
  timestamp    = {Fri, 28 Jan 2022 16:21:27 +0100},
  biburl       = {https://dblp.org/rec/conf/caldam/MohanapriyaRS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2210-02288,
  author       = {A. Mohanapriya and
                  P. Renjith and
                  N. Sadagopan},
  title        = {On Convexity in Split graphs: Complexity of Steiner tree and Domination},
  journal      = {CoRR},
  volume       = {abs/2210.02288},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.02288},
  doi          = {10.48550/ARXIV.2210.02288},
  eprinttype    = {arXiv},
  eprint       = {2210.02288},
  timestamp    = {Fri, 07 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-02288.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2107-04798,
  author       = {S. Aadhavan and
                  R. Mahendra Kumar and
                  P. Renjith and
                  N. Sadagopan},
  title        = {Hamiltonicity: Variants and Generalization in P\({}^{\mbox{5}}\)-free
                  Chordal Bipartite graphs},
  journal      = {CoRR},
  volume       = {abs/2107.04798},
  year         = {2021},
  url          = {https://arxiv.org/abs/2107.04798},
  eprinttype    = {arXiv},
  eprint       = {2107.04798},
  timestamp    = {Tue, 20 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2107-04798.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2107-09382,
  author       = {Aneesh D. H and
                  A. Mohanapriya and
                  P. Renjith and
                  N. Sadagopan},
  title        = {Steiner Tree in k-star Caterpillar Convex Bipartite Graphs - {A} Dichotomy},
  journal      = {CoRR},
  volume       = {abs/2107.09382},
  year         = {2021},
  url          = {https://arxiv.org/abs/2107.09382},
  eprinttype    = {arXiv},
  eprint       = {2107.09382},
  timestamp    = {Thu, 29 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2107-09382.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/DhanalakshmiS20,
  author       = {S. Dhanalakshmi and
                  N. Sadagopan},
  title        = {On strictly chordality-k graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {280},
  pages        = {93--112},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.dam.2018.06.028},
  doi          = {10.1016/J.DAM.2018.06.028},
  timestamp    = {Fri, 15 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/DhanalakshmiS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/RenjithS20,
  author       = {P. Renjith and
                  N. Sadagopan},
  title        = {The Steiner tree in K1, r-free split graphs - {A} Dichotomy},
  journal      = {Discret. Appl. Math.},
  volume       = {280},
  pages        = {246--255},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.dam.2018.05.050},
  doi          = {10.1016/J.DAM.2018.05.050},
  timestamp    = {Fri, 22 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/RenjithS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dmaa/ReddyRS18,
  author       = {K. Krishna Mohan Reddy and
                  P. Renjith and
                  N. Sadagopan},
  title        = {Listing all spanning trees in Halin graphs - sequential and Parallel
                  view},
  journal      = {Discret. Math. Algorithms Appl.},
  volume       = {10},
  number       = {1},
  pages        = {1850005:1--1850005:17},
  year         = {2018},
  url          = {https://doi.org/10.1142/S1793830918500052},
  doi          = {10.1142/S1793830918500052},
  timestamp    = {Wed, 12 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dmaa/ReddyRS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/caldam/RenjithS18,
  author       = {Pazhaniappan Renjith and
                  Narasimhan Sadagopan},
  editor       = {B. S. Panda and
                  Partha P. Goswami},
  title        = {Hamiltonian Path in K{\_}1, t -free Split Graphs- {A} Dichotomy},
  booktitle    = {Algorithms and Discrete Applied Mathematics - 4th International Conference,
                  {CALDAM} 2018, Guwahati, India, February 15-17, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10743},
  pages        = {30--44},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-74180-2\_3},
  doi          = {10.1007/978-3-319-74180-2\_3},
  timestamp    = {Wed, 09 Jun 2021 08:38:40 +0200},
  biburl       = {https://dblp.org/rec/conf/caldam/RenjithS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1808-09117,
  author       = {Kona Harshita and
                  N. Sadagopan},
  title        = {On Some Combinatorial Problems in Cographs},
  journal      = {CoRR},
  volume       = {abs/1808.09117},
  year         = {2018},
  url          = {http://arxiv.org/abs/1808.09117},
  eprinttype    = {arXiv},
  eprint       = {1808.09117},
  timestamp    = {Mon, 03 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1808-09117.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1809-06113,
  author       = {P. Kowsika and
                  V. Divya and
                  N. Sadagopan},
  title        = {Hamiltonicity in Convex Bipartite Graphs},
  journal      = {CoRR},
  volume       = {abs/1809.06113},
  year         = {2018},
  url          = {http://arxiv.org/abs/1809.06113},
  eprinttype    = {arXiv},
  eprint       = {1809.06113},
  timestamp    = {Fri, 05 Oct 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1809-06113.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/caldam/RenjithS17,
  author       = {P. Renjith and
                  N. Sadagopan},
  editor       = {Daya Ram Gaur and
                  N. S. Narayanaswamy},
  title        = {Hamiltonicity in Split Graphs - {A} Dichotomy},
  booktitle    = {Algorithms and Discrete Applied Mathematics - Third International
                  Conference, {CALDAM} 2017, Sancoale, Goa, India, February 16-18, 2017,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10156},
  pages        = {320--331},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-53007-9\_28},
  doi          = {10.1007/978-3-319-53007-9\_28},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/caldam/RenjithS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1711-02889,
  author       = {Kona Harshita and
                  Sounaka Mishra and
                  P. Renjith and
                  N. Sadagopan},
  title        = {{FO} and {MSO} approach to Some Graph Problems: Approximation and
                  Poly time Results},
  journal      = {CoRR},
  volume       = {abs/1711.02889},
  year         = {2017},
  url          = {http://arxiv.org/abs/1711.02889},
  eprinttype    = {arXiv},
  eprint       = {1711.02889},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1711-02889.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1711-07736,
  author       = {S. Aadhavan and
                  P. Renjith and
                  N. Sadagopan},
  title        = {On P\({}_{\mbox{5}}\)-free Chordal bipartite graphs},
  journal      = {CoRR},
  volume       = {abs/1711.07736},
  year         = {2017},
  url          = {http://arxiv.org/abs/1711.07736},
  eprinttype    = {arXiv},
  eprint       = {1711.07736},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1711-07736.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1711-09262,
  author       = {P. Renjith and
                  N. Sadagopan},
  title        = {Hamiltonian Path in Split Graphs- a Dichotomy},
  journal      = {CoRR},
  volume       = {abs/1711.09262},
  year         = {2017},
  url          = {http://arxiv.org/abs/1711.09262},
  eprinttype    = {arXiv},
  eprint       = {1711.09262},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1711-09262.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/endm/DhanalakshmiSM16,
  author       = {S. Dhanalakshmi and
                  N. Sadagopan and
                  V. Manogna},
  title        = {Tri-connectivity Augmentation in Trees},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {53},
  pages        = {57--72},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.endm.2016.05.006},
  doi          = {10.1016/J.ENDM.2016.05.006},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/DhanalakshmiSM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/caldam/IlluriRS16,
  author       = {Madhu Illuri and
                  P. Renjith and
                  N. Sadagopan},
  editor       = {Sathish Govindarajan and
                  Anil Maheshwari},
  title        = {Complexity of Steiner Tree in Split Graphs - Dichotomy Results},
  booktitle    = {Algorithms and Discrete Applied Mathematics - Second International
                  Conference, {CALDAM} 2016, Thiruvananthapuram, India, February 18-20,
                  2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9602},
  pages        = {308--325},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-29221-2\_27},
  doi          = {10.1007/978-3-319-29221-2\_27},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/caldam/IlluriRS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/DhanalakshmiSK16,
  author       = {S. Dhanalakshmi and
                  N. Sadagopan and
                  D. Sunil Kumar},
  title        = {Tri-connectivity Augmentation in Trees},
  journal      = {CoRR},
  volume       = {abs/1601.00506},
  year         = {2016},
  url          = {http://arxiv.org/abs/1601.00506},
  eprinttype    = {arXiv},
  eprint       = {1601.00506},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DhanalakshmiSK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/DhanalakshmiS16,
  author       = {S. Dhanalakshmi and
                  N. Sadagopan},
  title        = {On strictly Chordality-k graphs},
  journal      = {CoRR},
  volume       = {abs/1606.00359},
  year         = {2016},
  url          = {http://arxiv.org/abs/1606.00359},
  eprinttype    = {arXiv},
  eprint       = {1606.00359},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DhanalakshmiS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/RenjithSW16,
  author       = {P. Renjith and
                  N. Sadagopan and
                  Douglas B. West},
  title        = {Spanning Trees in 2-trees},
  journal      = {CoRR},
  volume       = {abs/1607.05817},
  year         = {2016},
  url          = {http://arxiv.org/abs/1607.05817},
  eprinttype    = {arXiv},
  eprint       = {1607.05817},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/RenjithSW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/DhanalakshmiSB16,
  author       = {S. Dhanalakshmi and
                  N. Sadagopan and
                  Nitin Vivek Bharti},
  title        = {R-connectivity Augmentation in Trees},
  journal      = {CoRR},
  volume       = {abs/1608.01971},
  year         = {2016},
  url          = {http://arxiv.org/abs/1608.01971},
  eprinttype    = {arXiv},
  eprint       = {1608.01971},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DhanalakshmiSB16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/DhanalakshmiS16a,
  author       = {S. Dhanalakshmi and
                  N. Sadagopan},
  title        = {Constrained Hitting Set and Steiner Tree in SC\({}_{\mbox{k}}\) and
                  2K\({}_{\mbox{2}}\)-free Graphs},
  journal      = {CoRR},
  volume       = {abs/1610.00853},
  year         = {2016},
  url          = {http://arxiv.org/abs/1610.00853},
  eprinttype    = {arXiv},
  eprint       = {1610.00853},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DhanalakshmiS16a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/RenjithS16,
  author       = {P. Renjith and
                  N. Sadagopan},
  title        = {Hamiltonicity in Split Graphs- a dichotomy},
  journal      = {CoRR},
  volume       = {abs/1610.00855},
  year         = {2016},
  url          = {http://arxiv.org/abs/1610.00855},
  eprinttype    = {arXiv},
  eprint       = {1610.00855},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/RenjithS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/NarayanaswamyS15,
  author       = {N. S. Narayanaswamy and
                  N. Sadagopan},
  title        = {Connected (s, t)-Vertex Separator Parameterized by Chordality},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {19},
  number       = {1},
  pages        = {549--565},
  year         = {2015},
  url          = {https://doi.org/10.7155/jgaa.00377},
  doi          = {10.7155/JGAA.00377},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/NarayanaswamyS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ppl/JainS15,
  author       = {Surabhi Jain and
                  N. Sadagopan},
  title        = {Simpler Sequential and Parallel Biconnectivity Augmentation in Trees},
  journal      = {Parallel Process. Lett.},
  volume       = {25},
  number       = {4},
  pages        = {1550010:1--1550010:15},
  year         = {2015},
  url          = {https://doi.org/10.1142/S0129626415500103},
  doi          = {10.1142/S0129626415500103},
  timestamp    = {Tue, 24 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ppl/JainS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/IlluriRS15,
  author       = {Madhu Illuri and
                  P. Renjith and
                  N. Sadagopan},
  title        = {Complexity of Steiner Tree in Split Graphs - Dichotomy Results},
  journal      = {CoRR},
  volume       = {abs/1511.01668},
  year         = {2015},
  url          = {http://arxiv.org/abs/1511.01668},
  eprinttype    = {arXiv},
  eprint       = {1511.01668},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/IlluriRS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/ReddyRS15,
  author       = {K. Krishna Mohan Reddy and
                  P. Renjith and
                  N. Sadagopan},
  title        = {Listing All Spanning Trees in Halin Graphs - Sequential and Parallel
                  view},
  journal      = {CoRR},
  volume       = {abs/1511.01696},
  year         = {2015},
  url          = {http://arxiv.org/abs/1511.01696},
  eprinttype    = {arXiv},
  eprint       = {1511.01696},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ReddyRS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/RenjithS15,
  author       = {P. Renjith and
                  N. Sadagopan},
  title        = {Hamiltonian Path in 2-Trees},
  journal      = {CoRR},
  volume       = {abs/1511.02038},
  year         = {2015},
  url          = {http://arxiv.org/abs/1511.02038},
  eprinttype    = {arXiv},
  eprint       = {1511.02038},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/RenjithS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/CBRSS14,
  author       = {Vandhana C. and
                  S. Hima Bindhu and
                  P. Renjith and
                  N. Sadagopan and
                  B. Supraja},
  title        = {Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective},
  journal      = {CoRR},
  volume       = {abs/1408.3977},
  year         = {2014},
  url          = {http://arxiv.org/abs/1408.3977},
  eprinttype    = {arXiv},
  eprint       = {1408.3977},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CBRSS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/KavinKSSV14,
  author       = {M. Kavin and
                  K. Keerthana and
                  N. Sadagopan and
                  Sangeetha S and
                  R. Vinothini},
  title        = {Some Combinatorial Problems on Halin Graphs},
  journal      = {CoRR},
  volume       = {abs/1410.6621},
  year         = {2014},
  url          = {http://arxiv.org/abs/1410.6621},
  eprinttype    = {arXiv},
  eprint       = {1410.6621},
  timestamp    = {Fri, 04 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KavinKSSV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KrithikaMNS13,
  author       = {R. Krithika and
                  Rogers Mathew and
                  N. S. Narayanaswamy and
                  N. Sadagopan},
  title        = {A Dirac-type characterization of \emph{k}-chordal graphs},
  journal      = {Discret. Math.},
  volume       = {313},
  number       = {24},
  pages        = {2865--2867},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.disc.2013.08.032},
  doi          = {10.1016/J.DISC.2013.08.032},
  timestamp    = {Thu, 23 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/KrithikaMNS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/NarayanaswamyS13,
  author       = {N. S. Narayanaswamy and
                  N. Sadagopan},
  title        = {A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {24},
  number       = {1},
  pages        = {67--94},
  year         = {2013},
  url          = {https://doi.org/10.1142/S0129054113400054},
  doi          = {10.1142/S0129054113400054},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/NarayanaswamyS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/IlambharathiMSS13,
  author       = {K. Ilambharathi and
                  G. S. N. V. Venkata Manik and
                  N. Sadagopan and
                  B. Sivaselvan},
  title        = {Domain Specific Hierarchical Huffman Encoding},
  journal      = {CoRR},
  volume       = {abs/1307.0920},
  year         = {2013},
  url          = {http://arxiv.org/abs/1307.0920},
  eprinttype    = {arXiv},
  eprint       = {1307.0920},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/IlambharathiMSS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/JainS13,
  author       = {Surabhi Jain and
                  N. Sadagopan},
  title        = {Simpler Sequential and Parallel Biconnectivity Augmentation},
  journal      = {CoRR},
  volume       = {abs/1307.1772},
  year         = {2013},
  url          = {http://arxiv.org/abs/1307.1772},
  eprinttype    = {arXiv},
  eprint       = {1307.1772},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/JainS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1206-5397,
  author       = {R. Krithika and
                  Rogers Mathew and
                  N. S. Narayanaswamy and
                  N. Sadagopan},
  title        = {A Dirac-type Characterization of k-chordal Graphs},
  journal      = {CoRR},
  volume       = {abs/1206.5397},
  year         = {2012},
  url          = {http://arxiv.org/abs/1206.5397},
  eprinttype    = {arXiv},
  eprint       = {1206.5397},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1206-5397.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cats/NarayanaswamyS11,
  author       = {N. S. Narayanaswamy and
                  N. Sadagopan},
  editor       = {Alex Potanin and
                  Taso Viglas},
  title        = {A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree
                  Augmentation},
  booktitle    = {Seventeenth Computing: The Australasian Theory Symposium, {CATS} 2011,
                  Perth, Australia, January 2011},
  series       = {{CRPIT}},
  volume       = {119},
  pages        = {45--54},
  publisher    = {Australian Computer Society},
  year         = {2011},
  url          = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV119Narayanaswamy.html},
  timestamp    = {Mon, 08 Feb 2021 13:26:46 +0100},
  biburl       = {https://dblp.org/rec/conf/cats/NarayanaswamyS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1103-2913,
  author       = {Mrinal Kumar and
                  Gaurav Maheshwari and
                  N. Sadagopan},
  title        = {A Characterization of all Stable Minimal Separator Graphs},
  journal      = {CoRR},
  volume       = {abs/1103.2913},
  year         = {2011},
  url          = {http://arxiv.org/abs/1103.2913},
  eprinttype    = {arXiv},
  eprint       = {1103.2913},
  timestamp    = {Wed, 27 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1103-2913.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1111-1814,
  author       = {N. S. Narayanaswamy and
                  N. Sadagopan},
  title        = {On the Complexity of Connected (s, t)-Vertex Separator},
  journal      = {CoRR},
  volume       = {abs/1111.1814},
  year         = {2011},
  url          = {http://arxiv.org/abs/1111.1814},
  eprinttype    = {arXiv},
  eprint       = {1111.1814},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1111-1814.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/DasFMS10,
  author       = {Anita Das and
                  Mathew C. Francis and
                  Rogers Mathew and
                  N. Sadagopan},
  title        = {Non-contractible non-edges in 2-connected graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {110},
  number       = {23},
  pages        = {1044--1048},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.ipl.2010.09.005},
  doi          = {10.1016/J.IPL.2010.09.005},
  timestamp    = {Mon, 09 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/DasFMS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/endm/NarayanaswamyS09,
  author       = {N. S. Narayanaswamy and
                  N. Sadagopan},
  title        = {On the Structure of Contractible Vertex Pairs in Chordal Graphs},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {33},
  pages        = {29--36},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.endm.2009.03.005},
  doi          = {10.1016/J.ENDM.2009.03.005},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/NarayanaswamyS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/gc/NarayanaswamySC09,
  author       = {N. S. Narayanaswamy and
                  N. Sadagopan and
                  L. Sunil Chandran},
  title        = {On the Structure of Contractible Edges in \emph{k}-connected Partial
                  \emph{k}-trees},
  journal      = {Graphs Comb.},
  volume       = {25},
  number       = {4},
  pages        = {557--569},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00373-009-0851-y},
  doi          = {10.1007/S00373-009-0851-Y},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/NarayanaswamySC09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0902-1364,
  author       = {N. S. Narayanaswamy and
                  N. Sadagopan and
                  Apoorve Dubey},
  title        = {A Note on Contractible Edges in Chordal Graphs},
  journal      = {CoRR},
  volume       = {abs/0902.1364},
  year         = {2009},
  url          = {http://arxiv.org/abs/0902.1364},
  eprinttype    = {arXiv},
  eprint       = {0902.1364},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0902-1364.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.