English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

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.

Item is

Basic

show hide
Genre: Journal Article
Latex : Parameterized Complexity and Kernelizability of {Max Ones} and {Exact Ones} Problems

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kratsch, Stefan1, Author           
Marx, Dániel2, Author
Wahlström, Magnus1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20162016
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1145/2858787
BibTex Citekey: Kratsch2016
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: ACM Transactions on Computation Theory
  Abbreviation : TOCT
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: 28 p. Volume / Issue: 8 (1) Sequence Number: 1 Start / End Page: - Identifier: -