Pages that link to "Item:Q5096797"
From MaRDI portal
The following pages link to The complexity of colouring circle graphs (Q5096797):
Displayed 9 items.
- Sorting with networks of data structures (Q602673) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- 2-stack sorting is polynomial (Q2363966) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- On the complexity of container stowage planning problems (Q2449077) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)