| 2026 | HAIS | An Efficient Rainbow Based Memetic Algorithm to the Linear Fixed Cost Transportation Problem. | Rares Chiuzbaian, Adrian Petrovan, Petrica C. Pop, Cosmin Sabo |
| 2025 | HAIS | An Adaptive Memetic Algorithm for Solving the Multiple Knapsack Assignment Problem. | Adrian Petrovan, Petrica C. Pop, Cosmin Sabo |
| 2024 | HAIS | Diversity Population Metrics in Diploid and Haploid Genetic Algorithm Variants. | Adrian Petrovan, Oliviu Matei, Petrica C. Pop, Cosmin Sabo |
| 2024 | HAIS | Solving the Clustered Minimum Routing Tree Problem Using Prfer-Coding Based Hybrid Genetic Algorithms. | Cosmin Sabo, Bogdan Teglas, Petrica C. Pop, Adrian Petrovan |
| 2024 | PPSN | On the Design of Diploid Memetic Algorithms for Solving the Multidimensional Multi-way Number Partitioning Problem. | Adrian Petrovan, Petrica C. Pop, Cosmin Sabo |
| 2023 | GECCO | A Diploid Genetic Algorithm for Solving the Multidimensional Multi-way Number Partitioning Problem. | Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Oliviu Matei |
| 2022 | HAIS | A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prfer Code. | Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina |
| 2020 | SOFSEM | A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes. | Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo |
| 2019 | HAIS | An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem. | Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo |
| 2017 | HAIS | A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem. | Petrica C. Pop, Oliviu Matei, Cosmin Sabo |
| 2016 | ISDA | An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems. | Cosmin Sabo, Petrica C. Pop, Honoriu Valean, Daniela Danciulescu |