On the complexity of embedding planar graphs to minimize certain distance measures (Q582079): Difference between revisions

@@ Property / author @@
-Bienstock, Daniel
@@ Property / author: Bienstock, Daniel / rank @@
-Normal rank
@@ Property / author @@
+Bienstock, Daniel
@@ Property / author: Bienstock, Daniel / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Covering Vertices by Faces in a Planar Graph
+Normal rank
@@ Property / cites work @@
+Optimal enclosing regions in planar graphs
@@ Property / cites work: Optimal enclosing regions in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Dividing a Graph into Triconnected Components
@@ Property / cites work: Dividing a Graph into Triconnected Components / rank @@
+Normal rank
@@ Property / cites work @@
+Q4111952
@@ Property / cites work: Q4111952 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:582079