We stand with Ukraine  

Bogdán Zaválnij

Orcid: 0000-0003-3060-0296

Affiliations:
  • Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics, Budapest, Hungary
  • University of Pecs, Institute of Mathematics and Informatics, Hungary


According to our database1, Bogdán Zaválnij authored at least 14 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exploratory Data Analysis and Searching Cliques in Graphs.
[BibTeX]
[DOI]
Andras Hubai
,
Sándor Szabó
,
Bogdán Zaválnij
Algorithms, March, 2024

A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms.
[BibTeX]
[DOI]
Raffaele Marino
,
Lorenzo Buffoni
,
Bogdán Zaválnij
CoRR, 2024

2022
Graph Coloring via Clique Search with Symmetry Breaking.
[BibTeX]
[DOI]
Sándor Szabó
,
Bogdán Zaválnij
Symmetry, 2022

Numerical experiments with LP formulations of the maximum clique problem.
[BibTeX]
[DOI]
Dóra Kardos
,
Patrik Patassy
,
Sándor Szabó
,
Bogdán Zaválnij
Central Eur. J. Oper. Res., 2022

2021
Estimating clique size via discarding subgraphs.
[BibTeX]
[DOI]
Bogdán Zaválnij
,
Sándor Szabó
Informatica (Slovenia), 2021

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations.
[BibTeX]
[DOI]
Alexander Gellner
,
Sebastian Lamm
,
Christian Schulz
,
Darren Strash
,
Bogdán Zaválnij
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020
The k-Clique Problem Usage, Modeling Expressivity, Serial and Massively Parallel Algorithms
[BibTeX]
[DOI]
Bogdán Zaválnij
PhD thesis, 2020

2019
Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms.
[BibTeX]
[DOI]
Sándor Szabó
,
Bogdán Zaválnij
Informatica (Slovenia), 2019

Reducing hypergraph coloring to clique search.
[BibTeX]
[DOI]
Sándor Szabó
,
Bogdán Zaválnij
Discret. Appl. Math., 2019

Applications for ultrascale systems.
[BibTeX]
[DOI]
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
Proceedings of the Ultrascale Computing Systems, 2019

2018
Decomposing clique search problems into smaller instances based on node and edge colorings.
[BibTeX]
[DOI]
Sándor Szabó
,
Bogdán Zaválnij
Discret. Appl. Math., 2018

A Different Approach to Maximum Clique Search.
[BibTeX]
[DOI]
Sándor Szabó
,
Bogdán Zaválnij
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

2015
Adaptations of the k-Means Algorithm to Community Detection in Parallel Environments.
[BibTeX]
[DOI]
András Bóta
,
Miklós Krész
,
Bogdán Zaválnij
Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method.
[BibTeX]
[DOI]
Bogdán Zaválnij
Proceedings of the Large-Scale Scientific Computing - 10th International Conference, 2015


  Loading...