{"id":"W1500796099","doi":"10.1007/3-540-36151-0_12","title":"An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Constant (computer programming); Algorithm; Combinatorics; Approx; Running time; Computer science; Mathematics; Discrete mathematics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"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.001327604,0.002293787,0.002281043,0.001224639,0.001144822,0.002508567,0.003829514,0.002571809,0.02524392],"category_scores_gemma":[0.005120527,0.001027682,0.001660153,0.002480822,0.00114016,0.003395223,0.003479472,0.003676657,0.007352989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00176352,"about_ca_system_score_gemma":0.002600969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003330013,"about_ca_topic_score_gemma":0.006013429,"domain_scores_codex":[0.9986402,0.0003047681,0.00006531888,0.0003414051,0.0004209571,0.0002273188],"domain_scores_gemma":[0.9984995,0.0008039823,0.0000772444,0.0003729879,0.0001699146,0.00007643693],"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.0005410486,0.0005187987,0.0005724136,0.000376769,0.0001018667,0.0001811834,0.0002082437,0.1839657,0.008458475,0.09338838,0.05295555,0.6587316],"study_design_scores_gemma":[0.0002591338,0.0001447884,0.0003431194,0.00004564866,0.00005521751,0.0001931256,0.00008988983,0.8156357,0.003105933,0.1716557,0.008434324,0.00003741423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01055191,0.0002649267,0.9660384,0.0004590117,0.0001272508,0.0002223663,0.0004317565,0.004079108,0.01782531],"genre_scores_gemma":[0.09157305,0.0001702708,0.8923087,0.0003076491,0.00008673346,0.0005065263,0.001431194,0.001232288,0.01238357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02524392,"threshold_uncertainty_score":0.08444929,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02413435459097163,"score_gpt":0.2595262473964646,"score_spread":0.235391892805493,"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."}}