{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005868179,0.00007482795,0.00009911849,0.00009763554,0.0001232051,0.00003896849,0.000392602,0.00002744754,0.0000181354],"category_scores_gemma":[0.00007340616,0.0000544924,0.00006494367,0.0005055318,0.00007658071,0.00009663656,0.00007471882,0.00008143512,0.00001651288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001227288,"about_ca_system_score_gemma":0.00002391841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001349949,"about_ca_topic_score_gemma":0.000002669577,"domain_scores_codex":[0.9991708,0.0000562878,0.0001982943,0.0001740565,0.0002494008,0.0001511447],"domain_scores_gemma":[0.9989838,0.0005233147,0.00008389589,0.0002926007,0.0000768118,0.00003958117],"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.00002317693,0.0001061656,0.00001950034,0.000005122355,0.00003228444,0.000005994876,0.0003451988,0.0009023477,0.01186909,0.8940792,0.000640408,0.09197149],"study_design_scores_gemma":[0.0008445407,0.000330979,0.01403881,0.00003181519,0.0000102067,0.00002337161,0.00005206952,0.2272481,0.2097444,0.5452475,0.002097171,0.0003310184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1661845,0.00001733053,0.8315791,0.0008639134,0.0002110769,0.00009831414,0.000002046857,0.00003966796,0.001003992],"genre_scores_gemma":[0.9102584,0.000001014724,0.0891921,0.0004537008,0.00005037215,0.000002828112,0.000003783628,0.000002974066,0.00003488683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7440738,"threshold_uncertainty_score":0.2222136,"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."}}