Publication date
June 2023
DOIAbstract
Source code of the solver for PACE 2023 Twin-width (https://pacechallenge.org/2023/)
Source code of the solver for PACE 2023 Twin-width (https://pacechallenge.org/2023/)
International audienceThis document describes our heuristic Cluster Editing solver, µSolver, which g...
This document describes our exact Cluster Editing solver, PaSTEC, which got the third place in the 2...
This package contains the source code for the paper Multi-Row Intersection Cuts based on the Infinit...
This repository contains the exact and heuristic solver Zygosity. It was submited in the exact and t...
Branch and reduce solver branching on possible merges within small distance. Submission for PACE 202...
This is an approximate twin-width solver designed for the Heuristic Track of the 2023 PACE challenge
The topic of the PACE (Parameterized Algorithms and Computational Experiments) 2023 challenge (https...
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
PACE Challenge 2021 Solver Description, from the Random Sampling group of the UNSW GraphAbility VIP ...
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
The description of the cluster editing solver 'ADE-solver' submitted to the PACE 2021 competition
A self-contained vertex cover solver, developed for the PACE 2019 challenge, track A
This is our submission to the Vertex Cover contest of the PACE 2019 Track A Exact Vertex Cover compe...
Instances for the PACE Challenge 2019 on the following tracks: 2a. Hypertree Width Exact and 2b. ...
Code associated with analysis of data published in Liu, et al., Nature Communications, 202
International audienceThis document describes our heuristic Cluster Editing solver, µSolver, which g...
This document describes our exact Cluster Editing solver, PaSTEC, which got the third place in the 2...
This package contains the source code for the paper Multi-Row Intersection Cuts based on the Infinit...
This repository contains the exact and heuristic solver Zygosity. It was submited in the exact and t...
Branch and reduce solver branching on possible merges within small distance. Submission for PACE 202...
This is an approximate twin-width solver designed for the Heuristic Track of the 2023 PACE challenge
The topic of the PACE (Parameterized Algorithms and Computational Experiments) 2023 challenge (https...
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
PACE Challenge 2021 Solver Description, from the Random Sampling group of the UNSW GraphAbility VIP ...
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
The description of the cluster editing solver 'ADE-solver' submitted to the PACE 2021 competition
A self-contained vertex cover solver, developed for the PACE 2019 challenge, track A
This is our submission to the Vertex Cover contest of the PACE 2019 Track A Exact Vertex Cover compe...
Instances for the PACE Challenge 2019 on the following tracks: 2a. Hypertree Width Exact and 2b. ...
Code associated with analysis of data published in Liu, et al., Nature Communications, 202
International audienceThis document describes our heuristic Cluster Editing solver, µSolver, which g...
This document describes our exact Cluster Editing solver, PaSTEC, which got the third place in the 2...
This package contains the source code for the paper Multi-Row Intersection Cuts based on the Infinit...
Add to ORKG