Kádár I, Hegedüs P, Ferenc R, Gyimóthy T.  2016.  Assessment of the Code Refactoring Dataset Regarding the Maintainability of Methods. Computational Science and Its Applications – ICCSA 2016: 16th International Conference, Beijing, China, July 4-7, 2016, Proceedings, Part IV. :610–624.

Chrobak M, Csirik J, Imreh C, Noga J, Sgall J, Woeginger GJ.  2001.  The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP. 2076:862–874.

Csirik J, Imreh C, Noga J, Seiden SS, Woeginger GJ.  2001.  Buying a Constant Competitive Ratio for Paging. Algorithms –- ESA 2001. :98–108.

Csirik J, Woeginger GJ.  2000.  Resource Augmentation for Online Bounded Space Bin Packing. :296-304.

Csirik J, Johnson DS, Kenyon C, Orlin JB, Shor PW, Weber RR.  2000.  On the Sum-of-squares Algorithm for Bin Packing. Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing. :208–217.

Horváth T., Alexin Z., Gyimóthy T, Wrobel S..  1999.  Application of Different Learning Methods to Hungarian Part-of-Speech Tagging. Proceedings of the 9th International Workshop on Inductive Logic Programming. :128–139.

Alon N., Azar Y., Csirik J., Epstein L., Sevastianov S.V, Vestjens A.PA, Woeginger G.J.  1998.  On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica. 21:104–118.

Csirik J, Woeginger GJ.  1997.  Shelf Algorithms for On-Line Strip Packing. Inf. Process. Lett.. 63:171–175.

Paakki J., Gyimóthy T, Horváth T..  1994.  Effective Algorithmic Debugging for Inductive Logic Programming. GMD-Studien. 237:175-194.

Csirik J, Kellerer H, Woeginger GJ.  1992.  The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett.. 11:281–287.