de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44840

Kratsch,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45687

Wahlström,  Magnus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Kratsch, S., Marx, D., & Wahlström, M. (2016). Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. ACM Transactions on Computation Theory, 8(1): 1. doi:10.1145/2858787.


Cite as: http://hdl.handle.net/11858/00-001M-0000-002A-4326-D
Abstract
There is no abstract available