13th International Symposium on Parameterized and Exact Computation (IPEC 2018)

DOI10.4230/LIPICS.IPEC.2018.0MaRDI QIDQ4626435zbMATH OpenOpenAlexFDO

Authors

Publication date 27 February 2019

Full work available at URL http://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol115-ipec2018-complete.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

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)