On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663): Difference between revisions

@@ 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 @@
+Finding the most vital arcs in a network
@@ Property / cites work: Finding the most vital arcs in a network / rank @@
+Normal rank
@@ Property / cites work @@
+A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
+Normal rank
@@ Property / cites work @@
+Q4734761
@@ Property / cites work: Q4734761 / rank @@
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
+Normal rank
@@ Property / cites work @@
+Parametrized Complexity of Length-Bounded Cuts and Multi-cuts
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+Normal rank
@@ Property / cites work @@
+Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems
+Normal rank
@@ Property / cites work @@
+Paths of bounded length and their cuts: parameterized complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+On short paths interdiction problems: Total and node-wise limited interdiction
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Extended formulation for CSP that is compact for instances of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Improved Hardness for Cut, Interdiction, and Firefighter Problems
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Q5365080
@@ Property / cites work: Q5365080 / rank @@
+Normal rank
@@ Property / cites work @@
+Mengerian theorems for paths of bounded length
@@ Property / cites work: Mengerian theorems for paths of bounded length / rank @@
+Normal rank
@@ Property / cites work @@
+Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected single-source shortest paths with positive integer weights in linear time
+Normal rank