Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169): Difference between revisions

@@ Property / author @@
-Mohammad Taghi Hajiaghayi
@@ Property / author: Mohammad Taghi Hajiaghayi / rank @@
-Normal rank
@@ Property / author @@
+Mohammad Taghi Hajiaghayi
@@ Property / author: Mohammad Taghi Hajiaghayi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4079
@@ Property / arXiv ID: 1207.4079 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation for directed cut problems
@@ Property / cites work: Improved approximation for directed cut problems / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Algorithms for Unique Games and Related Problems
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Multicut is FPT
@@ Property / cites work: Multicut is FPT / rank @@
+Normal rank
@@ Property / cites work @@
+Q2954992
@@ Property / cites work: Q2954992 / rank @@
+Normal rank
@@ Property / cites work @@
+Near-optimal algorithms for maximum constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+The Steiner k-Cut Problem
@@ Property / cites work: The Steiner k-Cut Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An improved parameterized algorithm for the minimum node multiway cut problem
+Normal rank
@@ Property / cites work @@
+Q3549698
@@ Property / cites work: Q3549698 / rank @@
+Normal rank
@@ Property / cites work @@
+Designing FPT Algorithms for Cut Problems Using Randomized Contractions
+Normal rank
@@ 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 @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum bisection is fixed parameter tractable
@@ Property / cites work: Minimum bisection is fixed parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+On group feedback vertex set parameterized by the size of the cutset
+Normal rank
@@ Property / cites work @@
+On Multiway Cut Parameterized above Lower Bounds
@@ Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Subset Feedback Vertex Set Is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum feedback sets and multicuts in directed graphs
+Normal rank
@@ Property / cites work @@
+An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743379
@@ Property / cites work: Q5743379 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Multiway cuts in node weighted graphs
@@ Property / cites work: Multiway cuts in node weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-terminal maximum flows in node-capacitated networks
+Normal rank
@@ Property / cites work @@
+Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
+Normal rank
@@ Property / cites work @@
+FPT algorithms for path-transversal and cycle-transversal problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity and approximability of the longest compatible sequence problem
+Normal rank
@@ Property / cites work @@
+Half-integrality, LP-branching, and FPT Algorithms
+Normal rank
@@ Property / cites work @@
+Minimum cuts in near-linear time
@@ Property / cites work: Minimum cuts in near-linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Rounding algorithms for a geometric embedding of minimum multiway cut
+Normal rank
@@ Property / cites work @@
+The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+On Kernelization and Approximation for the Vector Connectivity Problem
+Normal rank
@@ Property / cites work @@
+Clustering with local restrictions
@@ Property / cites work: Clustering with local restrictions / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Parameterized Algorithms Using Linear Programming
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small separators in linear time via treewidth reduction
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+Q2768268
@@ Property / cites work: Q2768268 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2904774
@@ Property / cites work: Q2904774 / rank @@
+Normal rank
@@ Property / cites work @@
+Directed multicut is <i>W</i>[1]-hard, even for four terminal pairs
+Normal rank
@@ Property / cites work @@
+Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
+Normal rank
@@ Property / cites work @@
+Almost 2-SAT is fixed-parameter tractable
@@ Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+Packing directed circuits fractionally
@@ Property / cites work: Packing directed circuits fractionally / rank @@
+Normal rank
@@ Property / cites work @@
+Half-integrality, LP-branching and FPT Algorithms
@@ Property / cites work: Half-integrality, LP-branching and FPT Algorithms / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2471129545
@@ Property / OpenAlex ID: W2471129545 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3187169