Bogdán Zaválnij

15 papers A 1Misc 2Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms.
CoRR
Raffaele Marino, Lorenzo Buffoni, Bogdán Zaválnij
2024 J jnl
Exploratory Data Analysis and Searching Cliques in Graphs.
Algorithms
Andras Hubai, Sándor Szabó, Bogdán Zaválnij
2022 J jnl
Graph Coloring via Clique Search with Symmetry Breaking.
Symmetry
Sándor Szabó, Bogdán Zaválnij
2022 J jnl
Numerical experiments with LP formulations of the maximum clique problem.
Central Eur. J. Oper. Res.
Dóra Kardos, Patrik Patassy, Sándor Szabó, Bogdán Zaválnij
2021 A conf
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations.
ALENEX
Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij
2021 J jnl
Estimating clique size via discarding subgraphs.
Informatica (Slovenia)
Bogdán Zaválnij, Sándor Szabó
2020 J jnl
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations.
CoRR
Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij
2020 — —
The k-Clique Problem Usage, Modeling Expressivity, Serial and Massively Parallel Algorithms
Bogdán Zaválnij
2019 — ch.
Applications for ultrascale systems.
Ultrascale Computing Systems
Svetozar Margenov, Thomas Rauber, Emanouil I. Atanassov, Francisco Almeida, Vicente Blanco Pérez, Raimondas Ciegis, Alberto Cabrera Pérez, Neki Frasheri, Stanislav Harizanov, Rima Kriauziene, Gudula Rünger, Pablo San Segundo, Adimas Starikovicius, Sándor Szabó, Bogdán Zaválnij
2019 J jnl
Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms.
Informatica (Slovenia)
Sándor Szabó, Bogdán Zaválnij
2019 J jnl
Reducing hypergraph coloring to clique search.
Discret. Appl. Math.
Sándor Szabó, Bogdán Zaválnij
2018 Misc conf
A Different Approach to Maximum Clique Search.
SYNASC
Sándor Szabó, Bogdán Zaválnij
2018 J jnl
Decomposing clique search problems into smaller instances based on node and edge colorings.
Discret. Appl. Math.
Sándor Szabó, Bogdán Zaválnij
2015 Misc conf
Adaptations of the k-Means Algorithm to Community Detection in Parallel Environments.
SYNASC
András Bóta, Miklós Krész, Bogdán Zaválnij
2015 — conf
Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method.
LSSC
Bogdán Zaválnij