English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness

MPS-Authors
/persons/resource/persons229250

Wellnitz,  Philip
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Dörfler, J., Roth, M., Schmitt, J., & Wellnitz, P. (2019). Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. In P. Rossmanith, P. Heggernes, & J.-P. Katoen (Eds.), 44th International Symposium on Mathematical Foundations of Computer Science. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.MFCS.2019.26.


Cite as: http://hdl.handle.net/21.11116/0000-0005-85DB-E
Abstract
There is no abstract available