Name
Title | ||
|---|---|---|
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. |
Abstract | ||
|---|---|---|
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Experiments challenge (PACE 2017) reports on the second iteration of the PACE challenge. Track A featured the Treewidth problem and Track B the Minimum Fill-In problem. Over 44 participants on 17 teams from 11 countries submitted their implementations to the competition. |
Year | Venue | Field |
|---|---|---|
2017 | IPEC | Pace,Computer science,Theoretical computer science,Implementation,Treewidth,Parameterized algorithms |
DocType | Citations | PageRank |
Conference | 3 | 0.41 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Holger Dell | 1 | 220 | 16.74 |
| Christian Komusiewicz | 2 | 461 | 46.04 |
| Nimrod Talmon | 3 | 133 | 29.22 |
| Mathias Weller | 4 | 138 | 14.17 |