The following pages link to Graph Drawing (Q2867637):
Displaying 50 items.
- Straight line triangle representations (Q517440) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← links)
- Simultaneous embedding: edge orderings, relative positions, cutvertices (Q1751092) (← links)
- Untangling two systems of noncrossing curves (Q2630858) (← links)
- On the Upward Planarity of Mixed Plane Graphs (Q2867638) (← links)
- Upward Planarity Testing: A Computational Study (Q2867639) (← links)
- Characterizing Planarity by the Splittable Deque (Q2867640) (← links)
- Strip Planarity Testing (Q2867641) (← links)
- Morphing Planar Graph Drawings Efficiently (Q2867642) (← links)
- Graph Drawing through the Lens of a Framework for Analyzing Visualization Methods (Q2867644) (← links)
- A Linear-Time Algorithm for Testing Outer-1-Planarity (Q2867645) (← links)
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs (Q2867646) (← links)
- Recognizing Outer 1-Planar Graphs in Linear Time (Q2867648) (← links)
- Extending Partial Representations of Circle Graphs (Q2867650) (← links)
- On Balanced -Contact Representations (Q2867651) (← links)
- Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations (Q2867652) (← links)
- Achieving Good Angular Resolution in 3D Arc Diagrams (Q2867654) (← links)
- A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes (Q2867655) (← links)
- Block Additivity of ℤ2-Embeddings (Q2867656) (← links)
- Exploiting Air-Pressure to Map Floorplans on Point Sets (Q2867657) (← links)
- Superpatterns and Universal Point Sets (Q2867659) (← links)
- Sketched Graph Drawing: A Lesson in Empirical Studies (Q2867661) (← links)
- Streamed Graph Drawing and the File Maintenance Problem (Q2867663) (← links)
- COAST: A Convex Optimization Approach to Stress-Based Embedding (Q2867664) (← links)
- Colored Spanning Graphs for Set Visualization (Q2867665) (← links)
- Drawing Non-Planar Graphs with Crossing-Free Subgraphs (Q2867666) (← links)
- Exploring Complex Drawings via Edge Stratification (Q2867667) (← links)
- Drawing Planar Graphs with a Prescribed Inner Face (Q2867668) (← links)
- Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases (Q2867669) (← links)
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees (Q2867670) (← links)
- Strict Confluent Drawing (Q2867672) (← links)
- A Ramsey-Type Result for Geometric ℓ-Hypergraphs (Q2867673) (← links)
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations (Q2867674) (← links)
- Stub Bundling and Confluent Spirals for Geographic Networks (Q2867676) (← links)
- On Orthogonally Convex Drawings of Plane Graphs (Q2867677) (← links)
- Planar and Plane Slope Number of Partial 2-Trees (Q2867678) (← links)
- Slanted Orthogonal Drawings (Q2867679) (← links)
- Drawing Arrangement Graphs in Small Grids, or How to Play Planarity (Q2867680) (← links)
- Incremental Grid-Like Layout Using Soft and Hard Constraints (Q2867683) (← links)
- Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings (Q2867684) (← links)
- Drawing Permutations with Few Corners (Q2867686) (← links)
- Dynamic Traceroute Visualization at Multiple Abstraction Levels (Q2867688) (← links)
- Fan-Planar Graphs: Combinatorial Properties and Complexity Results (Q2936925) (← links)
- On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles (Q3073653) (← links)
- Upward Geometric Graph Embeddings into Point Sets (Q3073656) (← links)
- On a Tree and a Path with No Geometric Simultaneous Embedding (Q3073657) (← links)
- Difference Map Readability for Dynamic Graphs (Q3073658) (← links)
- Maximizing the Total Resolution of Graphs (Q3073659) (← links)
- Plane Drawings of Queue and Deque Graphs (Q3073660) (← links)
- An Experimental Evaluation of Multilevel Layout Methods (Q3073662) (← links)
