Publications
Connection Between Version Control Operations and Quality Change of the Source Code. {Acta Cybernetica}. 21:585–607.
.
2014. Code Ownership: Impact on Maintainability. Proceedings of the International Conference on Computational Science and Its Applications – ICCSA 2015. 9159:3-19.
.
2015. Cumulative Code Churn: Impact on Maintainability. Proceedings of the 15th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM). :141-150.
.
2015. The Communication Complexity of Interval Orders. Discrete Applied Mathematics. 40:19–28.
.
1992. THALES: a software package for plane geometry constructions with a natural language interface. Proceedings of the 13th conference on Computational linguistics - Volume 1. :44–46.
.
1990. A critical note on experimental research methodology in EC. Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600). 1:582-587vol.1.
.
2002. Service Layer for IDE Integration of C/C++ Preprocessor Related Analysis. Computational Science and Its Applications - ICCSA 2014, Lecture Notes in Computer Science. 8583:402-417.
.
2014. Robust decentralized mean estimation with limited communication. Lecture Notes in Computer Science. 11014 :447–461.
.
2018. Source Code Level Word Embeddings in Aiding Semantic Test-to-Code Traceability. Proceedings of the 10th International Workshop on Software and Systems Traceability, (SST 2019 @ ICSE). :29-36.
.
2019. Evaluation of Textual Similarity Techniques in Code Level Traceability. Proceedings of the 19th International Conference on Computational Science and Its Applications (ICCSA 2019). :529-543.
.
2019. Utilizing Source Code Embeddings to Identify Correct Patches. Proceedings of the Second International Workshop on Intelligent Bug Fixing (IBF 2020). :18-25.
.
2020. The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett.. 11:281–287.
.
1992. Two-Dimensional Rectangle Packing: On-Line Methods and Results. Discrete Applied Mathematics. 45:197–204.
.
1993. Buying a Constant Competitive Ratio for Paging. Algorithms –- ESA 2001. :98–108.
.
2001. On the Sum-of-squares Algorithm for Bin Packing. Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing. :208–217.
.
2000. Better approximation algorithms for bin covering. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :557–566.
.
2001. Shelf Algorithms for On-Line Strip Packing. Inf. Process. Lett.. 63:171–175.
.
1997. .
2000. An on-line algorithm for multidimensional bin packing. Oper. Res. Lett.. 13:149–158.
.
1993. Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica. 31:115–138.
.
2001. The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm. J. Algorithms. 15:1–28.
.
1993. DNN-Based Ultrasound-to-Speech Conversion for a Silent Speech Interface. Proceedings of Interspeech. :3672–3676.
.
2017. Ultrasound-based Silent Speech Interface Built on a Continuous Vocoder. Proceedings of Interspeech. :894–898.
.
2019. The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP. 2076:862–874.
.
2001. Edit distance of run-length coded strings. SAC. :137–143.
.
1992.