13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
From MaRDI portal
Publication:4626435
Cites work
- scientific article; zbMATH DE number 7378605 (Why is no real title available?)
- Counting induced subgraphs: a topological approach to \#W[1]-hardness
- Integer programming in parameterized complexity: three miniatures
- Resolving conflicts for lower-bounded clustering
- Solving target set selection with bounded thresholds faster than \(2^n\)
This page was built for publication: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626435)