Planar L-Drawings of Bimodal Graphs (Q5014118): Difference between revisions

@@ Property / OpenAlex ID @@
+W3134372918
@@ Property / OpenAlex ID: W3134372918 / rank @@
+Normal rank
@@ Property / cites work @@
+Two algorithms for finding rectangular duals of planar graphs
+Normal rank
@@ Property / cites work @@
+Algorithms and Bounds for L-Drawings of Directed Graphs
+Normal rank
@@ Property / cites work @@
+Computing k-modal embeddings of planar digraphs
@@ Property / cites work: Computing k-modal embeddings of planar digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
+Normal rank
@@ Property / cites work @@
+Planar L-Drawings of Directed Graphs
@@ Property / cites work: Planar L-Drawings of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Triangle Contact Graphs
@@ Property / cites work: On Triangle Contact Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4422257
@@ Property / cites work: Q4422257 / rank @@
+Normal rank
@@ Property / cites work @@
+Rectangular duals of planar graphs
@@ Property / cites work: Rectangular duals of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Embedding a Graph in the Grid with the Minimum Number of Bends
+Normal rank
@@ Property / cites work @@
+A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
+Normal rank
@@ Property / cites work @@
+A linear algorithm to find a rectangular dual of a planar triangulated graph
+Normal rank
@@ Property / cites work @@
+The (3,1)-ordering for 4-connected planar triangulations
+Normal rank
@@ Property / cites work @@
+Upward and quasi-upward planarity testing of embedded mixed graphs
+Normal rank
@@ Property / cites work @@
+On Finding the Rectangular Duals of Planar Triangular Graphs
+Normal rank