| Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations∗ A Gellner, S Lamm, C Schulz, D Strash, B Zaválnij 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments …, 2021 | 13 | 2021 |
| A different approach to maximum clique search S Szabó, B Zavalnij 2018 20th International Symposium on Symbolic and Numeric Algorithms for …, 2018 | 12 | 2018 |
| Reducing graph coloring to clique search BANZAV ALNIJ Asia Pacific Journal of Mathematics 3 (1), 64-85, 2016 | 12 | 2016 |
| Greedy algorithms for triangle free coloring S Szabó, B Zaválnij, S Arumugam AKCE International Journal of Graphs and Combinatorics 9 (2), 169-186, 2012 | 11 | 2012 |
| Benchmark problems for exhaustive exact maximum clique search algorithms S Szabó, B Zaválnij Informatica 43 (2), 2019 | 10 | 2019 |
| Adaptations of the k-means algorithm to community detection in parallel environments A Bóta, M Krész, B Zaválnij 2015 17th International Symposium on Symbolic and Numeric Algorithms for …, 2015 | 10 | 2015 |
| Speeding up parallel combinatorial optimization algorithms with Las Vegas method B Zavalnij Large-Scale Scientific Computing: 10th International Conference, LSSC 2015 …, 2015 | 7 | 2015 |
| Reducing hypergraph coloring to clique search S Szabo, B Zavalnij Discrete Applied Mathematics 264, 196-207, 2019 | 6 | 2019 |
| Decomposing clique search problems into smaller instances based on node and edge colorings S Szabó, B Zavalnij Discrete Applied Mathematics 242, 118-129, 2018 | 6 | 2018 |
| Clique search in graphs of special class and job shop scheduling S Szabó, B Zaválnij Mathematics 10 (5), 697, 2022 | 5 | 2022 |
| An improved maximum common induced subgraph solver M Depolli, S Szabó, B Zaválnij MATCH Commun. Math. Comput. Chem 84, 7-28, 2020 | 4 | 2020 |
| Coloring the edges of a directed graph S Szabó, B Zavalnij Indian Journal of Pure and Applied Mathematics 45, 239-260, 2014 | 4 | 2014 |
| Numerical experiments with LP formulations of the maximum clique problem D Kardos, P Patassy, S Szabó, B Zaválnij Central European Journal of Operations Research, 1-15, 2022 | 3 | 2022 |
| Coloring the nodes of a directed graph S Szabó, B Zaválnij Acta Universitatis Sapientiae, Informatica 6 (1), 117-131, 2014 | 3 | 2014 |
| Three versions of clique search parallelization B Zavalnij J. Comp. Sci. Inf. Technology 2 (2), 9-20, 2014 | 3 | 2014 |
| Graph Coloring via Clique Search with Symmetry Breaking S Szabó, B Zaválnij Symmetry 14 (8), 1574, 2022 | 2 | 2022 |
| Edge coloring of graphs, uses, limitation, complexity S Szabó, B Zaválnij Acta Universitatis Sapientiae, Informatica 8 (1), 63-81, 2016 | 2 | 2016 |
| Enhanced molecular docking: Novel algorithm for identifying highest weight k-cliques in weighted general and protein-ligand graphs K Rozman, A Ghysels, B Zavalnij, T Kunej, U Bren, D Janežič, J Konc Journal of Molecular Structure 1304, 137639, 2024 | 1 | 2024 |
| Some zero-one linear programming reformulations for the maximum clique problem Á Beke, S Szabó, B Zavalnij Mathematica Pannonica 27 (1), 32-47, 2021 | 1 | 2021 |
| The k-Clique Problem Usage, Modeling Expressivity, Serial and Massively Parallel Algorithms B Zaválnij PQDT-Global, 2020 | 1 | 2020 |
