{"id":"W1513274608","doi":"10.1007/s00453-016-0159-2","title":"On the Parameterized Complexity of Reconfiguration Problems","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"ca_institutions":"Google (Canada); University of Waterloo","funders":"","keywords":"Control reconfiguration; Parameterized complexity; Vertex cover; Vertex (graph theory); Combinatorics; Kernelization; Mathematics; Theory of computation; Bounded function; Maximization; Sequence (biology); Discrete mathematics; Graph; Computer science; Algorithm; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003651241,0.002331818,0.002752648,0.002275984,0.002348251,0.007620481,0.004980233,0.003657276,0.02512071],"category_scores_gemma":[0.04089291,0.00147116,0.002870978,0.004893979,0.004853346,0.02196125,0.005045634,0.009684091,0.001906313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005620447,"about_ca_system_score_gemma":0.003222964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003902574,"about_ca_topic_score_gemma":0.00413229,"domain_scores_codex":[0.9947646,0.002008526,0.0002478223,0.00101027,0.001082753,0.0008859193],"domain_scores_gemma":[0.9452959,0.04646668,0.002047139,0.003619308,0.001182383,0.001388617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007482647,0.0005016816,0.00365173,0.000771584,0.0002100572,0.0002683564,0.0006505179,0.1918925,0.002144558,0.7103118,0.02504109,0.06380782],"study_design_scores_gemma":[0.0001150484,0.00004306936,0.0006189328,0.00004901499,0.00005788307,0.00009144011,0.0001323051,0.1500765,0.0003646504,0.8453943,0.003032897,0.0000240547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3148108,0.006533857,0.5192821,0.02770914,0.0008843159,0.0004646464,0.003372759,0.001665029,0.1252773],"genre_scores_gemma":[0.8519376,0.004923156,0.1086122,0.001948451,0.001673054,0.0007751768,0.004767883,0.001327132,0.02403528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02512071,"threshold_uncertainty_score":0.08403713,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06819916082681735,"score_gpt":0.2874308113952869,"score_spread":0.2192316505684695,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}