{"id":"W2922321031","doi":"10.1007/s00453-007-9151-1","title":"On the Parameterized Complexity of Layered Graph Drawing","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Combinatorics; Parameterized complexity; Pathwidth; Mathematics; Graph drawing; Theory of computation; Bounded function; Crossing number (knot theory); Graph; Time complexity; Span (engineering); Discrete mathematics; Line graph; Algorithm","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.003029772,0.001362853,0.002243217,0.00201307,0.001865592,0.006866141,0.005054753,0.002658034,0.0220753],"category_scores_gemma":[0.03906356,0.00147736,0.002248056,0.004478225,0.003400094,0.01875035,0.006031032,0.005773583,0.002101392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004308614,"about_ca_system_score_gemma":0.002428393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005764497,"about_ca_topic_score_gemma":0.00685404,"domain_scores_codex":[0.9959106,0.001468391,0.0002423565,0.0006630709,0.001281324,0.0004342079],"domain_scores_gemma":[0.9593671,0.03144258,0.001680024,0.005222162,0.001330067,0.0009580845],"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.0005675204,0.0002285264,0.003959327,0.0005154978,0.0001381484,0.0002163054,0.0006643991,0.2736784,0.003350764,0.6001336,0.01679453,0.09975305],"study_design_scores_gemma":[0.0000557678,0.00003025491,0.0004699795,0.00002987946,0.00004248878,0.00007868406,0.00009336249,0.4549308,0.0008238194,0.5404222,0.003001549,0.00002124493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1376696,0.001800895,0.8155966,0.005432308,0.000267098,0.0001997584,0.001584313,0.002105918,0.03534354],"genre_scores_gemma":[0.686157,0.002194277,0.2879673,0.0006789003,0.0004659139,0.00043024,0.00371315,0.001656361,0.01673683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0220753,"threshold_uncertainty_score":0.0738492,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04315325250689598,"score_gpt":0.271161155714278,"score_spread":0.228007903207382,"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."}}