Kanduru V. Krishna

30 papers B 2C 1Journal 26Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Characterization of double-arborescences and their minimum length word-representants.
Discret. Appl. Math.
Tithi Dwary, Kanduru V. Krishna
2026 B conf
Minimum Length Word-Representants of Treelike Permutation Graphs.
SOFSEM
Tithi Dwary, Kanduru V. Krishna
2026 B conf
Mutually Abelian-Bordered Binary Words.
SOFSEM
Anuran Maity, Kanduru V. Krishna
2026 J jnl
Word-Representation of Melon Graphs.
CoRR
Khyodeno Mozhui, Kanduru V. Krishna
2026 J jnl
Word-Representation of Melon Graphs.
Graphs Comb.
Khyodeno Mozhui, Kanduru V. Krishna
2025 J jnl
Characterization of Split Comparability Graphs.
CoRR
Tithi Dwary, Khyodeno Mozhui, Kanduru V. Krishna
2025 J jnl
Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable.
CoRR
Khyodeno Mozhui, Tithi Dwary, Kanduru V. Krishna
2025 J jnl
On the Conjecture of the Representation Number of Bipartite Graphs.
CoRR
Khyodeno Mozhui, Kanduru V. Krishna
2025 J jnl
Representation Number of Word-Representable Split Graphs.
CoRR
Tithi Dwary, Khyodeno Mozhui, Kanduru V. Krishna
2025 J jnl
Word-Representability of Well-Partitioned Chordal Graphs.
CoRR
Tithi Dwary, Kanduru V. Krishna
2024 J jnl
Characterization of Double-Arborescences and their Minimum-Word-Representants.
CoRR
Tithi Dwary, Kanduru V. Krishna
2024 J jnl
Characterization of Word-Representable Graphs using Modular Decomposition.
CoRR
Tithi Dwary, Kanduru V. Krishna
2024 J jnl
Word-Representability of Graphs with respect to Split Recomposition.
CoRR
Tithi Dwary, Kanduru V. Krishna
2024 J jnl
Word-representability of graphs with respect to split recomposition.
Discret. Appl. Math.
Tithi Dwary, Kanduru V. Krishna
2023 J jnl
Graphs with Permutation-Representation Number at most Three.
CoRR
Khyodeno Mozhui, Kanduru V. Krishna
2023 J jnl
On the Permutation-Representation Number of Bipartite Graphs using Neighborhood Graphs.
CoRR
Khyodeno Mozhui, Kanduru V. Krishna
2021 J jnl
On the Representation Number of Bipartite Graphs.
CoRR
Khyodeno Mozhui, Kanduru V. Krishna
2018 C conf
On Syntactic Complexity of Circular Semi-flower Automata.
CIAA
Shubh Narayan Singh, Kanduru V. Krishna
2018 J jnl
On the structure of C-algebras through atomicity and if-then-else.
CoRR
Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri
2017 J jnl
Axiomatization of if-then-else over monoids of possibly non-halting programs and tests.
CoRR
Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri
2017 J jnl
Axiomatization of if-then-else over possibly non-halting programs and tests.
Int. J. Algebra Comput.
Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri
2016 J jnl
Axiomatization of if-then-else over possibly non-halting programs and tests.
CoRR
Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri
2016 J jnl
The Holonomy Decomposition of some Circular Semi-Flower Automata.
Acta Cybern.
Shubh Narayan Singh, Kanduru V. Krishna
2015 J jnl
Syntactic semigroup problem for the semigroup reducts of Affine Near-semirings over Brandt Semigroups.
CoRR
Jitender Kumar, Kanduru V. Krishna
2014 J jnl
$L$-Primitive Words in Submonoids.
CoRR
Shubh Narayan Singh, Kanduru V. Krishna
2013 J jnl
Syntactic Complexity of Circular Semi-Flower Automata.
CoRR
Shubh Narayan Singh, Kanduru V. Krishna
2013 J jnl
The Holonomy Decomposition of Circular Semi-Flower Automata.
CoRR
Shubh Narayan Singh, Kanduru V. Krishna
2011 J jnl
A Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid
CoRR
Shubh Narayan Singh, Kanduru V. Krishna
2011 J jnl
The Rank and Hanna Neumann Property of Some Submonoids of a Free Monoid
CoRR
Shubh Narayan Singh, Kanduru V. Krishna
2011 — conf
Towards Shortest Synchronizing Words in Polynomial Time.
AFL
Vedala T. K. Pramod, Kanduru V. Krishna