Thick non-crossing paths in a polygonal domain (Q2341100): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-014-0776-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2105003074
@@ Property / OpenAlex ID: W2105003074 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum thick paths in static and dynamic environments
+Normal rank
@@ Property / cites work @@
+Routing multi-class traffic flows in the plane
@@ Property / cites work: Routing multi-class traffic flows in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q3043714
@@ Property / cites work: Q3043714 / rank @@
+Normal rank
@@ Property / cites work @@
+k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
+Normal rank
@@ Property / cites work @@
+Q5365044
@@ Property / cites work: Q5365044 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945516
@@ Property / cites work: Q4945516 / rank @@
+Normal rank
@@ Property / cites work @@
+Thick non-crossing paths and minimum-cost flows in polygonal domains
+Normal rank
@@ Property / cites work @@
+Q4246735
@@ Property / cites work: Q4246735 / rank @@
+Normal rank