Parameterized complexity of length-bounded cuts and multicuts (Q1799212): Difference between revisions

@@ Property / arXiv ID @@
+.02801
@@ Property / arXiv ID: 1511.02801 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628150
@@ Property / cites work: Q5628150 / rank @@
+Normal rank
@@ Property / cites work @@
+Length-bounded cuts and flows
@@ Property / cites work: Length-bounded cuts and flows / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the directed hop-constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+Capacitated Domination and Covering: A Parameterized Perspective
+Normal rank
@@ Property / cites work @@
+Parametrized Complexity of Length-Bounded Cuts and Multi-cuts
+Normal rank
@@ Property / cites work @@
+Q4598161
@@ Property / cites work: Q4598161 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity landscape of decompositional parameters for ILP
+Normal rank
@@ Property / cites work @@
+Paths of bounded length and their cuts: parameterized complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Structural Parameterizations of the Mixed Chinese Postman Problem
+Normal rank
@@ Property / cites work @@
+The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
+Normal rank
@@ Property / cites work @@
+The complexity of finding maximum disjoint paths with length constraints
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Max flows in O(nm) time, or better
@@ Property / cites work: Max flows in O(nm) time, or better / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Boolean Matrices
@@ Property / cites work: A Theorem on Boolean Matrices / rank @@
+Normal rank