International Symposium on Parameterized and Exact Computation
Source
Source type: conference
Fully open access: No
In DOAJ: No
2yr mean citedness:
H-index: 13
I10-index: 17
Works count: 126
Citations count: 682
Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
2015 · Virginia Vassilevska Williams · International Symposium on Parameterized and Exact Computation
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration
2018 · Holger Dell, Christian Komusiewicz, et al. · International Symposium on Parameterized and Exact Computation
The first parameterized algorithms and computational experiments challenge
2017 · Holger Dell, Thore Husfeldt, et al. · International Symposium on Parameterized and Exact Computation