Pages that link to "Item:Q5891343"
From MaRDI portal
The following pages link to On Planar Supports for Hypergraphs (Q5891343):
Displayed 13 items.
- The minimum feasible tileset problem (Q666670) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Short plane supports for spatial hypergraphs (Q1725733) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- Block Crossings in Storyline Visualizations (Q2961533) (← links)
- Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (Q2985117) (← links)
- Blocks of Hypergraphs (Q3000508) (← links)
- The Painter’s Problem: Covering a Grid with Colored Connected Polygons (Q4625138) (← links)
- Short Plane Supports for Spatial Hypergraphs (Q5233132) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)