{"id":"https://openalex.org/W2778284341","doi":"https://doi.org/10.1145/3155294","title":"Parameterized Testability","display_name":"Parameterized Testability","publication_year":2017,"publication_date":"2017-12-14","ids":{"openalex":"https://openalex.org/W2778284341","doi":"https://doi.org/10.1145/3155294","mag":"2778284341"},"language":"en","primary_location":{"id":"doi:10.1145/3155294","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3155294","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/A5062918669","display_name":"Kazuo Iwama","orcid":"https://orcid.org/0000-0002-5339-0669"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kazuo Iwama","raw_affiliation_strings":["Kyoto University, Kyoto, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4583,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68122253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":"4","first_page":"1","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/vertex-cover","display_name":"Vertex cover","score":0.77318274974823},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7577478289604187},{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.699774980545044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6752064228057861},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.614843487739563},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5641969442367554},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.537695050239563},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4561966061592102},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4367034435272217},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4219237267971039},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35910776257514954},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3238832354545593},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2268669605255127}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.77318274974823},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7577478289604187},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.699774980545044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6752064228057861},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.614843487739563},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5641969442367554},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.537695050239563},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4561966061592102},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4367034435272217},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4219237267971039},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35910776257514954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3238832354545593},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2268669605255127},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3155294","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3155294","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/G8008447739","display_name":"Constant-Time Algorithms for Continuous Objects","funder_award_id":"17H04676","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W621782861","https://openalex.org/W1965645254","https://openalex.org/W1970630090","https://openalex.org/W1980155175","https://openalex.org/W1980816908","https://openalex.org/W1984070713","https://openalex.org/W1985538939","https://openalex.org/W1999617330","https://openalex.org/W2006450313","https://openalex.org/W2012438382","https://openalex.org/W2016987856","https://openalex.org/W2026244324","https://openalex.org/W2040977211","https://openalex.org/W2048572907","https://openalex.org/W2054991524","https://openalex.org/W2070263216","https://openalex.org/W2071346321","https://openalex.org/W2072015757","https://openalex.org/W2076599430","https://openalex.org/W2082227928","https://openalex.org/W2109330224","https://openalex.org/W2116537669","https://openalex.org/W2116953739","https://openalex.org/W2125719181","https://openalex.org/W2130673833","https://openalex.org/W2153822379","https://openalex.org/W2296148711","https://openalex.org/W2444233166","https://openalex.org/W2569976290","https://openalex.org/W2913688336","https://openalex.org/W4241342151","https://openalex.org/W4292230561","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2950838401","https://openalex.org/W41549461","https://openalex.org/W2767174160","https://openalex.org/W4297689169","https://openalex.org/W2295534309","https://openalex.org/W2953291322","https://openalex.org/W4286853492","https://openalex.org/W4296116869","https://openalex.org/W3215145351"],"abstract_inverted_index":{"This":[0],"article":[1],"studies":[2],"property":[3,105],"testing":[4],"for":[5,78,90,121,130],"NP":[6],"optimization":[7,133],"problems":[8,65],"with":[9,17,106],"parameter":[10,68],"k":[11,35,38,42,44,47,54,93,138,156],"under":[12],"the":[13,62,104,113,118,126,131],"general":[14],"graph":[15],"model":[16],"an":[18],"augmentation":[19],"of":[20,31,110,115,128],"random":[21],"edge":[22],"sampling":[23],"capability.":[24],"It":[25,57],"is":[26,55,96,143,157],"shown":[27],"that":[28,61,75,124],"a":[29,107,152,158],"variety":[30],"such":[32],"problems,":[33],"including":[34],"-Vertex":[36],"Cover,":[37],"-Feedback":[39],"Vertex":[40],"Set,":[41,49],"-Multicut,":[43],"-Path-Free,":[45],"and":[46,71],"-Dominating":[48,94],"are":[50,66,87,125],"constant-query":[51],"testable":[52],"if":[53],"constant.":[56,159],"should":[58],"be":[59],"noted":[60],"first":[63],"four":[64],"fixed":[67],"tractable":[69],"(FPT)":[70],"it":[72],"turns":[73],"out":[74],"algorithmic":[76],"techniques":[77],"their":[79],"FPT":[80,146],"algorithms":[81],"(branch-and-bound":[82],"search,":[83],"color":[84],"coding,":[85],"etc.)":[86],"also":[88,136],"useful":[89],"our":[91],"testers.":[92],"Set":[95],"W":[97],"[2]-hard,":[98],"but":[99,148],"we":[100,149],"can":[101],"still":[102],"test":[103],"constant":[108],"number":[109],"queries,":[111],"since":[112],"definition":[114],"\u03b5-farness":[116],"makes":[117],"problem":[119],"trivial":[120],"non-sparse":[122],"graphs":[123],"source":[127],"hardness":[129],"original":[132],"problem.":[134],"We":[135],"consider":[137],"-Odd":[139],"Cycle":[140],"Transversal,":[141],"which":[142],"another":[144],"well-known":[145],"problem,":[147],"only":[150],"give":[151],"sublinear-query":[153],"tester":[154],"when":[155]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}