Pages that link to "Item:Q2339452"
From MaRDI portal
The following pages link to Advancements on SEFE and partitioned book embedding problems (Q2339452):
Displaying 20 items.
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- The QuaSEFE problem (Q2206856) (← links)
- Planarity of streamed graphs (Q2333805) (← links)
- Clustered planarity with pipes (Q2414866) (← links)
- The importance of being proper (Q2512653) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Simultaneous Embedding (Q5001665) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Hierarchical partial planarity (Q5915789) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- On the complexity of the storyplan problem (Q6078287) (← links)
- Small Point-Sets Supporting Graph Stories (Q6141788) (← links)
- On the complexity of the storyplan problem (Q6172205) (← links)
