Pages that link to "Item:Q582079"
From MaRDI portal
The following pages link to On the complexity of embedding planar graphs to minimize certain distance measures (Q582079):
Displaying 18 items.
- Topological morphing of planar graphs (Q386891) (← links)
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- On exteriority notions in book embeddings and treewidth (Q2297721) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- A Note on the Minimum H-Subgraph Edge Deletion (Q2947962) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- TESTING MUTUAL DUALITY OF PLANAR GRAPHS (Q5261018) (← links)
- Approximating the minimum hub cover problem on planar graphs (Q5963689) (← links)
- (Q6065397) (← links)
- Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
