The following pages link to (Q3787505):
Displaying 21 items.
- Sorting with networks of data structures (Q602673) (← links)
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering (Q2034395) (← links)
- Generalised online colouring problems in overlap graphs (Q2034796) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Mixed linear layouts: complexity, heuristics, and experiments (Q2206878) (← links)
- Tree search for the stacking problem (Q2393493) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Track assignment (Q2457297) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Heuristic search for the stacking problem (Q2914201) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- The complexity of colouring circle graphs (Q5096797) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- Leaf sector covers with applications on circle graphs (Q6549679) (← links)
- On 3-coloring circle graphs (Q6560146) (← links)
- Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)
- On 3-coloring circle graphs (Q6636987) (← links)
- Graphs of intersections of closed polygonal chains (Q6669632) (← links)
