Kanduru V. Krishna

According to our database, Kanduru V. Krishna authored at least 28 papers between 2011 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Word-Representation of Melon Graphs.

Khyodeno Mozhui, Kanduru V. Krishna

Graphs Comb., April, 2026

Characterization of double-arborescences and their minimum length word-representants.

Tithi Dwary, Kanduru V. Krishna

Discret. Appl. Math., 2026

Mutually Abelian-Bordered Binary Words.

Anuran Maity, Kanduru V. Krishna

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

Minimum Length Word-Representants of Treelike Permutation Graphs.

Tithi Dwary, Kanduru V. Krishna

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

2025

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable.

Khyodeno Mozhui, Tithi Dwary, Kanduru V. Krishna

CoRR, September, 2025

On the Conjecture of the Representation Number of Bipartite Graphs.

Khyodeno Mozhui, Kanduru V. Krishna

CoRR, June, 2025

Characterization of Split Comparability Graphs.

Tithi Dwary, Khyodeno Mozhui, Kanduru V. Krishna

CoRR, April, 2025

Word-Representability of Well-Partitioned Chordal Graphs.

Tithi Dwary, Kanduru V. Krishna

CoRR, April, 2025

Representation Number of Word-Representable Split Graphs.

Tithi Dwary, Khyodeno Mozhui, Kanduru V. Krishna

CoRR, February, 2025

An Upper Bound for the Permutation-representation Number of Bipartite Graphs.

Khyodeno Mozhui, Kanduru Venkata Krishna

J. Inf. Process., 2025

2024

A branch group in a class of non-contracting weakly regular branch groups.

Sagar Saha, Kanduru Venkata Krishna

Int. J. Algebra Comput., September, 2024

Word-representability of graphs with respect to split recomposition.

Tithi Dwary, Kanduru V. Krishna

Discret. Appl. Math., 2024

Characterization of Word-Representable Graphs using Modular Decomposition.

Tithi Dwary, Kanduru V. Krishna

CoRR, 2024

Characterization of Double-Arborescences and their Minimum-Word-Representants.

Tithi Dwary, Kanduru V. Krishna

CoRR, 2024

2023

On the Permutation-Representation Number of Bipartite Graphs using Neighborhood Graphs.

Khyodeno Mozhui, Kanduru V. Krishna

CoRR, 2023

Graphs with Permutation-Representation Number at most Three.

Khyodeno Mozhui, Kanduru V. Krishna

CoRR, 2023

2021

On the Representation Number of Bipartite Graphs.

Khyodeno Mozhui, Kanduru V. Krishna

CoRR, 2021

2018

On the structure of C-algebras through atomicity and if-then-else.

Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri

CoRR, 2018

On Syntactic Complexity of Circular Semi-flower Automata.

Shubh Narayan Singh, Kanduru V. Krishna

Proceedings of the Implementation and Application of Automata, 2018

2017

Axiomatization of if-then-else over possibly non-halting programs and tests.

Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri

Int. J. Algebra Comput., 2017

Axiomatization of if-then-else over monoids of possibly non-halting programs and tests.

Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri

CoRR, 2017

2016

The Holonomy Decomposition of some Circular Semi-Flower Automata.

Shubh Narayan Singh, Kanduru V. Krishna

Acta Cybern., 2016

2015

Syntactic semigroup problem for the semigroup reducts of Affine Near-semirings over Brandt Semigroups.

Jitender Kumar, Kanduru V. Krishna

CoRR, 2015

2014

$L$-Primitive Words in Submonoids.

Shubh Narayan Singh, Kanduru V. Krishna

CoRR, 2014

2013

The Holonomy Decomposition of Circular Semi-Flower Automata.

Shubh Narayan Singh, Kanduru V. Krishna

CoRR, 2013

2011

A Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid

Shubh Narayan Singh, Kanduru V. Krishna

CoRR, 2011

The Rank and Hanna Neumann Property of Some Submonoids of a Free Monoid

Shubh Narayan Singh, Kanduru V. Krishna

CoRR, 2011

Towards Shortest Synchronizing Words in Polynomial Time.

Vedala T. K. Pramod, Kanduru V. Krishna

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011