The following pages link to (Q3220608):
Displaying 33 items.
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- A note on isosceles planar graph drawing (Q763540) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- Convex drawings of graphs with non-convex boundary constraints (Q947122) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- A linear algorithm for embedding planar graphs using PQ-trees (Q1083864) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Convex representations of maps on the torus and other flat surfaces (Q1314444) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Minimum-segment convex drawings of 3-connected cubic plane graphs (Q2377378) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- On morphing 1-planar drawings (Q2672443) (← links)
- Straight-Line Drawability of a Planar Graph Plus an Edge (Q3449828) (← links)
- Non-convex Representations of Graphs (Q3611875) (← links)
- Algorithms for 1-Planar Graphs (Q5001657) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- (Q5068485) (← links)
- The Stub Resolution of 1-planar Graphs (Q5084699) (← links)
- How to Morph Planar Graph Drawings (Q5737811) (← links)
- Compact drawings of 1-planar graphs with right-angle crossings and few bends (Q5915941) (← links)
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977) (← links)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)
