Colored cut games (Q2087453): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2022.09.013
+Normal rank
@@ Property / OpenAlex ID @@
+W4296333441
@@ Property / OpenAlex ID: W4296333441 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Logic for Computer Science
@@ Property / cites work: Mathematical Logic for Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+New algorithms for the minimum coloring cut problem
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Q5092393
@@ Property / cites work: Q5092393 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2965980
@@ Property / cites work: Q2965980 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Intersection Theorems for Systems of Sets
@@ Property / cites work: Intersection Theorems for Systems of Sets / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Problem Which Is Complete in Polynomial Space
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of some minimum label problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / 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 @@
+Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
+Normal rank
@@ Property / cites work @@
+Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of some two-person perfect-information games
+Normal rank
@@ Property / cites work @@
+Edge-colored graphs with applications to homogeneous faults
+Normal rank
@@ Property / cites work @@
+Matching interdiction
@@ Property / cites work: Matching interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+The label cut problem with respect to path length and label frequency
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2087453