Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #51 to #100.

Counting Plane Graphs: Cross-Graph Charging Schemes: Label: en
The First Simple Symmetric 11-Venn Diagram: Label: en
Interactive Random Graph Generation with Evolutionary Algorithms: Label: en
Optical Graph Recognition: Label: en
Graph Drawing in TikZ: Label: en
Time-Space Maps from Triangulations: Label: en
DAGView: An Approach for Visualizing Large Graphs: Label: en
Clustering, Visualizing, and Navigating for Large Dynamic Graphs: Label: en
Mental Map Preservation Helps User Orientation in Dynamic Graphs: Label: en
Drawing Metro Maps Using Bézier Curves: Label: en
On the Usability of Lombardi Graph Drawings: Label: en
Visualizing Streaming Text Data with Dynamic Graphs and Maps: Label: en
Drawing Clustered Graphs as Topographic Maps: Label: en
Force-Directed Graph Drawing Using Social Gravity and Scaling: Label: en
StreamEB: Stream Edge Bundling.: Label: en
Planar Preprocessing for Spring Embedders: Label: en
Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings: Label: en
The Visible Perimeter of an Arrangement of Disks: Label: en
Density Theorems for Intersection Graphs of t-Monotone Curves: Label: en
Tangles and Degenerate Tangles: Label: en
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time: Label: en
On the Density of Maximal 1-Planar Graphs: Label: en
Grid Drawings and the Chromatic Number: Label: en
Covering Paths for Planar Point Sets: Label: en
Point-Set Embeddability of 2-Colored Trees: Label: en
Kinetic and Stationary Point-Set Embeddability for Plane Graphs: Label: en
Homotopic $\mathcal{C}$ -Oriented Routing: Label: en
Self-approaching Graphs: Label: en
Upward Planarity Testing via SAT: Label: en
Column-Based Graph Layouts: Label: en
Edge-Weighted Contact Representations of Planar Graphs: Label: en
Proportional Contact Representations of 4-Connected Planar Graphs: Label: en
Touching Triangle Representations for 3-Connected Planar Graphs: Label: en
On Representing Graphs by Touching Cuboids: Label: en
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing: Label: en
Planar and Poly-arc Lombardi Drawings: Label: en
Spine Crossing Minimization in Upward Topological Book Embeddings: Label: en
Approximating the Crossing Number of Apex Graphs: Label: en
Dunnart: A Constraint-Based Network Diagram Authoring Tool: Label: en
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three: Label: en
Subdivision Drawings of Hypergraphs: Label: en
Non-convex Representations of Graphs: Label: en
Isometric Diamond Subgraphs: Label: en
Tree Drawings on the Hexagonal Grid: Label: en
Constrained Point-Set Embeddability of Planar Graphs: Label: en
Cyclic Leveling of Directed Graphs: Label: en
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem: Label: en
Drawing (Complete) Binary Tanglegrams: Label: en
3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces: Label: en
Connected Rectilinear Graphs on Point Sets: Label: en