{"id":"W2079313211","doi":"10.1016/j.jalgor.2004.02.001","title":"The dominating set problem is fixed parameter tractable for graphs of bounded genus","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University; University of Victoria","funders":"","keywords":"Bounded function; Mathematics; Combinatorics; Genus; Planar graph; Maximal independent set; Dominating set; Discrete mathematics; Set (abstract data type); Planar; Pathwidth; Chordal graph; 1-planar graph; Graph; Computer science; Line graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001940318,0.0001274403,0.0002730866,0.0001814916,0.0002811272,0.0001703902,0.001178796,0.00005686437,0.00000326597],"category_scores_gemma":[0.0002639146,0.00008284775,0.0002708369,0.0004965146,0.0001524829,0.0006810447,0.0001032659,0.0003138821,0.000001590755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006941253,"about_ca_system_score_gemma":0.0002029058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006790684,"about_ca_topic_score_gemma":0.000002253594,"domain_scores_codex":[0.9981486,0.0000825439,0.0006106907,0.0001729954,0.0005812942,0.000403913],"domain_scores_gemma":[0.997429,0.0008758609,0.0006303812,0.0003511728,0.0006009986,0.0001126534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005727804,0.0006092343,0.0002533543,0.0001964162,0.0006852918,0.000125774,0.0097559,0.003359505,0.01612355,0.1636304,0.001657194,0.8030306],"study_design_scores_gemma":[0.002281324,0.00100031,0.0001605777,0.00009731692,0.00001998788,0.0002599781,0.0002587534,0.008377116,0.05257212,0.9316086,0.003197926,0.0001660414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07631182,0.0006974135,0.919313,0.002687803,0.0003875929,0.0004456389,0.00001234155,0.00001706551,0.0001272892],"genre_scores_gemma":[0.199518,0.0001088661,0.7999569,0.0001158048,0.0001016645,0.00001871487,4.410926e-7,0.00001883089,0.000160819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8028646,"threshold_uncertainty_score":0.3378433,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02940947855945121,"score_gpt":0.3175157692308598,"score_spread":0.2881062906714086,"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."}}