How to Navigate Through Obstacles (Q5002723): Difference between revisions

@@ label / en / label / en @@
+How to Navigate Through Obstacles
@@ Property / author @@
+Iyad A. Kanj
@@ Property / author: Iyad A. Kanj / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04043
@@ Property / arXiv ID: 1712.04043 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Cell Connection in Line Segment Arrangements
+Normal rank
@@ Property / cites work @@
+Q4952637
@@ Property / cites work: Q4952637 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of barrier resilience for fat regions and bounded ply
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963430450
@@ Property / OpenAlex ID: W2963430450 / rank @@
+Normal rank
@@ Property / title @@
+How to Navigate Through Obstacles (English)
@@ Property / title: How to Navigate Through Obstacles (English) / rank @@
+Normal rank