Balanyi Z, Ferenc R.  2003.  Mining Design Patterns from C++ Source Code. Proceedings of the International Conference on Software Maintenance.

Vidács L, Beszédes Á.  2003.  Opening Up The C/C++ Preprocessor Black Box. Proceedings of the Eight Symposium on Programming Languages and Software Tools (SPLST’03). :45-57.

Beszédes Á, Ferenc R, Gyimóthy T, Dolenc A, Karsisto K.  2003.  Survey of Code-size Reduction Methods. ACM Comput. Surv.. 35:223–267.

Ferenc R., Beszédes A., Tarkiainen M, Gyimóthy T..  2002.  Columbus - Reverse engineering tool and schema for C++. Conference on Software Maintenance. :172–181.

Ferenc R., Beszedes A..  2002.  Data exchange with the columbus schema for c++. Proceedings of the Sixth European Conference on Software Maintenance and Reengineering. :59-66.

Kocsor A, Dombi J, Bálint I.  2002.  Inequality-Based Approximation of Matrix Eigenvectors. International Journal of Applied Mathematics and Computer Science. 12:533-538.

Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.

Ferenc R, Magyar F, Beszédes Á, Kiss Á, Tarkiainen M.  2001.  Columbus – Tool for Reverse Engineering Large Object Oriented Software Systems. Proceedings of the 7th Symposium on Programming Languages and Software Tools (SPLST 2001). :16–27.

Blázsik Z, Keserű K, Kovács Z.  2001.  Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem. Optimization Theory: Recent Developments from Mátraháza. :19–31.

Kocsor A, Dombi J, Bálint I.  2001.  An Optimization Based Algorithm for Determining Eigenpairs of Large Real Matrices. ANNALES UNIVERSITATIS SCIENTIARUM BUDAPESTINENSIS DE ROLANDO EÖTVÖS NOMINATAE SECTIO COMPUTATORICA. 20:237-253.

Guest E., Berry E., Baldock R.A, Fidrich M., Smith M.A.  2001.  Robust point correspondence applied to two- and three-dimensional image registration. IEEE Transactions on Pattern Analysis and Machine Intelligence. 23:165-179.

Guest E., Berry E., Baldock R.A, Fidrich M., Smith M.A.  2001.  Robust point correspondence applied to two- and three-dimensional image registration. IEEE Transactions on Pattern Analysis and Machine Intelligence. 23:165-179.

Bálint I, Kocsor A, Cserpán I, Fodor K.  2000.  Full Matching and Isomorphism of Nucleotide Chains. INDIAN JOURNAL of PURE AND APPLIED MATHEMATICS. 31:243-263.

Gyimóthy T, Beszédes Á, Forgács I.  1999.  An Efficient Relevant Slicing Method for Debugging. Software Engineering –- ESEC/FSE '99. :303–321.

Holló C., Blázsik Z., Imreh C., Kovács Z..  1999.  On a Merging Reduction of the Process Network Synthesis Problem. Acta Cybern.. 14:251–261.

Guest E, Kelly S, Berry E, Fidrich M.  1999.  Robust Surface Matching for Registration. 2nd International Conference on 3D Digital Imaging and Modeling (3DIM '99), 4-8 October 1999, Ottawa, Canada. :169–179.

Blázsik Z., Holló C., Imreh B..  1998.  On Decision-mappings Related to Process Network Synthesis Problem. Acta Cybern.. 13:319–328.

Kocsor A, Dombi J, Bálint I.  1998.  How to solve matrix-eigenvalue problems by optimizations of various functional inequalities? IMACS/GAMM International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN-98), Volume of extended abstract.

Kocsor A, Tóth L, Bálint I.  1998.  On the Optimal Parameters of a Sinusoidal Representation of Signals. Conference of PhD students on Computer Sciences, Volume of Extended Abstracts. :61-63.

Quatrehomme G, Cotin S, Subsol G, Delingette H, Garidel Y, Grévin G, Fidrich M, Bailet P, Ollier A.  1997.  A Fully Three-Dimensional Method for Facial Reconstruction Based on Deformable Models. Journal of Forensic Sciences. 42:649-652.

Blázsik Z, Imreh B.  1996.  A Note on Connection Between PNS and Set Covering Problems. Acta Cybern.. 12:309–312.

Bunke H, Csirik J.  1995.  An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. Inf. Process. Lett.. 54:93–96.

Bunke H, Csirik J.  1995.  Parametric string edit distance and its application to pattern recognition. IEEE Trans. Systems, Man, and Cybernetics. 25:202–206.

Bunke H, Csirik J.  1993.  An algorithm for matching run-length coded strings. Computing. 50:297–314.

Blázsik Z, Hujter M, Pluhár A, Tuza Z..  1993.  Graphs with no induced C4 and 2K2. Discrete Mathematics. 115:51–55.