We are pleased to announce the ninth iteration of PACE, the Parameterized Algorithms and Computational Experiments Challenge!
The challenge for this year is One-Sided Crossing Minimization.
Find the details here.
The easychair platform to register your solver and later to submit the solver description is now open!
See also the submission requirements of PACE 2022.
We are pleased to announce the seventh iteration of PACE, the Parameterized Algorithms and Computational Experiments Challenge!
The challenge for this year is Directed Feedback Vertex Set.
Find the details here.
We are pleased to announce the sixth iteration of PACE, the Parameterized Algorithms and Computational Experiments Challenge!
The challenge for this year is Cluster Editing.
Find the details here.
We created a repository which contains all our (public and private) instances. Enjoy! Each instance file has comment lines with instance type (e.g. biology, social networks), origin and description. We hope that the repo will be useful for future PACE organizers and for researchers working in algorithm engineering.
We are happy to announce that you can now submit your solutions to optil.io.
Let us recall that the final deadline for submission is June, 1.
Until the submission deadline, you will be able to test your solution on public instances and see unofficial rankings.
Please note that the ranking published at optil.io is only auxiliary. In particular:
We are happy to announce the fifth iteration of PACE, the Parameterized Algorithms and Computational Experiments Challenge. The goal of PACE is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms.
Due to problems with the submission system easychair, we extend the deadline until Monday June 3rd, 2019 (AOE).
We’ve been informed on May 30th that easychair is experiencing network problems which however should have already beenresolved on May 31st (see below).
Nonetheless, due to several requests still reporting problems, we decided to extend the deadline further.
We are currently experiencing some issues with the optil system. The problem was first reported yesterday. According to optil, they ran a system update. We are in contact with the optil team.
Unfortunately, there is a public holiday on May 1st and May 3rd in Poland, so we might get answers not before Monday.
We are happy to announce the fourth iteration of PACE, the Parameterized Algorithms and Computational Experiments Challenge.
The goal of PACE is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms. This year, the challenge consists of two separate tracks.
We are happy to announce that PACE 2018 will cooperate again with
OPTIL.io to handle the submission process and the
evaluation of the submissions. OPTIL.io is a website
for organizing programming challenges on optimization problems, created
and maintained by the Institute of Computing
Science of Poznan University of
Technology.
The PACE 2018 challenge has started! This year there is only one problem, Steiner Tree, and three tracks: two for exact algorithms and one for heuristics. To register your team now and find out all the details of the challenge, visit the challenge page.
Due to numerous requests, we decided to allow submissions for Track A and Track B until May 25. Thanks to the cooperation with OPTIL.io, we can still send out the notification on June 1.
We are happy to announce the second iteration of PACE, the Parameterized Algorithms and Computational Experiments Challenge. The goal of PACE is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms. The challenge consists of two separate tracks.
The winners of the 1st PACE competition were presented at ALGO
2016 in Aarhus. For
those that couldn’t make it to Aarhus: here are the results. We would
like to thank all participants for making this 1st edition of PACE an
enjoyable and successful one.
The goal of the Parameterized Algorithms and Computational Experiments Challenge (PACE) is to investigate the applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms. In particular, it aims to