The Parameterized Algorithms and Computational Experiments Challenge

You can find the slides of the ceremony with the results here. Some pictures (courtesy of Tom van der Zanden):

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. For all the tracks, the participants … More PACE 2018 now on OPTIL.io

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 PACE 2018 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 wish all of the participants good luck and fun in the remaining weeks.  

March 1 has passed which means that submission is possible from now until May 1 for both tracks of PACE 2017. We are happy to announce that PACE 2017 will cooperate with OPTIL.io to handle the submission process and the evaluation of submissions. OPTIL.io is a website for organizing programming challenges for optimization problems, created … More PACE is cooperating with OPTIL.io

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. TRACK A (Treewidth Challenges) 1) … More Announcing PACE 2017

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. Track A: Treewidth The treewidth of a graph is an … More Here are the Results of the 1st PACE Challenge

Thanks to the generous support of the NWO Gravitation project NETWORKS, we can announce the following awards for the first PACE challenge. Competition Prizes For each of the two tracks we award prizes. Track A offers four ranked challenges: exact sequential, exact parallel, heuristic sequential, and heuristic parallel computation of treewidth. For each ranked challenge, … More Challenge Prizes and Travel Awards

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 provide a bridge between the theory of design and analysis of algorithms and the algorithm engineering practice, … More Announcing the 1st Parameterized Algorithms and Computational Experiments Challenge