The following pages link to (Q3154374):
Displaying 50 items.
- Circular right-angle crossing drawings in linear time (Q301590) (← links)
- On some properties of doughnut graphs (Q334123) (← links)
- The topological drawing of a graph: construction methods (Q386927) (← links)
- Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Pointed drawings of planar graphs (Q452448) (← links)
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Small grid drawings of planar graphs with balanced partition (Q695321) (← links)
- Drawing graphs with right angle crossings (Q719252) (← links)
- Planar bus graphs (Q724233) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- Good spanning trees in graph drawing (Q897943) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Matched drawability of graph pairs and of graph triples (Q982951) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← links)
- Open rectangle-of-influence drawings of inner triangulated plane graphs (Q1016532) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142) (← links)
- On triangle cover contact graphs (Q1702259) (← links)
- Realizability of graphs as triangle cover contact graphs (Q1704579) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- Construction of a topological drawing of the most planar subgraph of the non-planar graph (Q1792535) (← links)
- Acyclic colorings of graph subdivisions revisited (Q1932357) (← links)
- LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs (Q2009630) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Force-directed layout of order diagrams using dimensional reduction (Q2117137) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- On orthogonally convex drawings of plane graphs (Q2360858) (← links)
- Minimum-segment convex drawings of 3-connected cubic plane graphs (Q2377378) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Realizability of Graphs as Triangle Cover Contact Graphs (Q2958333) (← links)
- Minimum-Layer Drawings of Trees (Q3078403) (← links)
- Consecutive Ones Property Testing: Cut or Swap (Q3091461) (← links)
- AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT (Q3173946) (← links)
- Drawing Graphs with Right Angle Crossings (Q3183456) (← links)
- Generating All Triangulations of Plane Graphs (Extended Abstract) (Q3605494) (← links)
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) (Q3605507) (← links)
- Matched Drawability of Graph Pairs and of Graph Triples (Q3605508) (← links)
