Sequence Hypergraphs: Paths, Flows, and Cuts (Q6163626): Difference between revisions

@@ Property / cites work @@
+Q4448373
@@ Property / cites work: Q4448373 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Listing st-Paths in Public Transportation Networks
+Normal rank
@@ Property / cites work @@
+Q4659605
@@ Property / cites work: Q4659605 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952637
@@ Property / cites work: Q4952637 / rank @@
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+Intersecting Sperner families and their convex hulls
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Some Minimum Label Problems
+Normal rank
@@ Property / cites work @@
+Directed hypergraphs and applications
@@ Property / cites work: Directed hypergraphs and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Paths with Bundles and Non-additive Weights Is Hard
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for labeled connectivity problems
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+On the minimum label spanning tree problem
@@ Property / cites work: On the minimum label spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and hardness results for label cut and related problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6163626