Publication date
June 2021
DOIAbstract
The description of the cluster editing solver 'ADE-solver' submitted to the PACE 2021 competition
The description of the cluster editing solver 'ADE-solver' submitted to the PACE 2021 competition
This article briefly describes the most important algorithms and techniques used in the cluster edit...
The Parameterized Algorithms and Computational Experiments challenge (PACE) 2021 was devoted to engi...
This is our submission to the Vertex Cover contest of the PACE 2019 Track A Exact Vertex Cover compe...
International audienceThis document describes our heuristic Cluster Editing solver, µSolver, which g...
The C++ version of our solution for the PACE 2021 contest (Cluster Editing) for the exact and heuris...
International audienceLe challenge PACE (https://pacechallenge.org/about/) est un challenge annuel o...
International audience2012 ACM Subject Classification Theory of computation → Parameterized complexi...
PACE Challenge 2021 Solver Description, from the Random Sampling group of the UNSW GraphAbility VIP ...
A self-contained vertex cover solver, developed for the PACE 2019 challenge, track A
This document describes our heuristic Cluster Editing solver, ?Solver, which got the third place in ...
Branch and reduce solver branching on possible merges within small distance. Submission for PACE 202...
This repository contains the exact and heuristic solver Zygosity. It was submited in the exact and t...
This is an approximate twin-width solver designed for the Heuristic Track of the 2023 PACE challenge
The cluster editing problem is to transform an input graph into a cluster graph by performing a mini...
Instances for the PACE Challenge 2019 on the following tracks: 2a. Hypertree Width Exact and 2b. ...
This article briefly describes the most important algorithms and techniques used in the cluster edit...
The Parameterized Algorithms and Computational Experiments challenge (PACE) 2021 was devoted to engi...
This is our submission to the Vertex Cover contest of the PACE 2019 Track A Exact Vertex Cover compe...
International audienceThis document describes our heuristic Cluster Editing solver, µSolver, which g...
The C++ version of our solution for the PACE 2021 contest (Cluster Editing) for the exact and heuris...
International audienceLe challenge PACE (https://pacechallenge.org/about/) est un challenge annuel o...
International audience2012 ACM Subject Classification Theory of computation → Parameterized complexi...
PACE Challenge 2021 Solver Description, from the Random Sampling group of the UNSW GraphAbility VIP ...
A self-contained vertex cover solver, developed for the PACE 2019 challenge, track A
This document describes our heuristic Cluster Editing solver, ?Solver, which got the third place in ...
Branch and reduce solver branching on possible merges within small distance. Submission for PACE 202...
This repository contains the exact and heuristic solver Zygosity. It was submited in the exact and t...
This is an approximate twin-width solver designed for the Heuristic Track of the 2023 PACE challenge
The cluster editing problem is to transform an input graph into a cluster graph by performing a mini...
Instances for the PACE Challenge 2019 on the following tracks: 2a. Hypertree Width Exact and 2b. ...
This article briefly describes the most important algorithms and techniques used in the cluster edit...
The Parameterized Algorithms and Computational Experiments challenge (PACE) 2021 was devoted to engi...
This is our submission to the Vertex Cover contest of the PACE 2019 Track A Exact Vertex Cover compe...
Add to ORKG