Pages that link to "Item:Q4679074"

The following pages link to Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Q4679074):

Displaying 40 items.

• Crossings in grid drawings (Q405129) (← links)
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area (Q452455) (← links)
• Graph layouts via layered separators (Q473100) (← links)
• On the queue-number of graphs with bounded tree-width (Q521397) (← links)
• Acyclically 3-colorable planar graphs (Q695319) (← links)
• Queue layouts of iterated line directed graphs (Q885285) (← links)
• Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
• Volume requirements of 3D upward drawings (Q1011762) (← links)
• Small area drawings of outerplanar graphs (Q1024211) (← links)
• Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
• Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
• Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
• Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
• Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983) (← links)
• Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
• Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
• A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614) (← links)
• Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
• \(k\)-spine, 1-bend planarity (Q2503294) (← links)
• Triangulating Planar Graphs While Keeping the Pathwidth Small (Q2827827) (← links)
• THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
• Topological Graph Layouts into a Triangular Prism (Q2958107) (← links)
• Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
• Track Layout Is Hard (Q2961541) (← links)
• Minimum-Layer Drawings of Trees (Q3078403) (← links)
• On Collinear Sets in Straight-Line Drawings (Q3104785) (← links)
• Drawing Halin-graphs with small height (Q5050008) (← links)
• Cubic Planar Graphs that cannot be Drawn on few Lines (Q5088962) (← links)
• On Layered Fan-Planar Graph Drawings (Q5089175) (← links)
• Improved Bounds for Track Numbers of Planar Graphs (Q5119382) (← links)
• Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) (Q5208867) (← links)
• Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
• A Lower Bound on the Area Requirements of Series-Parallel Graphs (Q5302052) (← links)
• Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
• Drawing Planar Graphs with Reduced Height (Q5892364) (← links)
• Queue layouts of planar 3-trees (Q5918924) (← links)
• 2-colored point-set embeddings of partial 2-trees (Q5919105) (← links)
• 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
• Hamiltonian paths in \(L\)-shaped grid graphs (Q5964021) (← links)
• 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)