Complexity dichotomy on partial grid recognition (Q533881): Difference between revisions

@@ Property / author @@
-Vinícius G. Pereira de Sá
@@ Property / author: Vinícius G. Pereira de Sá / rank @@
-Normal rank
@@ Property / author @@
-Raphael C. S. Machado
@@ Property / author: Raphael C. S. Machado / rank @@
-Normal rank
@@ Property / author @@
-Celina M. Herrera de Figueiredo
@@ Property / author: Celina M. Herrera de Figueiredo / rank @@
-Normal rank
@@ Property / author @@
+Vinícius G. Pereira de Sá
@@ Property / author: Vinícius G. Pereira de Sá / rank @@
+Normal rank
@@ Property / author @@
+Raphael C. S. Machado
@@ Property / author: Raphael C. S. Machado / rank @@
+Normal rank
@@ Property / author @@
+Celina M. Herrera de Figueiredo
@@ Property / author: Celina M. Herrera de Figueiredo / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.01.018
+Normal rank
@@ Property / OpenAlex ID @@
+W1983471422
@@ Property / OpenAlex ID: W1983471422 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of minimizing wire lengths in VLSI layouts
+Normal rank
@@ Property / cites work @@
+The total chromatic number of some bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+The realization problem for Euclidean minimum spanning trees is NP-hard
+Normal rank
@@ Property / cites work @@
+The logic engine and the realization problem for nearest neighbor graphs
+Normal rank
@@ Property / cites work @@
+Unit-length embedding of binary trees on a square grid
+Normal rank
@@ Property / cites work @@
+Expansion of layouts of complete binary trees into grids
+Normal rank
@@ Property / cites work @@
+Q3326832
@@ Property / cites work: Q3326832 / rank @@
+Normal rank