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 #1 to #50.

Graph Drawing Contest Report: Label: en
Drawing Graphs with GLEE: Label: en
Treemaps for Directed Acyclic Graphs: Label: en
Visualizing Internet Evolution on the Autonomous Systems Level: Label: en
LunarVis – Analytic Visualizations of Large Graphs: Label: en
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices: Label: en
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs: Label: en
Colorability in Orthogonal Graph Drawing: Label: en
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge: Label: en
Clustered Planarity: Small Clusters in Eulerian Graphs: Label: en
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces: Label: en
Simultaneous Geometric Graph Embeddings: Label: en
Constrained Simultaneous and Near-Simultaneous Embeddings: Label: en
Multi-circular Layout of Micro/Macro Graphs: Label: en
Algorithms for Multi-criteria One-Sided Boundary Labeling: Label: en
Line Crossing Minimization on Metro Maps: Label: en
Constrained Stress Majorization Using Diagonally Scaled Gradient Projection: Label: en
On Planar Polyline Drawings: Label: en
Minimizing the Area for Planar Straight-Line Grid Drawings: Label: en
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs: Label: en
Matched Drawings of Planar Graphs: Label: en
Cover Contact Graphs: Label: en
Efficient Extraction of Multiple Kuratowski Subdivisions: Label: en
The Complexity of Several Realizability Problems for Abstract Topological Graphs: Label: en
Representation of Planar Hypergraphs by Contacts of Triangles: Label: en
Point-Set Embedding of Trees with Edge Constraints: Label: en
Moving Vertices to Make Drawings Plane: Label: en
Polynomial Area Bounds for MST Embeddings of Trees: Label: en
Straight-Line Orthogonal Drawings of Binary and Ternary Trees: Label: en
Minimum Level Nonplanar Patterns for Trees: Label: en
Practical Level Planarity Testing and Layout with Embedding Constraints: Label: en
Cyclic Level Planarity Testing and Embedding: Label: en
Characterization of Unlabeled Level Planar Graphs: Label: en
Crossing Numbers and Parameterized Complexity: Label: en
Improvement on the Decay of Crossing Numbers: Label: en
A Bipartite Strengthening of the Crossing Lemma: Label: en
Crossing Number of Graphs with Rotation Systems: Label: en
Planar Graphs as VPG-Graphs: Label: en
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants: Label: en
Smooth Orthogonal Layouts: Label: en
Circle-Representations of Simple 4-Regular Planar Graphs: Label: en
Planar Lombardi Drawings for Subcubic Graphs: Label: en
The Approximate Rectangle of Influence Drawability Problem: Label: en
Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs: Label: en
Shrinking the Search Space for Clustered Planarity: Label: en
Implementing a Partitioned 2-Page Book Embedding Testing Algorithm: Label: en
Progress on Partial Edge Drawings: Label: en
Graph Drawing by Classical Multidimensional Scaling: New Perspectives: Label: en
Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage: Label: en
Disconnectivity and Relative Positions in Simultaneous Embeddings: Label: en