scientific article; zbMATH DE number 7765366
From MaRDI portal
Publication:6065397
DOI10.4230/LIPICS.ISAAC.2020.8MaRDI QIDQ6065397FDOQ6065397
Authors: Guido Brückner, Ignaz Rutter 
Publication date: 14 November 2023
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Dividing a Graph into Triconnected Components
- On the complexity of embedding planar graphs to minimize certain distance measures
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
- Hierarchies and planarity theory
- Level Planar Embedding in Linear Time
- On-line maintenance of triconnected components with SPQR-trees
- Title not available (Why is that?)
- Testing Planarity of Partially Embedded Graphs
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- Inserting an edge into a planar graph
- Inserting a vertex into a planar graph
- A structural characterization of planar combinatorial graphs
- A satisfiability formulation of problems on level graphs
- Partial and Constrained Level Planarity
- Optimal orthogonal graph drawing with convex bend costs
- Inserting multiple edges into a planar graph
- Hanani-Tutte and monotone drawings
- An SPQR-tree-like embedding representation for upward planarity
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
- Simultaneous orthogonal planarity
- Testing mutual duality of planar graphs
Cited In (1)
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 Q6065397)
