The following pages link to William S. Evans (Q290510):
Displayed 50 items.
- Item:Q290510 (redirect page) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes (Q306259) (← links)
- Alternating paths and cycles of minimum length (Q340546) (← links)
- On point-sets that support planar graphs (Q714901) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Angle covers: algorithms and complexity (Q782165) (← links)
- Minimum rectilinear polygons for given angle sequences (Q824339) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- Table cartogram (Q1699289) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- Item:Q290510 (redirect page) (← links)
- Broadcasting on trees and the Ising model. (Q1884823) (← links)
- Approximate proximity drawings (Q1947972) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- Simultaneous visibility representations of undirected pairs of graphs (Q2230410) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs (Q2811194) (← links)
- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes (Q2827815) (← links)
- Minimizing Co-location Potential of Moving Entities (Q2829447) (← links)
- Table Cartograms (Q2849333) (← links)
- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs (Q2872083) (← links)
- Column Planarity and Partial Simultaneous Geometric Embedding (Q2936932) (← links)
- Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs (Q2938759) (← links)
- Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ (Q2944535) (← links)
- Minimum Rectilinear Polygons for Given Angle Sequences (Q2958091) (← links)
- Alternating Paths and Cycles of Minimum Length (Q2959772) (← links)
- On characterizing terrain visibility graphs (Q2970417) (← links)
- (Q3044349) (← links)
- On Graphs Supported by Line Sets (Q3073670) (← links)
- On Point-Sets That Support Planar Graphs (Q3223944) (← links)
- Approximate Proximity Drawings (Q3223952) (← links)
- COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN (Q3373053) (← links)
- On the Spanning Ratio of Gabriel Graphs and beta-Skeletons (Q3440264) (← links)
- Contact Representations of Graphs in 3D (Q3449802) (← links)
- On the maximum tolerable noise of k-input gates for reliable computation by formulas (Q3546857) (← links)
- (Q3576662) (← links)
- Signal propagation and noisy circuits (Q4503491) (← links)
- DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND (Q4818571) (← links)
- Restructuring ordered binary trees (Q4820879) (← links)
- Universal Point Subsets for Planar Graphs (Q4909559) (← links)
- On Representing Graphs by Touching Cuboids (Q4912201) (← links)
- (Q4952654) (← links)
- Competitive query strategies for minimising the ply of the potential locations of moving points (Q5174473) (← links)
- Minimizing Interference Potential Among Moving Entities (Q5236335) (← links)
- (Q5282814) (← links)
- Bar k-Visibility Graphs (Q5301404) (← links)
- (Q5501368) (← links)
- On Area-Universal Quadrangulations (Q5856667) (← links)