scientific article; zbMATH DE number 432759
From MaRDI portal
Publication:3138887
Recommendations
- How to draw a planar graph on a grid
- A linear-time algorithm for drawing a planar graph on a grid
- A linear-time algorithm for drawing a planar graph on an \((n-2)\times (n-2)\) grid.
- Grid embedding of 4-connected plane graphs
- Compact visibility representation and straight-line grid embedding of plane graphs.
Cited in
(only showing first 100 items - show all)- On graphs whose eternal vertex cover number and vertex cover number coincide
- Tree drawings revisited
- A simple routing algorithm based on Schnyder coordinates
- Some provably hard crossing number problems
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Crossing number for graphs with bounded pathwidth
- The efficient recognition on net-extensibility of graphs
- The complexity of drawing a graph in a polygonal region
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- A Note on Universal Point Sets for Planar Graphs
- An Algorithm to Construct Greedy Drawings of Triangulations
- Bijections for Baxter families and related objects
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- Planar 3-SAT with a clause/variable cycle
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- scientific article; zbMATH DE number 4128415 (Why is no real title available?)
- Large angle crossing drawings of planar graphs in subquadratic area
- Acyclic coloring with few division vertices
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- A compact encoding of plane triangulations with efficient query supports
- On the Number of α-Orientations
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
- Improved bounds for drawing trees on fixed points with L-shaped edges
- Unified bijections for maps with prescribed degrees and girth
- Morphing Contact Representations of Graphs
- Robust self-assembly of graphs
- Small grid drawings of planar graphs with balanced partition
- Competitive routing in the half-\(\theta_6\)-graph
- Schnyder woods, \(\mathrm{SLE}_{16}\), and Liouville quantum gravity
- Output-sensitive reporting of disjoint paths (extended abstract)
- On the enumeration of plane bipolar posets and transversal structures
- Upward straight-line embeddings of directed graphs into point sets
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- On Planar Polyline Drawings
- Universal point sets for planar three-trees
- Faster approximate diameter and distance oracles in planar graphs
- Monotone drawings of 3-connected plane graphs
- 4-labelings and grid embeddings of plane quadrangulations
- \((t, s)\)-completely independent spanning trees
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Upward planar morphs
- On simultaneous straight-line grid embedding of a planar graph and its dual
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Grid embedding of 4-connected plane graphs
- Minimum-width grid drawings of plane graphs
- Morphing planar graph drawings with bent edges
- On a class of covering problems with variable capacities in wireless networks
- An annotated review on graph drawing and its applications
- Drawing plane triangulations with few segments
- Edge partitions of optimal 2-plane and 3-plane graphs
- Upward planar morphs
- Triangulating planar graphs while minimizing the maximum degree
- Improved floor-planning of graphs via adjacency-preserving transformations
- Point-set embeddings of plane 3-trees
- Orthogeodesic point-set embedding of trees
- Quasi-planar Graphs
- scientific article; zbMATH DE number 7559402 (Why is no real title available?)
- Non-aligned drawings of planar graphs
- Snapping graph drawings to the grid optimally
- Planar orientations with low out-degree and compaction of adjacency matrices
- Bottleneck bichromatic full Steiner trees
- Vertex-edge marking score of certain triangular lattices
- Orthogonal drawings based on the stratification of planar graphs
- Outer 1-planar graphs
- Small point sets for simply-nested planar graphs
- Lower and upper bounds for long induced paths in 3-connected planar graphs
- A local characterization for perfect plane near-triangulations
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Planar minimally rigid graphs and pseudo-triangulations
- On local transformations in plane geometric graphs embedded on small grids
- Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth
- Separation dimension of graphs and hypergraphs
- Representation of Planar Hypergraphs by Contacts of Triangles
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- New results on drawing angle graphs
- Small universal point sets for \(k\)-outerplanar graphs
- Greedy drawings of triangulations
- Free edge lengths in plane graphs
- Characterizing planar tanglegram layouts and applications to edge insertion problems
- Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography
- How to draw a series-parallel digraph
- Straight-line drawings of 1-planar graphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Intervals in Catalan lattices and realizers of triangulations
- Edge Partitions and Visibility Representations of 1-planar Graphs
- Simultaneous visibility representations of plane st-graphs using L-shapes
- Efficient computation of implicit representations of sparse graphs
- Rectangular grid drawings of plane graphs
- A linear-time algorithm for drawing a planar graph on a grid
- Drawing planar graphs on \(\frac{8}{9}n^2\) area
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- Triangulating planar graphs while keeping the pathwidth small
- The space complexity of sum labelling
- Orienting edges to fight fire in graphs
- Computational Science and Its Applications – ICCSA 2004
- Pointed drawings of planar graphs
- Sequentially embeddable graphs
- Green's theorem and isolation in planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138887)
