Q5111871 (Q5111871): Difference between revisions

@@ Property / cites work @@
+Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
+Normal rank
@@ Property / cites work @@
+Packing non-zero \(A\)-paths in group-labelled graphs
+Normal rank
@@ Property / cites work @@
+Weak duality for packing edge-disjoint odd (<i>u, v</i>)-trails
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+The even-path problem for graphs and digraphs
@@ Property / cites work: The even-path problem for graphs and digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Parameterized Algorithms Using Linear Programming
+Normal rank
@@ Property / cites work @@
+Parameterized Tractability of Multiway Cut with Parity Constraints
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Packing odd paths
@@ Property / cites work: Packing odd paths / rank @@
+Normal rank