Bogdan Zavalnij

1. BÓTA, András, KRÉSZ, Miklós Ferenz, ZAVALNIJ, Bogdan. Adaptations of the k-Means Algorithm to Community Detection in Parallel Environments. In: KOVÁCS, Laura (ed.). SYNASC 2015 : 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing : proceedings : 21-24 September 2015, Timisoara, Romania. Los Alamitos (Calif.): IEEE Computer Society, Conference Publishing Services, [2015]. Str. 299-302. http://ieeexplore.ieee.org/document/7426098/, DOI: 10.1109/SYNASC.2015.54. [COBISS.SI-ID 1539935172]

2. DEPOLLI, Matjaž, KONC, Janez, SZABÓ, Sándor, ZAVALNIJ, Bogdan. Usage of hereditary colorings of product graphs in clique search programs. In: BRODNIK, Andrej (ed.). Middle-European Conference on Applied Theoretical Computer Science (MATCOS 2016) : zbornik 19. mednarodne multikonference Informacijska družba - IS 2016, 12.-13. oktober 2016, [Ljubljana, Slovenija] = proceedings of the 19th International Multiconference Information Society - IS 2016, 12.-13 October 2016, Ljubljana, Slovenia : zvezek H = volume H. Ljubljana: Institut Jožef Stefan, 2016. Str. 40-43. ISBN 978-961-264-104-7. http://library.ijs.si/Stacks/Proceedings/InformationSociety/2016/IS2016_Volume_H%20-%20MATCOS.pdf. [COBISS.SI-ID 29895975]

3. SZABO, Sandor, ZAVALNIJ, Bogdan. Benchmark problems for exhaustive exact maximum clique search algorithms. Informatica : an international journal of computing and informatics. [Tiskana izd.]. June 2019, vol. 43, no. 2, str. 177-186. ISSN 0350-5596. Digitalna knjižnica Slovenije - dLib.si, DOI: 10.31449/inf.v43i2.2678. [COBISS.SI-ID 32933927]

4. DEPOLLI, Matjaž, SZABO, Sandor, ZAVALNIJ, Bogdan. An improved maximum common induced subgraph solver. Match : communications in mathematical and in computer chemistry. 2020, vol. 84, str. 7-28. ISSN 0340-6253. [COBISS.SI-ID 15824131]

5. ZAVALNIJ, Bogdan. The k-clique problem usage, modeling expressivity, serial and massively parallel algorithms : doctoral dissertation. Szeged: [A. Zaválnij], 2020. 139 str., ilustr. https://doktori.bibl.u-szeged.hu/id/eprint/10444/7/en-tezisfuzet-A4.pdf. [COBISS.SI-ID 145866243]

6. SZABO, Sandor, ZAVALNIJ, Bogdan. Estimating clique size via discarding subgraphs. Informatica : an international journal of computing and informatics. [Tiskana izd.]. Jun. 2021, vol. 45, no. 2, str. 197-204. ISSN 0350-5596. Digitalna knjižnica Slovenije - dLib.si, DOI: 10.31449/inf.v45i2.3107. [COBISS.SI-ID 79896067]

7. DEPOLLI, Matjaž, ZAVALNIJ, Bogdan. Eliminating vertex coloring in clique search. In: MATCOS-22 : Middle-European Conference on Applied Theoretical Computer Science, 13-14 October 2022, Koper, Slovenia. [S. l.: s. n.], 2022. Str. 8. https://matcos.iam.upr.si/en/resources/files/published-material/matcos-22-booklet.pdf. [COBISS.SI-ID 136099843]

8. ROZMAN, Kati, GHYSELS, An, ZAVALNIJ, Bogdan, KUNEJ, Tanja, BREN, Urban, JANEŽIČ, Dušanka, KONC, Janez. Enhanced molecular docking: novel algorithm for identifying highest weight k-cliques in weighted general and protein-ligand graphs. Journal of molecular structure. 15. May 2024, vol. 1304, [article no.] 137639, str. 1-10, ilustr. ISSN 1872-8014. https://www.sciencedirect.com/science/article/pii/S0022286024001625, DiRROS - Digitalni repozitorij raziskovalnih organizacij Slovenije, Repozitorij Univerze v Ljubljani – RUL, DOI: 10.1016/j.molstruc.2024.137639. [COBISS.SI-ID 182995715]