Pages that link to "Item:Q5452207"
From MaRDI portal
The following pages link to Crossing Numbers and Parameterized Complexity (Q5452207):
Displaying 12 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Note on the pair-crossing number and the odd-crossing number (Q938304) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- Computing crossing numbers in quadratic time (Q1887712) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Algorithmic complexity of finding cross-cycles in flag complexes (Q2874564) (← links)
- On the Pseudolinear Crossing Number (Q2978177) (← links)
- Crossing Number is Hard for Kernelization (Q3132876) (← links)
- An ILP-based Proof System for the Crossing Number Problem (Q4606298) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)