This repository contains the exact and heuristic solver Zygosity. It was submited in the exact and the heuristic track of the PACE 2023 Challenge on Twin-Width
International audience2012 ACM Subject Classification Theory of computation → Parameterized complexi...
This is the first full release of OptSymQuad. This software uses through-contact optimization (the g...
This is an updated release of OptSymQuad. This software uses through-contact optimization (the gener...
Source code of the solver for PACE 2023 Twin-width (https://pacechallenge.org/2023/)
Branch and reduce solver branching on possible merges within small distance. Submission for PACE 202...
PACE Challenge 2021 Solver Description, from the Random Sampling group of the UNSW GraphAbility VIP ...
The topic of the PACE (Parameterized Algorithms and Computational Experiments) 2023 challenge (https...
Instances for the PACE Challenge 2019 on the following tracks: 2a. Hypertree Width Exact and 2b. ...
International audienceThis document describes our heuristic Cluster Editing solver, µSolver, which g...
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
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
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...
This Zenodo repository contains all 3D coordinates for the all the motions submitted by the particip...
International audience2012 ACM Subject Classification Theory of computation → Parameterized complexi...
This is the first full release of OptSymQuad. This software uses through-contact optimization (the g...
This is an updated release of OptSymQuad. This software uses through-contact optimization (the gener...
Source code of the solver for PACE 2023 Twin-width (https://pacechallenge.org/2023/)
Branch and reduce solver branching on possible merges within small distance. Submission for PACE 202...
PACE Challenge 2021 Solver Description, from the Random Sampling group of the UNSW GraphAbility VIP ...
The topic of the PACE (Parameterized Algorithms and Computational Experiments) 2023 challenge (https...
Instances for the PACE Challenge 2019 on the following tracks: 2a. Hypertree Width Exact and 2b. ...
International audienceThis document describes our heuristic Cluster Editing solver, µSolver, which g...
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
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
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...
This Zenodo repository contains all 3D coordinates for the all the motions submitted by the particip...
International audience2012 ACM Subject Classification Theory of computation → Parameterized complexi...
This is the first full release of OptSymQuad. This software uses through-contact optimization (the g...
This is an updated release of OptSymQuad. This software uses through-contact optimization (the gener...
DOI
Add to ORKG