Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

Kratsch, Stefan; Marx, Dániel; Wahlström, Magnus

doi:10.1145/2858787

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

MPS-Authors

/persons/resource/persons44840

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

/persons/resource/persons45687

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

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

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: https://hdl.handle.net/11858/00-001M-0000-002A-4326-D

Abstract

There is no abstract available