Pages that link to "Item:Q5096797"
From MaRDI portal
The following pages link to The complexity of colouring circle graphs (Q5096797):
Displaying 16 items.
- Sorting with networks of data structures (Q602673) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering (Q2039665) (← links)
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis (Q2110740) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← 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)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- On 3-coloring circle graphs (Q6560146) (← links)
- On 3-coloring circle graphs (Q6636987) (← links)
