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.

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.

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.  1992.  Edit distance of run-length coded strings. SAC. :137–143.

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.

Csapó TGábor, Al-Radhi MSalah, Németh G, Gosztolya G, Grósz T, Tóth L, Markó A.  2019.  Ultrasound-based Silent Speech Interface Built on a Continuous Vocoder. Proceedings of Interspeech. :894–898.

Csapó TGábor, Grósz T, Gosztolya G, Tóth L, Markó A.  2017.  DNN-Based Ultrasound-to-Speech Conversion for a Silent Speech Interface. Proceedings of Interspeech. :3672–3676.

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

Csirik J.  1993.  The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm. J. Algorithms. 15:1–28.

Csirik J, van Vliet A.  1993.  An on-line algorithm for multidimensional bin packing. Oper. Res. Lett.. 13:149–158.

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

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

Csirik J, Frenk J.BG, Labbé M.  1993.  Two-Dimensional Rectangle Packing: On-Line Methods and Results. Discrete Applied Mathematics. 45:197–204.

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, Johnson DS.  2001.  Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica. 31:115–138.

Csirik J., Johnson DS, Kenyon C.  2001.  Better approximation algorithms for bin covering. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :557–566.

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.

Csuvik V, Horváth D, Horváth F, Vidács L.  2020.  Utilizing Source Code Embeddings to Identify Correct Patches. Proceedings of the Second International Workshop on Intelligent Bug Fixing (IBF 2020). :18-25.

Csuvik V, Kicsi A, Vidács L.  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.

Csuvik V, Kicsi A, Vidács L.  2019.  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.

Danner G, Jelasity. M.  2018.  Robust decentralized mean estimation with limited communication. Lecture Notes in Computer Science. 11014 :447–461.

Dévai R, Vidács L, Ferenc R, Gyimóthy T.  2014.  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.

Eiben A.E, Jelasity M..  2002.  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.

Fábricz K., Alexin Z., Gyimóthy T, Horváth T..  1990.  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.