Milling a Graph with Turn Costs: A Parameterized Complexity Perspective (Q3057619): Difference between revisions

@@ Property / author @@
-S. H. Whitesides
@@ Property / author: S. H. Whitesides / rank @@
-Normal rank
@@ Property / author @@
+S. H. Whitesides
@@ Property / author: S. H. Whitesides / 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.1007/978-3-642-16926-7_13
+Normal rank
@@ Property / OpenAlex ID @@
+W1961736623
@@ Property / OpenAlex ID: W1961736623 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Covering Tours with Turn Costs
@@ Property / cites work: Optimal Covering Tours with Turn Costs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Colorful Problems Parameterized by Treewidth
+Normal rank
@@ Property / cites work @@
+On the computational geometry of pocket machining
@@ Property / cites work: On the computational geometry of pocket machining / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank