The First Parameterized Algorithms and Computational Experiments Challenge

In this article, the steering committee of the Parameterized Algorithms and Computational Experiments challenge (PACE) reports on the first iteration of the challenge. Where did PACE come from, how did it go, who won, and what's next?

[1]  Krishnendu Chatterjee,et al.  Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs , 2016, ESA.

[2]  Juho Lauri,et al.  Engineering Motif Search for Large Graphs , 2015, ALENEX.

[3]  Michael R. Fellows,et al.  An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem , 2005, COCOON.

[4]  Michal Pilipczuk,et al.  A ck n 5-Approximation Algorithm for Treewidth , 2016, SIAM J. Comput..

[5]  Yoichi Iwata,et al.  Half-integrality, LP-branching, and FPT Algorithms , 2016, SIAM J. Comput..

[6]  R. Downey,et al.  Parameterized Computational Feasibility , 1995 .

[7]  Yota Otachi,et al.  On the treewidth of toroidal grids , 2016, Discret. Appl. Math..

[8]  Reuven Bar-Yehuda,et al.  Randomized Algorithms for the Loop Cutset Problem , 2000, J. Artif. Intell. Res..

[9]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[10]  Rolf Niedermeier,et al.  Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..

[11]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[12]  Mikkel Thorup,et al.  All Structured Programs have Small Tree-Width and Good Register Allocation , 1998, Inf. Comput..

[13]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[14]  Markus Schulze,et al.  A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method , 2011, Soc. Choice Welf..

[15]  Andrew Gelfand,et al.  Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models , 2011, AAAI.