Parameterized complexity of multi-node hubs (Q2084737): Difference between revisions

@@ Property / cites work @@
+Q4263699
@@ Property / cites work: Q4263699 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
+Normal rank
@@ Property / cites work @@
+Maximum balanced subgraph problem parameterized above lower bound
+Normal rank
@@ Property / cites work @@
+\textsc{Max-Cut} parameterized above the Edwards-Erdős bound
+Normal rank
@@ Property / cites work @@
+Deterministic Parameterized Connected Vertex Cover
+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 @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Vertex and edge covers with clustering properties: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected maximum cut and related problems
+Normal rank
@@ Property / cites work @@
+Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
+Normal rank
@@ Property / cites work @@
+Authoritative sources in a hyperlinked environment
+Normal rank
@@ Property / cites work @@
+A new algorithm for finding trees with many leaves
+Normal rank
@@ Property / cites work @@
+Max-Cut Under Graph Constraints
@@ Property / cites work: Max-Cut Under Graph Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing CMSO model checking to highly connected graphs
+Normal rank
@@ Property / cites work @@
+Balanced Judicious Bipartition is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG
+Normal rank
@@ Property / cites work @@
+$$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $${\mathcal O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for graph partitioning problems
+Normal rank