Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons (Q3104772): Difference between revisions

@@ Property / author @@
-Peter Widmayer
@@ Property / author: Peter Widmayer / rank @@
-Normal rank
@@ Property / author @@
+Peter Widmayer
@@ Property / author: Peter Widmayer / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1866667937
@@ Property / OpenAlex ID: W1866667937 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel approximation schemes for problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
+Normal rank
@@ Property / cites work @@
+Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel algorithm for bisection width in trees
@@ Property / cites work: A parallel algorithm for bisection width in trees / rank @@
+Normal rank
@@ Property / cites work @@
+The bisection width of grid graphs
@@ Property / cites work: The bisection width of grid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3104772