Publications
[2008-45] Rank function on Lagrangian Matroids .Edit
Assessing paternities with inconclusive STR results: the suitability of bi-allelic markers. Forensic Science International: Genetics. 2013;7(1):16-21.Edit
A general method to assess the utility of the X-chromosomal markers in kinship testing. Forensic Science International: Genetics. 2012;6:198-207.Edit
Double power laws, fractals and self-similarity. Applied Mathematical Modelling. 2014;38:4019-4026.Edit
The Karimojong from Uganda: Genetic characterization using an X-STR decaplex system. Forensic Science International: Genetics. 2009;3.Edit
Numerical simulations in two CPG models for bipedal locomotion. J. Vib. Control. 2007;13:1487-1503.Edit
Exciting dynamical behavior in a network of two coupled rings of Chen oscillators. Nonlinear Dynam.. 2014;78:1245-1259.Edit
Resistive switching and activity-dependent modifications in Ni-doped graphene oxide thin films. Applied Physics Letters. 2012;101.Edit
Assessing the potential application of X-chromosomal haploblocks in population genetics and forensic studies. Forensic Science International: Genetics Supplement Series. 2013;4.Edit
Strange Dynamics in a Fractional Derivative of Complex-Order Network of Chaotic Oscillators. International Journal of Bifurcation and Chaos. 2015;25:15550003.Edit
How useful is your X in discerning pedigrees? Forensic Science International: Genetics Supplement Series. 2011;3.Edit
Complex order van der Pol oscillator. Nonlinear Dynam.. 2011;65:247-254.Edit
The role of synaptic transmission in a HIV model with memory. Appl. Math. Comput.. 2017;292:76-95.Edit
[2017-24] Stability of a heteroclinic network and its cycles: a case study from Boussinesq convection .Edit
[2017-36] A pair of rigid surfaces with p_g=q=2 and K^2=8 whose universal cover is not the bidisk .Edit
Finitely generated synchronizing automata. In: Language and Automata Theory and Applications, LATA 2009. Vol LNCS, 5457.; 2009. 6. p. 672-683p. Edit
State complexity for code operators. International Journal of Foundations of Computer Science. 2011;22(7):1669-1681.Edit
State complexity of prefix, suffix, bifix and infix op- erators on regular languages. Vol LNCS, 6224 2010.Edit
Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. In: Computability in Europe, CiE 2011. Vol LNCS, 6735.; 2011. 2. p. 230-238p. Edit
Synchronizing automata with finitely many minimal synchronizing words. Information and Computation. 2011;209(3):568-579.Edit