scientific article; zbMATH DE number 3315017

Cited in

(85)

Bijective counting of plane bipolar orientations and Schnyder woods
Visibility representation of plane graphs via canonical ordering tree
A linear algorithm for embedding planar graphs using PQ-trees
A unified approach to visibility representations of planar graphs
Rectilinear planar layouts and bipolar orientations of planar graphs
Finding small simple cycle separators for 2-connected planar graphs
A very personal reminiscence on the problem of computational complexity
Parallel ear decomposition search (EDS) and st-numbering in graphs
Graph graphics: Theory and practice
The multi-tree approach to reliability in distributed networks
An efficient parallel algorithm for planarity
st-ordering the vertices of biconnected graphs
On the thickness of graphs of given degree
Area requirement and symmetry display of planar upward drawings
Constructing compact rectilinear planar layouts using canonical representation of planar graphs
Computing an st-numbering
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Finding the closed partition of a planar graph
At most single-bend embeddings of cubic graphs
Planarity testing in parallel
A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
A better heuristic for orthogonal graph drawings
PC trees and circular-ones arrangements.
Reconstruction graphs and testing their properties in a relational spatial database
The minimum size of graphs satisfying cut conditions
Every plane graph is facially-non-repetitively $C$-choosable
Balanced vertex-orderings of graphs
The topology of the coloring complex
Exploring the tiers of rooted phylogenetic network space using tail moves
Bipolar orientations revisited
The complexity of planarity testing
Drawing graphs on rectangular grids
Gap strings and spanning forests for bridge graphs of biconnected graphs
Enumerating the edge-colourings and total colourings of a regular graph
A new planarity test
Orthogonal drawings of graphs for the automation of VLSI circuit design
A diameter-revealing proof of the Bondy-Lovász lemma
Almost envy-free allocations with connected bundles
Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
The minimum number of spanning trees in regular multigraphs
Criterion for a graph to admit a good orientation in terms of leaf blocks
Approximation algorithms for the maximum bounded connected bipartition problem
Counting phylogenetic networks of level 1 and 2
NP-completeness of st-orientations for plane graphs
Electrical networks and hyperplane arrangements
Bipolar orientations on planar maps and $\mathrm{SLE}_{12}$
A graphical calculus for semi-groupal categories
Property testing of planarity in the \textsf{CONGEST} model
Bijective counting of plane bipolar orientations
On Representation of Planar Graphs by Segments
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
On finding directed trees with many leaves
A direct linear-time planarity test for unflippable modules
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
Compact visibility representation of 4-connected plane graphs
Certifying algorithms
Researches of semigroups with planar Cayley graphs: results and problems
Almost envy-free allocations with connected bundles
A dichotomy result for cyclic-order traversing games
Orthogonal drawing of high degree graphs with small area and few bends
Planarity algorithms via PQ-trees (extended abstract)
A generalized greedy routing algorithm for 2-connected graphs
Good acyclic orientations of 4‐regular 4‐connected graphs
Planarity for clustered graphs
$st$-orientations with few transitive edges
$st$-Orientations with Few Transitive Edges
Output-sensitive reporting of disjoint paths (extended abstract)
An annotated review on graph drawing and its applications
On the construction of planar embedding for a class of orthogonal polyhedra
Visibility representations of toroidal and Klein-bottle graphs
O(n2) algorithms for graph planarization
A linear time algorithm for finding maximal planar subgraphs
Weakly leveled planarity with bounded span
Dynamic reachability in planar digraphs with one source and one sink
Planarity via spanning tree number: a linear-algebraic criterion
Improved visibility representation of plane graphs
Closed rectangle-of-influence drawings for irreducible triangulations
On the parameterized complexity of computing st-orientations with few transitive edges
Upward and rectilinear planarity are W[1]-hard parameterized by treewidth
Approximating proportional and maximin allocations on d-claw-free graphs
Arc-weighted acyclic orientation of graphs
Dynamic maintenance of planar digraphs, with applications
Bipartite graphs, upward drawings, and planarity
Algorithms for computing a parameterized $st$-orientation
Upward drawings of triconnected digraphs.

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 Q5596083)