On the parameterized complexity of computing balanced partitions in graphs (Q493645): Difference between revisions

@@ Property / DOI @@
-.1007/s00224-014-9557-5
@@ Property / DOI: 10.1007/s00224-014-9557-5 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2032278054
@@ Property / OpenAlex ID: W2032278054 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7014
@@ Property / arXiv ID: 1312.7014 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced graph partitioning
@@ Property / cites work: Balanced graph partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+A scalable multi-level preconditioner for matrix-free µ-finite element analysis of human bone structures
+Normal rank
@@ Property / cites work @@
+A framework for solving VLSI graph layout problems
+Normal rank
@@ Property / cites work @@
+Kernelization: New Upper and Lower Bound Techniques
+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 @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Bisection is Hard, too
@@ Property / cites work: Vertex Bisection is Hard, too / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning Planar Graphs
@@ Property / cites work: Partitioning Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The treewidth and pathwidth of hypercubes
@@ Property / cites work: The treewidth and pathwidth of hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / 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 @@
+Exact Combinatorial Branch-and-Bound for Graph Bisection
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+What Makes Equitable Connected Partition Easy
@@ Property / cites work: What Makes Equitable Connected Partition Easy / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448752
@@ Property / cites work: Q4448752 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast balanced partitioning is hard even on grids and trees
+Normal rank
@@ Property / cites work @@
+Q2904753
@@ Property / cites work: Q2904753 / rank @@
+Normal rank
@@ Property / cites work @@
+An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
+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 @@
+Q5417642
@@ Property / cites work: Q5417642 / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing with fixed number of bins revisited
@@ Property / cites work: Bin packing with fixed number of bins revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414505
@@ Property / cites work: Q4414505 / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small separators in linear time via treewidth reduction
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3033325
@@ Property / cites work: Q3033325 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity of Computing Graph Bisections
+Normal rank
@@ Property / cites work @@
+Q3361907
@@ Property / cites work: Q3361907 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00224-014-9557-5
@@ Property / DOI: 10.1007/S00224-014-9557-5 / rank @@
+Normal rank