Pages that link to "Item:Q1085168"

The following pages link to Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168):

Displaying 48 items.

• Determining bar-representability for ordered weighted graphs (Q1917046) (← links)
• Drawing planar graphs using the canonical ordering (Q1920418) (← links)
• Special graph representation and visualization of semantic networks (Q1930194) (← links)
• A center transversal theorem for hyperplanes and applications to graph drawing (Q1942307) (← links)
• Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
• Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
• Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
• 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
• Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
• On the number of upward planar orientations of maximal planar graphs (Q2250457) (← links)
• NP-completeness of st-orientations for plane graphs (Q2268858) (← links)
• On 3D visibility representations of graphs with few crossings per edge (Q2317866) (← links)
• An annotated bibliography on 1-planarity (Q2407041) (← links)
• Skyscraper polytopes and realizations of plane triangulations (Q2407381) (← links)
• Connectivity graphs of uncertainty regions (Q2408099) (← links)
• Bijections for Baxter families and related objects (Q2431261) (← links)
• An experimental comparison of four graph drawing algorithms. (Q2482890) (← links)
• Linear layout of directed grid graph (Q2516509) (← links)
• The three-phase method: a unified approach to orthogonal graph drawing (Q2708038) (← links)
• Drawing directed acyclic graphs: an experimental study (Q2708043) (← links)
• Space-Efficient Planar Acyclicity Constraints (Q2798264) (← links)
• Simultaneous Visibility Representations of Plane st-graphs Using L-shapes (Q2827815) (← links)
• Algorithms for Drawing Planar p-petal Graphs (Q2831832) (← links)
• 1-Bend Upward Planar Drawings of SP-Digraphs (Q2961509) (← links)
• On Representation of Planar Graphs by Segments (Q3511438) (← links)
• Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights (Q3611838) (← links)
• Three Results on Frequency Assignment in Linear Cellular Networks (Q3638448) (← links)
• (Q3786507) (← links)
• On Triangle Contact Graphs (Q4305318) (← links)
• 3D Visibility Representations of 1-planar Graphs (Q4625104) (← links)
• Experimental studies on graph drawing algorithms (Q4789076) (← links)
• Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) (← links)
• On triangulating planar graphs under the four-connectivity constraint (Q5056168) (← links)
• A dichotomy result for cyclic-order traversing games (Q5091020) (← links)
• Star Partitions of Perfect Graphs (Q5167740) (← links)
• On the net-embeddability of graphs (Q5288744) (← links)
• Width-Optimal Visibility Representations of Plane Graphs (Q5387754) (← links)
• Representation of Planar Hypergraphs by Contacts of Triangles (Q5452217) (← links)
• AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING (Q5493898) (← links)
• On Aligned Bar 1-Visibility Graphs (Q5890623) (← links)
• Upward planar morphs (Q5918180) (← links)
• The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)
• Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario (Q6053469) (← links)
• Good acyclic orientations of 4‐regular 4‐connected graphs (Q6081883) (← links)
• \(st\)-orientations with few transitive edges (Q6117048) (← links)
• $st$-Orientations with Few Transitive Edges (Q6141787) (← links)
• A more compact visibility representation (Q6143992) (← links)
• Testing the planar straight-line realizability of 2-trees with prescribed edge lengths (Q6563990) (← links)