Pages that link to "Item:Q4581910"
From MaRDI portal
The following pages link to Approximation Algorithms for Euler Genus and Related Problems (Q4581910):
Displaying 8 items.
- A note on approximating graph genus (Q290221) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- Deleting vertices to graphs of bounded genus (Q2319638) (← links)
- A practical algorithm for the computation of the genus (Q5037919) (← links)
- Stronger ILPs for the Graph Genus Problem. (Q5075767) (← links)
- The Degenerate Crossing Number and Higher-Genus Embeddings (Q5084703) (← links)
- Planar Drawings of Higher-Genus Graphs (Q5894994) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)