scientific article; zbMATH DE number 432759
From MaRDI portal
Publication:3138887
Recommendations
Cited in
(only showing first 100 items - show all)- Intervals in Catalan lattices and realizers of triangulations
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Open rectangle-of-influence drawings of inner triangulated plane graphs
- Small area drawings of outerplanar graphs
- Upward straight-line embeddings of directed graphs into point sets
- Visibility representation of plane graphs via canonical ordering tree
- Some provably hard crossing number problems
- Planar orientations with low out-degree and compaction of adjacency matrices
- Area requirement and symmetry display of planar upward drawings
- Drawing the planar dual
- A note on optimal area algorithms for upward drawings of binary trees
- Minimum-width grid drawings of plane graphs
- Classes and recognition of curve contact graphs
- Advances in the theory and practice of graph drawing
- Arboricity and bipartite subgraph listing algorithms
- Grid embedding of 4-connected plane graphs
- Triangulating planar graphs while minimizing the maximum degree
- Efficient computation of implicit representations of sparse graphs
- New results on drawing angle graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Rectangular grid drawings of plane graphs
- Orthogonal drawings based on the stratification of planar graphs
- Drawing plane triangulations with few segments
- Bottleneck bichromatic full Steiner trees
- Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods
- New results on edge partitions of 1-plane graphs
- The complexity of drawing a graph in a polygonal region
- Geometric versions of the three-dimensional assignment problem under general norms
- Planar minimally rigid graphs and pseudo-triangulations
- A result on k-valent graphs and its application to a graph embedding problem
- Incremental convex planarity testing
- Planarity-preserving clustering and embedding for large planar graphs
- Decidability of string graphs
- Drawing planar graphs using the canonical ordering
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
- Crossing number for graphs with bounded pathwidth
- Small universal point sets for \(k\)-outerplanar graphs
- Faster approximate diameter and distance oracles in planar graphs
- On the area requirements of planar greedy drawings of triconnected planar graphs
- Navigating planar topologies in near-optimal space and time
- Embedding grid graphs on surfaces
- Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography
- The space complexity of sum labelling
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs
- One-bend drawings of outerplanar graphs inside simple polygons
- Limitations on realistic hyperbolic graph drawing
- On chordal and perfect plane near-triangulations
- On graphs whose eternal vertex cover number and vertex cover number coincide
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- The geometry and combinatorics of discrete line segment hypergraphs
- Tree drawings revisited
- A local characterization for perfect plane near-triangulations
- Representing graphs and hypergraphs by touching polygons in 3D
- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators
- On the edge-length ratio of planar graphs
- A note on universal point sets for planar graphs
- 4-connected triangulations on few lines
- Drawing planar graphs with few segments on a polynomial grid
- Homotopy height, grid-major height and graph-drawing height
- Counting polygon triangulations is hard
- Grid drawings of graphs with constant edge-vertex resolution
- Universal point sets for planar three-trees
- On embedding a graph in the grid with the maximum number of bends and other bad features
- Every Schnyder drawing is a greedy embedding
- Optimal two-sided embeddings of complete binary trees in rectangular grids
- On a class of covering problems with variable capacities in wireless networks
- Free edge lengths in plane graphs
- Counting coloured planar maps: differential equations
- Planar polyline drawings via graph transformations
- Area requirement of graph drawings with few crossings per edge
- Orthogeodesic point-set embedding of trees
- Grid representations and the chromatic number
- Euclidean greedy drawings of trees
- Succinct representation of labeled graphs
- Schnyder decompositions for regular plane graphs and application to drawing
- Bijections for Baxter families and related objects
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- On local transformations in plane geometric graphs embedded on small grids
- Matching edges and faces in polygonal partitions
- Triangulations without pointed spanning trees
- Planar graphs, via well-orderly maps and trees
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Grid obstacle representation of graphs
- Succinct encoding of binary strings representing triangulations
- Rectangular spiral galaxies are still hard
- Parameterized study of Steiner tree on unit disk graphs
- Sampling and counting 3-orientations of planar triangulations
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- Triangulating planar graphs while keeping the pathwidth small
- Communicability angle and the spatial efficiency of networks
- Outer 1-planar graphs
- Lower and upper bounds for long induced paths in 3-connected planar graphs
- Non-aligned drawings of planar graphs
- Snapping graph drawings to the grid optimally
- Drawing Graphs on Few Lines and Few Planes
- Separation dimension of graphs and hypergraphs
- Simultaneous visibility representations of plane st-graphs using L-shapes
- An effective crossing minimisation heuristic based on star insertion
- A linear-time algorithm for drawing a planar graph on an (n-2) (n-2) grid.
- On point-sets that support 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)
