Crossing Numbers and Parameterized Complexity (Q5452207): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computing crossing numbers in quadratic time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3549636 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: String graphs requiring exponential representations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Which crossing number is it anyway? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Drawing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3576669 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decidability of string graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on the pair-crossing number and the odd-crossing number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5290280 / rank | |||
Normal rank |
Latest revision as of 19:58, 27 June 2024
scientific article; zbMATH DE number 5252811
Language | Label | Description | Also known as |
---|---|---|---|
English | Crossing Numbers and Parameterized Complexity |
scientific article; zbMATH DE number 5252811 |
Statements
Crossing Numbers and Parameterized Complexity (English)
0 references
25 March 2008
0 references