Untangling polygons and graphs (Q848672): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00454-009-9150-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2014466831
@@ Property / OpenAlex ID: W2014466831 / rank @@
+Normal rank
@@ Property / cites work @@
+Trees in Polyhedral Graphs
@@ Property / cites work: Trees in Polyhedral Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial bound for untangling geometric planar graphs
+Normal rank
@@ Property / cites work @@
+Q5786239
@@ Property / cites work: Q5786239 / rank @@
+Normal rank
@@ Property / cites work @@
+Untangling a planar graph
@@ Property / cites work: Untangling a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Untangling planar graphs from a specified vertex position-Hard cases
+Normal rank
@@ Property / cites work @@
+Untangling a polygon
@@ Property / cites work: Untangling a polygon / rank @@
+Normal rank
@@ Property / cites work @@
+On Collinear Sets in Straight-Line Drawings
@@ Property / cites work: On Collinear Sets in Straight-Line Drawings / rank @@
+Normal rank
@@ Property / cites work @@
+Convex Maps
@@ Property / cites work: Convex Maps / rank @@
+Normal rank
@@ Property / cites work @@
+On the obfuscation complexity of planar graphs
@@ Property / cites work: On the obfuscation complexity of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bemerkungen zum Vierfarbenproblem
@@ Property / cites work: Bemerkungen zum Vierfarbenproblem / rank @@
+Normal rank