Bogdán Zaválnij

Available identifiers

Publication	Date of Publication	Type
Numerical experiments with LP formulations of the maximum clique problem	2022-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q5165142	2021-11-15	Paper
https://portal.mardi4nfdi.de/entity/Q5155414	2021-10-06	Paper
Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem	2021-06-29	Paper
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations	2021-01-27	Paper
Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method	2020-08-03	Paper
Reducing hypergraph coloring to clique search	2019-06-20	Paper
Decomposing clique search problems into smaller instances based on node and edge colorings	2018-04-20	Paper
Reducing graph coloring to clique search	2016-10-12	Paper
Edge coloring of graphs, uses, limitation, complexity	2016-07-06	Paper
Coloring the edges of a directed graph	2015-07-09	Paper
Coloring the nodes of a directed graph	2014-08-19	Paper
Greedy algorithms for triangle free coloring	2013-01-02	Paper

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