default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBhadrachalam Chitturi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Jayakumar Pai, Bhadrachalam Chitturi
:
Super oriented cycles in permutations. Comput. Biol. Medicine 165: 107426 (2023)- 2022
- [j15]Indulekha Thekkethuruthel Sadanandan, Bhadrachalam Chitturi:
Optimal Algorithms for Sorting Permutations with Brooms. Algorithms 15(7): 220 (2022) - 2021
- [j14]Jayakumar Pai, Bhadrachalam Chitturi:
Approximation algorithms for sorting permutations by extreme block-interchanges. Theor. Comput. Sci. 891: 105-115 (2021) - [j13]Pramod P. Nair, Rajan Sundaravaradhan, Bhadrachalam Chitturi:
Improved upper bound for sorting permutations by prefix transpositions. Theor. Comput. Sci. 896: 158-167 (2021) - 2020
- [j12]Sai Satwik Kuppili, Bhadrachalam Chitturi:
Exact upper bound for sorting Rn with LE. Discret. Math. Algorithms Appl. 12(3): 2050033:1-2050033:12 (2020) - [j11]Pramod P. Nair, Rajan Sundaravaradhan, Bhadrachalam Chitturi:
A new upper bound for sorting permutations with prefix transpositions. Discret. Math. Algorithms Appl. 12(6): 2050077:1-2050077:15 (2020) - [i6]Sai Satwik Kuppili, Bhadrachalam Chitturi:
An Upper Bound for Sorting Rn with LRE. CoRR abs/2002.07342 (2020)
2010 – 2019
- 2019
- [j10]Bhadrachalam Chitturi, Priyanshu Das:
Sorting permutations with transpositions in O(n3) amortized time. Theor. Comput. Sci. 766: 30-37 (2019) - [c12]Sai Satwik Kuppili, Bhadrachalam Chitturi, T. Srinath:
An Upper Bound for Sorting R_n with LE. ICACDS (2) 2019: 240-249 - 2018
- [j9]Bhadrachalam Chitturi, Srijith Balachander, Sandeep Satheesh, Krithic Puthiyoppil:
Layered Graphs: Applications and Algorithms. Algorithms 11(7): 93 (2018) - [c11]Athira Selvam, Sravya K. V. S. P. Sai, Bhadrachalam Chitturi:
Counting Chemical Structures Resembling Trees. ICACCI 2018: 845-849 - [c10]Bhadrachalam Chitturi, Priyanshu Das:
Scheduling Applications of DAGs. ICACCI 2018: 2158-2160 - [i5]Bhadrachalam Chitturi, Jayakumar Pai:
Minimum-Link Rectilinear Covering Tour is NP-hard in R4. CoRR abs/1810.00529 (2018) - [i4]Bhadrachalam Chitturi, Indulekha T. S:
Sorting permutations with a transposition tree. CoRR abs/1811.07443 (2018) - 2017
- [c9]Seeniya Uthan, Bhadrachalam Chitturi:
Bounding the diameter of cayley graphs generated by specific transposition trees. ICACCI 2017: 1242-1248 - [c8]Gayathri Rajendran, Prabaharan Poornachandran, Bhadrachalam Chitturi:
Deep learning model on stance classification. ICACCI 2017: 2407-2409 - [i3]Bhadrachalam Chitturi:
Layered graphs: a class that admits polynomial time solutions for some hard problems. CoRR abs/1705.06425 (2017) - [i2]Bhadrachalam Chitturi, Priyanshu Das:
Distances in and Layering of a DAG. CoRR abs/1711.03256 (2017) - 2016
- [c7]K. P. Sinsha, Bhadrachalam Chitturi:
A study of gene prioritization algorithms on PPI networks. ICACCI 2016: 927-934 - [i1]Bhadrachalam Chitturi, Krishnaveni K. S:
Adjacencies in Permutations. CoRR abs/1601.04469 (2016) - 2015
- [j8]Bhadrachalam Chitturi:
Tighter upper bound for sorting permutations with prefix transpositions. Theor. Comput. Sci. 602: 22-31 (2015) - 2013
- [j7]Bhadrachalam Chitturi:
Upper Bounds for Sorting Permutations with a Transposition Tree. Discret. Math. Algorithms Appl. 5(1) (2013) - [j6]Bhadrachalam Chitturi:
Erratum: "Upper Bounds for Sorting Permutations with a Transposition Tree". Discret. Math. Algorithms Appl. 5(3) (2013) - 2012
- [j5]Bong-Hyun Kim, Bhadrachalam Chitturi, Nick V. Grishin:
Self consistency grouping: a stringent clustering method. BMC Bioinform. 13(S-13): S3 (2012) - [j4]Bhadrachalam Chitturi, Ivan Hal Sudborough:
Bounding prefix transposition distance for strings and permutations. Theor. Comput. Sci. 421: 15-24 (2012) - [c6]Bingqing Xie, Gady Agam, Dinanath Sulakhe, Natalia Maltsev, Bhadrachalam Chitturi, T. Conrad Gilliam:
Prediction of candidate genes for neuropsychiatric disorders using feature-based enrichment. BCB 2012: 564-566 - 2011
- [j3]Bhadrachalam Chitturi:
A Note on Complexity of Genetic mutations. Discret. Math. Algorithms Appl. 3(3): 269-286 (2011) - 2010
- [c5]Bhadrachalam Chitturi:
On Complexity of Transforming Strings. BIOCOMP 2010: 584-590 - [c4]Bhadrachalam Chitturi, Ivan Hal Sudborough:
Prefix Reversals on Strings. BIOCOMP 2010: 591-598
2000 – 2009
- 2009
- [j2]Shuoyong Shi, Bhadrachalam Chitturi, Nick V. Grishin:
ProSMoS server: a pattern-based search using interaction matrix representation of protein structures. Nucleic Acids Res. 37(Web-Server-Issue): 526-531 (2009) - [j1]Bhadrachalam Chitturi, William Fahle, Z. Meng, Linda Morales, Charles O. Shields Jr., Ivan Hal Sudborough, Walter Voit:
An (18/11)n upper bound for sorting by prefix reversals. Theor. Comput. Sci. 410(36): 3372-3390 (2009) - [c3]Xuerong Feng, Bhadrachalam Chitturi, Chunlei Liu:
Sorting Circular Permutations by Bounded Transpositions. BIOCOMP 2009: 562-566 - 2008
- [c2]Bhadrachalam Chitturi, Ivan Hal Sudborough, Walter Voit, Xuerong Feng:
Adjacent Swaps on Strings. COCOON 2008: 299-308 - [c1]Bhadrachalam Chitturi, Ivan Hal Sudborough:
Bounding Prefix Transposition Distance for Strings and Permutations. HICSS 2008: 468
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
