Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBogdán Zaválnij
Person information
- affiliation: Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics, Budapest, Hungary
- affiliation: University of Pecs, Institute of Mathematics and Informatics, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Andras Hubai
, Sándor Szabó, Bogdán Zaválnij:
Exploratory Data Analysis and Searching Cliques in Graphs. Algorithms 17(3): 112 (2024)- [i2]Raffaele Marino, Lorenzo Buffoni, Bogdán Zaválnij:
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms. CoRR abs/2403.09742 (2024) - 2022
- [j6]Dóra Kardos, Patrik Patassy, Sándor Szabó, Bogdán Zaválnij:
Numerical experiments with LP formulations of the maximum clique problem. Central Eur. J. Oper. Res. 30(4): 1353-1367 (2022) - [j5]Sándor Szabó, Bogdán Zaválnij:
Graph Coloring via Clique Search with Symmetry Breaking. Symmetry 14(8): 1574 (2022) - 2021
- [j4]Bogdán Zaválnij, Sándor Szabó:
Estimating clique size via discarding subgraphs. Informatica (Slovenia) 45(2) (2021) - [c4]Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij:
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. ALENEX 2021: 128-142 - 2020
- [b1]Bogdán Zaválnij:
The k-Clique Problem Usage, Modeling Expressivity, Serial and Massively Parallel Algorithms. University of Szeged, Hungary, 2020 - [i1]Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij:
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. CoRR abs/2008.05180 (2020)
2010 – 2019
- 2019
- [j3]Sándor Szabó, Bogdán Zaválnij:
Reducing hypergraph coloring to clique search. Discret. Appl. Math. 264: 196-207 (2019) - [j2]Sándor Szabó, Bogdán Zaválnij:
Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms. Informatica (Slovenia) 43(2) (2019) - [p1]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:
Applications for ultrascale systems. Ultrascale Computing Systems 2019: 189-244 - 2018
- [j1]Sándor Szabó, Bogdán Zaválnij:
Decomposing clique search problems into smaller instances based on node and edge colorings. Discret. Appl. Math. 242: 118-129 (2018) - [c3]Sándor Szabó, Bogdán Zaválnij:
A Different Approach to Maximum Clique Search. SYNASC 2018: 310-316 - 2015
- [c2]Bogdán Zaválnij:
Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method. LSSC 2015: 258-266 - [c1]András Bóta, Miklós Krész, Bogdán Zaválnij:
Adaptations of the k-Means Algorithm to Community Detection in Parallel Environments. SYNASC 2015: 299-302
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 23:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
