{"id":"https://openalex.org/W2253657605","doi":"https://doi.org/10.1145/2858787","title":"Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems","display_name":"Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems","publication_year":2016,"publication_date":"2016-02-03","ids":{"openalex":"https://openalex.org/W2253657605","doi":"https://doi.org/10.1145/2858787","mag":"2253657605"},"language":"en","primary_location":{"id":"doi:10.1145/2858787","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2858787","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050140825","display_name":"Stefan Kratsch","orcid":"https://orcid.org/0000-0002-0193-7239"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Kratsch","raw_affiliation_strings":["Max-Planck-Institute for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210155092","display_name":"Czech Academy of Sciences, Institute of Computer Science","ror":"https://ror.org/0496n6574","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210155092"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["CZ","HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute of Computer Science and Control, Hungarian Academy of Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Control, Hungarian Academy of Sciences","institution_ids":["https://openalex.org/I4210155092","https://openalex.org/I7597260"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001475076","display_name":"Magnus Wahlstr\u00f6m","orcid":"https://orcid.org/0000-0002-0933-4504"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Magnus Wahlstr\u00f6m","raw_affiliation_strings":["Max-Planck-Institute for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9781,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.77873937,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"8","issue":"1","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8921315670013428},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7734931707382202},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6264685392379761},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.5743443965911865},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.5604248642921448},{"id":"https://openalex.org/keywords/polynomial-kernel","display_name":"Polynomial kernel","score":0.5505344271659851},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5291830897331238},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5268341898918152},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5267283916473389},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4828256070613861},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43265485763549805},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4136848747730255},{"id":"https://openalex.org/keywords/kernel-method","display_name":"Kernel method","score":0.15734055638313293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14790135622024536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10101589560508728}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8921315670013428},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7734931707382202},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6264685392379761},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.5743443965911865},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.5604248642921448},{"id":"https://openalex.org/C160446489","wikidata":"https://www.wikidata.org/wiki/Q7226642","display_name":"Polynomial kernel","level":4,"score":0.5505344271659851},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5291830897331238},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5268341898918152},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5267283916473389},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4828256070613861},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43265485763549805},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4136848747730255},{"id":"https://openalex.org/C122280245","wikidata":"https://www.wikidata.org/wiki/Q620622","display_name":"Kernel method","level":3,"score":0.15734055638313293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14790135622024536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10101589560508728},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2858787","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2858787","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7324173974","display_name":null,"funder_award_id":"NK105645","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"}],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W34906880","https://openalex.org/W36639738","https://openalex.org/W1544829330","https://openalex.org/W1570425181","https://openalex.org/W1571873445","https://openalex.org/W1852383912","https://openalex.org/W1876800908","https://openalex.org/W1976430052","https://openalex.org/W2013415302","https://openalex.org/W2014363582","https://openalex.org/W2016341899","https://openalex.org/W2027506801","https://openalex.org/W2028127968","https://openalex.org/W2052936500","https://openalex.org/W2068190866","https://openalex.org/W2107284348","https://openalex.org/W2107918022","https://openalex.org/W2118728198","https://openalex.org/W2129023820","https://openalex.org/W2131202479","https://openalex.org/W2134850460","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2169262928","https://openalex.org/W2179732776","https://openalex.org/W2490706771","https://openalex.org/W2913688336","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W2425261484","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004"],"abstract_inverted_index":{"For":[0,64,102],"a":[1,36,72,82,116,137],"finite":[2],"set":[3,44],"\u0393":[4,128],"of":[5,53],"Boolean":[6],"relations,":[7],"M":[8,65],"ax":[9,66],"O":[10,16,67,105,133],"nes":[11,17,68,106,134],"SAT(\u0393)":[12,18,135],"and":[13,30,95,124],"E":[14,103,131],"xact":[15,104,132],"are":[19],"generalized":[20],"satisfiability":[21],"problems":[22],"where":[23],"every":[24],"constraint":[25],"relation":[26],"is":[27,33],"from":[28],"\u0393,":[29],"the":[31,50,57,110,120,126],"task":[32],"to":[34,45],"find":[35],"satisfying":[37],"assignment":[38],"with":[39],"at":[40,119],"least/exactly":[41],"k":[42,93,99],"variables":[43],"1,":[46],"respectively.":[47],"We":[48],"study":[49],"parameterized":[51],"complexity":[52,77],"these":[54],"problems,":[55],"including":[56],"question":[58],"whether":[59],"they":[60],"admit":[61],"polynomial":[62,83,89,138],"kernels.":[63],"SAT(\u0393),":[69,107],"we":[70,108],"give":[71],"classification":[73,111],"into":[74],"five":[75],"different":[76],"levels:":[78],"polynomial-time":[79],"solvable,":[80],"admits":[81,136],"kernel,":[84],"fixed-parameter":[85,121],"tractable,":[86],"solvable":[87],"in":[88],"time":[90],"for":[91,98,129],"fixed":[92],",":[94],"NP-hard":[96],"already":[97],"=":[100],"1.":[101],"refine":[109],"obtained":[112],"earlier":[113],"by":[114],"taking":[115],"closer":[117],"look":[118],"tractable":[122],"cases":[123],"classifying":[125],"sets":[127],"which":[130],"kernel.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}