| Publication | Date of Publication | Type |
|---|
Embedding of hypercube into fractal cubic network
Parallel Processing Letters | 2025-01-03 | Paper |
A closer look at Hamiltonicity and domination through the lens of diameter and convexity
Acta Informatica | 2024-11-07 | Paper |
| Impact of diameter and convex ordering for Hamiltonicity and domination | 2024-05-31 | Paper |
On convexity in split graphs: complexity of Steiner tree and domination
Journal of Combinatorial Optimization | 2024-03-04 | Paper |
Roman \(k\)-domination: hardness, approximation and parameterized results
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs
Advances in Pure and Applied Mathematics | 2023-08-31 | Paper |
Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
2-Trees: Structural insights and the study of Hamiltonian paths
Discrete Mathematics, Algorithms and Applications | 2023-07-15 | Paper |
On 3-degree 4-chordal graphs
Discrete Mathematics, Algorithms and Applications | 2023-07-14 | Paper |
Some results on connected vertex separators
The Journal of Analysis | 2023-05-19 | Paper |
P versus NPC: minimum Steiner trees in convex split graphs
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy
The Journal of Analysis | 2023-03-22 | Paper |
Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs
The Journal of Analysis | 2022-10-27 | Paper |
Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
| Hamiltonicity: Variants and Generalization in $P_5$-free Chordal Bipartite graphs | 2021-07-10 | Paper |
On strictly chordality-\(k\) graphs
Discrete Applied Mathematics | 2020-05-18 | Paper |
The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy
Discrete Applied Mathematics | 2020-05-18 | Paper |
| Hamiltonicity in Convex Bipartite Graphs | 2018-09-17 | Paper |
Hamiltonian path in \(K_{1,t}\)-free split graphs -- a dichotomy
(available as arXiv preprint) | 2018-06-05 | Paper |
Listing all spanning trees in Halin graphs -- sequential and parallel view
Discrete Mathematics, Algorithms and Applications | 2018-02-23 | Paper |
Simpler sequential and parallel biconnectivity augmentation in trees
Parallel Processing Letters | 2017-12-15 | Paper |
Non-contractible non-edges in 2-connected graphs
Information Processing Letters | 2017-11-03 | Paper |
Hamiltonicity in Split Graphs - A Dichotomy
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Tri-connectivity augmentation in trees
(available as arXiv preprint) | 2016-10-19 | Paper |
| R-connectivity Augmentation in Trees | 2016-08-05 | Paper |
Complexity of Steiner tree in split graphs -- dichotomy results
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
| On 2K2-free graphs - Structural and Combinatorial View | 2016-02-11 | Paper |
Connected \((s,t)\)-vertex separator parameterized by chordality
Journal of Graph Algorithms and Applications | 2015-11-25 | Paper |
A Dirac-type characterization of \(k\)-chordal graphs
Discrete Mathematics | 2014-01-27 | Paper |
A unified framework for bi(tri)connectivity and chordal augmentation
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
On the structure of contractible vertex pairs in chordal graphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
On the structure of contractible edges in \(k\)-connected partial \(k\)-trees
Graphs and Combinatorics | 2010-01-18 | Paper |
