Author of the publication

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations.

, , , , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations., , , , and . CoRR, (2020)The k-Clique Problem Usage, Modeling Expressivity, Serial and Massively Parallel Algorithms. University of Szeged, Hungary, (2020)Reducing hypergraph coloring to clique search., and . Discret. Appl. Math., (2019)Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations., , , , and . ALENEX, page 128-142. SIAM, (2021)Graph Coloring via Clique Search with Symmetry Breaking., and . Symmetry, 14 (8): 1574 (2022)A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms., , and . CoRR, (2024)Decomposing clique search problems into smaller instances based on node and edge colorings., and . Discret. Appl. Math., (2018)Applications for ultrascale systems., , , , , , , , , and 5 other author(s). Ultrascale Computing Systems, IET, (2019)Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms., and . Informatica (Slovenia), (2019)A Different Approach to Maximum Clique Search., and . SYNASC, page 310-316. IEEE, (2018)