Pages that link to "Item:Q1085167"
From MaRDI portal
The following pages link to A unified approach to visibility representations of planar graphs (Q1085167):
Displaying 50 items.
- Area requirement of visibility representations of trees (Q287042) (← links)
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes (Q306259) (← links)
- Compact visibility representation of 4-connected plane graphs (Q443715) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- A note on the combinatorial structure of the visibility graph in simple polygons (Q673765) (← links)
- Directed rectangle-visibility graphs have unbounded dimension (Q674919) (← links)
- Dynamic reachability in planar digraphs with one source and one sink (Q688163) (← links)
- Improved visibility representation of plane graphs (Q706721) (← links)
- Grid intersection graphs and order dimension (Q722596) (← links)
- Planar bus graphs (Q724233) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Base-object location problems for base-monotone regions (Q744059) (← links)
- How to draw a planar graph on a grid (Q804582) (← links)
- Visibility representations of four-connected plane graphs with near optimal heights (Q833713) (← links)
- The strength of weak proximity (Q849629) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- Good spanning trees in graph drawing (Q897943) (← links)
- L-visibility drawings of IC-planar graphs (Q903189) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Linear bound on extremal functions of some forbidden patterns in 0-1 matrices (Q1024495) (← links)
- Optimal \(st\)-orientations for plane triangulations (Q1029266) (← links)
- Bijective counting of plane bipolar orientations and Schnyder woods (Q1039437) (← links)
- Three results on frequency assignment in linear cellular networks (Q1041229) (← links)
- Visibility representation of plane graphs via canonical ordering tree (Q1044700) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Constrained visibility representations of graphs (Q1186563) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Constructing compact rectilinear planar layouts using canonical representation of planar graphs (Q1193898) (← links)
- Computing the full visibility graph of a set of line segments (Q1198072) (← links)
- Some results on visibility graphs (Q1201816) (← links)
- Classes and recognition of curve contact graphs (Q1272471) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Rectangle-visibility representations of bipartite graphs (Q1363757) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Universal 3-dimensional visibility representations for graphs (Q1384193) (← links)
- A tribute to Frank Harary (in honor of his 70th birthday) (Q1388964) (← links)
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems (Q1392021) (← links)
- Orthogonal drawings based on the stratification of planar graphs (Q1422412) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Orthogonal polygon reconstruction from stabbing information (Q1614070) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- 3-coloring arrangements of line segments with 4 slopes is hard (Q1641160) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity (Q1725786) (← links)
