Pages that link to "Item:Q3663349"
From MaRDI portal
The following pages link to The Complexity of the Partial Order Dimension Problem (Q3663349):
Displaying 5 items.
- Comparability graphs and intersection graphs (Q1172652) (← links)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Crisp dimension theory and valued preference relations (Q4471213) (← links)
- Ray shooting from convex ranges (Q5929310) (← links)
