189 results on '"Sadagopan, N."'
Search Results
2. On the Parameterized Complexity of Minus Domination
3. Impact of Diameter and Convex Ordering for Hamiltonicity and Domination
4. On Convexity in Split graphs: Complexity of Steiner tree and Domination
5. On convexity in split graphs: complexity of Steiner tree and domination
6. Steiner Tree in $k$-star Caterpillar Convex Bipartite Graphs -- A Dichotomy
7. Hamiltonicity: Variants and Generalization in $P_5$-free Chordal Bipartite graphs
8. Roman k-Domination: Hardness, Approximation and Parameterized Results
9. Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs
10. Some results on connected vertex separators
11. Domination and its variants in split graphs -P versus NPC dichotomy
12. Roman k-Domination: Hardness, Approximation and Parameterized Results
13. Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs
14. Some algorithmic results on hamiltonicity and its variants in P6-free graphs
15. P Versus NPC: Minimum Steiner Trees in Convex Split Graphs
16. Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy
17. Optimal Layout of (Kp − Cp)n into Wheel-Like Networks
18. Hamiltonicity in Convex Bipartite Graphs
19. On Some Combinatorial Problems in Cographs
20. Hamiltonian Path in Split Graphs- a Dichotomy
21. On $P_5$-free Chordal bipartite graphs
22. FO and MSO approach to Some Graph Problems: Approximation and Poly time Results
23. The Hamiltonian Cycle in $K_{1,r}$-free Split Graphs -- A Dichotomy
24. Constrained Hitting Set and Steiner Tree in $SC_k$ and $2K_2$-free Graphs
25. P Versus NPC: Minimum Steiner Trees in Convex Split Graphs
26. R-connectivity Augmentation in Trees
27. Spanning Trees in 2-trees
28. On strictly Chordality-k graphs
29. On 2K2-free graphs - Structural and Combinatorial View
30. Tri-connectivity Augmentation in Trees
31. 2-Trees: Structural Insights and the study of Hamiltonian Paths
32. Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view
33. Complexity of Steiner Tree in Split Graphs - Dichotomy Results
34. Some Combinatorial Problems on Halin Graphs
35. On strictly chordality-[formula omitted] graphs
36. The Steiner tree in [formula omitted]-free split graphs—A Dichotomy
37. Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
38. On Uni Chord Free Graphs
39. Simpler Sequential and Parallel Biconnectivity Augmentation
40. Domain Specific Hierarchical Huffman Encoding
41. Parallel Search with Extended Fibonacci Primitive
42. A Dirac-type Characterization of k-chordal Graphs
43. On the Complexity of Connected $(s,t)$-Vertex Separator
44. A Characterization of all Stable Minimal Separator Graphs
45. A Note on Contractible Edges in Chordal Graphs
46. A study of neural artistic style transfer models and architectures for Indian art styles
47. Hamiltonicity in Split Graphs - A Dichotomy
48. Hamiltonicity in convex bipartite graphs
49. On some combinatorial problems in cographs
50. A comparison of SDN and NFV for re-designing the LTE Packet Core.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.