Planarity of streamed graphs (Q2333805): Difference between revisions

@@ Property / cites work @@
+Drawing Non-Planar Graphs with Crossing-Free Subgraphs
+Normal rank
@@ Property / cites work @@
+Advancements on SEFE and partitioned book embedding problems
+Normal rank
@@ Property / cites work @@
+Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
+Normal rank
@@ Property / cites work @@
+Simultaneous embedding: edge orderings, relative positions, cutvertices
+Normal rank
@@ Property / cites work @@
+Drawing trees in a streaming model
@@ Property / cites work: Drawing trees in a streaming model / rank @@
+Normal rank
@@ Property / cites work @@
+Planarity of streamed graphs
@@ Property / cites work: Planarity of streamed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+On-Line Planarity Testing
@@ Property / cites work: On-Line Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Simultaneous Graph Embeddings with Fixed Edges
@@ Property / cites work: Simultaneous Graph Embeddings with Fixed Edges / rank @@
+Normal rank
@@ Property / cites work @@
+Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
+Normal rank
@@ Property / cites work @@
+Recognizing string graphs in NP
@@ Property / cites work: Recognizing string graphs in NP / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+String graphs. II: Recognizing string graphs is NP-hard
+Normal rank
@@ Property / DBLP publication ID @@
+conf/ciac/LozzoR15
@@ Property / DBLP publication ID: conf/ciac/LozzoR15 / rank @@
+Normal rank