The following pages link to Stephen K. Wismath (Q706718):
Displayed 49 items.
- (Q340545) (redirect page) (← links)
- Alternating paths and cycles of minimum length (Q340546) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- On point-sets that support planar graphs (Q714901) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Packing trees into 1-planar graphs (Q782163) (← links)
- (Q848670) (redirect page) (← links)
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Matched drawability of graph pairs and of graph triples (Q982951) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- (Q1198071) (redirect page) (← links)
- Computing the full visibility graph of a set of line segments (Q1198072) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Determining bar-representability for ordered weighted graphs (Q1917046) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Book embeddability of series-parallel digraphs (Q2505497) (← links)
- Planar and Quasi Planar Simultaneous Geometric Embedding (Q2936913) (← links)
- Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs (Q2938759) (← links)
- Alternating Paths and Cycles of Minimum Length (Q2959772) (← links)
- Monotone Simultaneous Embeddings of Paths in d Dimensions (Q2961545) (← links)
- (Q3043734) (← links)
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- On Graphs Supported by Line Sets (Q3073670) (← links)
- On Point-Sets That Support Planar Graphs (Q3223944) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- k-Colored Point-Set Embeddability of Outerplanar Graphs (Q3595463) (← links)
- Matched Drawability of Graph Pairs and of Graph Triples (Q3605508) (← links)
- Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
- (Q4028897) (← links)
- (Q4422272) (← links)
- (Q4560223) (← links)
- PROPERTIES OF ARRANGEMENT GRAPHS (Q4661879) (← links)
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Q4679074) (← links)
- POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION (Q4682195) (← links)
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME (Q4762913) (← links)
- Packing Trees into 1-planar Graphs (Q5084698) (← links)
- Point-Set Embedding in Three Dimensions (Q5250131) (← links)
- Drawing Kn in Three Dimensions with One Bend per Edge (Q5301393) (← links)
- k-colored Point-set Embeddability of Outerplanar Graphs (Q5301427) (← links)
- Point-Set Embedding of Trees with Edge Constraints (Q5452216) (← links)
- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices (Q5452237) (← links)
- Graph Drawing (Q5897620) (← links)
- Graph Drawing (Q5897622) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902521) (← links)
- Packing Trees into 1-planar Graphs (Q6328555) (← links)