Publications
GAS, A Concept on Modeling Species in Genetic Algorithms. Artif. Intell.. 99:1–19.
.
1998. A Fully Three-Dimensional Method for Facial Reconstruction Based on Deformable Models. Journal of Forensic Sciences. 42:649-652.
.
1997. On Frequent Sets of Boolean Matrices. Ann. Math. Artif. Intell.. 24:193–209.
.
1998. A feature selection-based speaker clustering method for paralinguistic tasks. Pattern Analysis and Applications. 21:193–204.
.
2018. Feature Analysis using Information Retrieval, Community Detection and Structural Analysis Methods in Product Line Adoption. Journal of Systems and Software. 155:70-90.
.
2019. The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett.. 11:281–287.
.
1992. Empirical Study on Refactoring Large-scale Industrial Systems and Its Effects on Maintainability. Journal of Systems and Software. 129:107–126.
.
2017. Empirical evaluation of software maintainability based on a manually validated refactoring dataset. Information and Software Technology. 95:313-327.
.
2018. Efficient algorithm to compute Markov transitional probabilities for a desired PageRank. EPJ Data Science. 9:23.
.
2020. Dynamic Computation of Generalised Median Strings. Pattern Anal. Appl.. 6:185–193.
.
2003. Dynamic computation of generalised median strings. Pattern Analysis & Applications. 6:185–193.
.
2003. DNN-based Feature Extraction for Conflict Intensity Estimation from Speech. IEEE Signal Processing Letters. 24:1837–1841.
.
2017. Differences between a static and a dynamic test-to-code traceability recovery method. SOFTWARE QUALITY JOURNAL. 27:797-822.
.
2019. Deep-water framework: The Swiss army knife of humans working with machine learning models. SoftwareX. 12:100551.
.
2020. On Decision-mappings Related to Process Network Synthesis Problem. Acta Cybern.. 13:319–328.
.
1998. The Debug slicing of logic programs. Acta Cybernetica. 15:257–278.
.
2001. Connection Between Version Control Operations and Quality Change of the Source Code. {Acta Cybernetica}. 21:585–607.
.
2014. On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci.. 54:199–212.
.
1997. On the Complexity of Planar Boolean Circuits. Computational Complexity. 5:24–42.
.
1995. A Comparative Study of Several Feature Space Transformation and Learning Methods for Phoneme Classification. International Journal of Speech Technology. 2:263-276.
.
2000. The Communication Complexity of Interval Orders. Discrete Applied Mathematics. 40:19–28.
.
1992. Combining preprocessor slicing with C/C++ language slicing. Science of Computer Programming. 74:399-413.
.
2009. Code Coverage Differences of Java Bytecode and Source Code Instrumentation Tools. Software Quality Journal.
.
2017. Code coverage differences of Java bytecode and source code instrumentation tools. SOFTWARE QUALITY JOURNAL. 27:79-123.
.
2019. Calibrating AdaBoost for Phoneme Classification. Soft Computing. 23:115–128.
.
2019.