{"id":"W2997607600","doi":"10.4230/lipics.ipec.2019.9","title":"C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Planarity testing; Combinatorics; Book embedding; Parameterized complexity; Planar graph; Mathematics; Embedding; Discrete mathematics; Vertex (graph theory); Graph drawing; Graph; 1-planar 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00263478,0.001991869,0.001943082,0.001331015,0.001553864,0.004147289,0.005971147,0.003382212,0.004840926],"category_scores_gemma":[0.03003012,0.001163855,0.002368932,0.002177287,0.003613588,0.009539356,0.005095859,0.004860094,0.001234353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003181615,"about_ca_system_score_gemma":0.002854872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005095202,"about_ca_topic_score_gemma":0.004926195,"domain_scores_codex":[0.9953258,0.0007476641,0.0002054457,0.001808139,0.001079216,0.0008337296],"domain_scores_gemma":[0.9572473,0.03052023,0.002440958,0.006225794,0.002036896,0.001528775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004978141,0.001266917,0.02188879,0.001859413,0.0005322885,0.001253245,0.00188421,0.4712945,0.05720652,0.1718147,0.02625668,0.2397646],"study_design_scores_gemma":[0.0002531135,0.0002173497,0.00134096,0.00006667442,0.0001546936,0.0004215914,0.0003898228,0.699022,0.01857545,0.2772155,0.002276476,0.0000664274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5763872,0.0009413215,0.3920639,0.006031845,0.0001234222,0.0003781726,0.003508406,0.007330796,0.01323497],"genre_scores_gemma":[0.8051184,0.0003240766,0.1841242,0.0009689585,0.0001530251,0.0002494456,0.004747367,0.001094558,0.0032199],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.005971147,"threshold_uncertainty_score":0.0230844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01945839379812749,"score_gpt":0.2348391680125248,"score_spread":0.2153807742143973,"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."}}