N. Sadagopan

J. Interconnect. Networks, 2025

2024

A closer look at Hamiltonicity and domination through the lens of diameter and convexity.

[BibT_eX]

[DOI]

R. Mahendra Kumar

Acta Informatica, December, 2024

On convexity in split graphs: complexity of Steiner tree and domination.

[BibT_eX]

[DOI]

J. Comb. Optim., March, 2024

Embedding of Hypercube into Fractal Cubic Network.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2024

On the Parameterized Complexity of Minus Domination.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Impact of Diameter and Convex Ordering for Hamiltonicity and Domination.

[BibT_eX]

[DOI]

R. Mahendra Kumar

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

2-Trees: Structural insights and the study of Hamiltonian paths.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., May, 2023

On 3-degree 4-chordal graphs.

[BibT_eX]

[DOI]

Devarshi Aggarwal

R. Mahendra Kumar

Discret. Math. Algorithms Appl., January, 2023

Roman k-Domination: Hardness, Approximation and Parameterized Results.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Hamiltonian Cycle in K1, r-Free Split Graphs - A Dichotomy.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2022

P Versus NPC: Minimum Steiner Trees in Convex Split Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Hamiltonicity: Variants and Generalization in P5-free Chordal Bipartite graphs.

[BibT_eX]

[DOI]

CoRR, 2021

2020

The Steiner tree in K1, r-free split graphs - A Dichotomy.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

On strictly chordality-k graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2018

Listing all spanning trees in Halin graphs - sequential and Parallel view.

[BibT_eX]

[DOI]

K. Krishna Mohan Reddy

Discret. Math. Algorithms Appl., 2018

Hamiltonicity in Convex Bipartite Graphs.

[BibT_eX]

[DOI]

P. Kowsika

V. Divya

CoRR, 2018

On Some Combinatorial Problems in Cographs.

[BibT_eX]

[DOI]

Kona Harshita

CoRR, 2018

Hamiltonian Path in K_1, t -free Split Graphs- A Dichotomy.

[BibT_eX]

[DOI]

Pazhaniappan Renjith

Narasimhan Sadagopan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Hamiltonian Path in Split Graphs- a Dichotomy.

[BibT_eX]

[DOI]

CoRR, 2017

On P5-free Chordal bipartite graphs.

[BibT_eX]

[DOI]

S. Aadhavan

CoRR, 2017

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results.

[BibT_eX]

[DOI]

CoRR, 2017

Hamiltonicity in Split Graphs - A Dichotomy.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Tri-connectivity Augmentation in Trees.

[BibT_eX]

[DOI]

V. Manogna

Electron. Notes Discret. Math., 2016

Spanning Trees in 2-trees.

[BibT_eX]

[DOI]

Douglas B. West

CoRR, 2016

Tri-connectivity Augmentation in Trees.

[BibT_eX]

[DOI]

D. Sunil Kumar

CoRR, 2016

R-connectivity Augmentation in Trees.

[BibT_eX]

[DOI]

Nitin Vivek Bharti

CoRR, 2016

Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Complexity of Steiner Tree in Split Graphs - Dichotomy Results.

[BibT_eX]

[DOI]

Madhu Illuri

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

Simpler Sequential and Parallel Biconnectivity Augmentation in Trees.

[BibT_eX]

[DOI]

Surabhi Jain

Parallel Process. Lett., 2015

Connected (s, t)-Vertex Separator Parameterized by Chordality.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Hamiltonian Path in 2-Trees.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Some Combinatorial Problems on Halin Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective.

[BibT_eX]

[DOI]

CoRR, 2014

2013

A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

A Dirac-type characterization of k-chordal graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

Simpler Sequential and Parallel Biconnectivity Augmentation.

[BibT_eX]

[DOI]

Surabhi Jain

G. S. N. V. Venkata Manik

CoRR, 2013

Domain Specific Hierarchical Huffman Encoding.

[BibT_eX]

[DOI]

K. Ilambharathi

B. Sivaselvan

CoRR, 2013

2012

A Dirac-type Characterization of k-chordal Graphs

[BibT_eX]

[DOI]

CoRR, 2012

2011

On the Complexity of Connected (s, t)-Vertex Separator

[BibT_eX]

[DOI]

CoRR, 2011

A Characterization of all Stable Minimal Separator Graphs

[BibT_eX]

[DOI]

Mrinal Kumar

Gaurav Maheshwari

CoRR, 2011

A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

Non-contractible non-edges in 2-connected graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

2009

On the Structure of Contractible Edges in k-connected Partial k-trees.

[BibT_eX]

[DOI]

L. Sunil Chandran

Graphs Comb., 2009

On the Structure of Contractible Vertex Pairs in Chordal Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

A Note on Contractible Edges in Chordal Graphs

[BibT_eX]

[DOI]