Bogdán Zaválnij

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Clique number estimate based on coloring of the nodes Serdica Mathematical Journal	2025-04-01	Paper
Numerical experiments with LP formulations of the maximum clique problem CEJOR. Central European Journal of Operations Research	2022-12-09	Paper
An improved maximum common induced subgraph solver	2021-11-15	Paper
scientific article; zbMATH DE number 7407404 (Why is no real title available?)	2021-10-06	Paper
Some zero-one linear programming reformulations for the maximum clique problem Mathematica Pannonica	2021-06-29	Paper
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX)	2021-01-27	Paper
Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method Large-Scale Scientific Computing	2020-08-03	Paper
Reducing hypergraph coloring to clique search Discrete Applied Mathematics	2019-06-20	Paper
Decomposing clique search problems into smaller instances based on node and edge colorings Discrete Applied Mathematics	2018-04-20	Paper
Reducing graph coloring to clique search Asia Pacific Journal of Mathematics	2016-10-12	Paper
Edge coloring of graphs, uses, limitation, complexity Acta Universitatis Sapientiae. Informatica	2016-07-06	Paper
Coloring the edges of a directed graph Indian Journal of Pure & Applied Mathematics	2015-07-09	Paper
Coloring the nodes of a directed graph Acta Universitatis Sapientiae. Informatica	2014-08-19	Paper
Greedy algorithms for triangle free coloring AKCE International Journal of Graphs and Combinatorics	2013-01-02	Paper

Research outcomes over time

This page was built for person: Bogdán Zaválnij