Fetching the paper…
Reading the bibliography…
A balanced partition is a clustering of a graph into a given number of equal-sized parts.
Some simplified NP-complete graph problems
M. R. Garey, D. S. Johnson, and L. J. Stockmeyer · 1976
Earlier work this paper cites.
On Partitioning a Graph: a Theoretical and Empirical Study
R. M. MacGregor · 1978
Earlier work this paper cites.
Computers and Intractability: A Guide to the Theory of NP-Completeness
M. R. Garey and D. S. Johnson · 1979
Earlier work this paper cites.
Applications of a planar separator theorem
R. J. Lipton and R. E. Tarjan · 1980
Earlier work this paper cites.
A framework for solving VLSI graph layout problems
S. N. Bhatt and F. T. Leighton · 1984
Earlier work this paper cites.
Graph bisection algorithms with good average case behavior
T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sipser · 1987
Earlier work this paper cites.
Fibonacci heaps and their uses in improved network optimization algorithms
M. Fredman and R. Tarjan · 1987
Earlier work this paper cites.
On the bisection width of partial k k -trees
K. Soumyanath and J. S. Deogun · 1990
Earlier work this paper cites.
The k k -section of treewidth restricted graphs
M. Wiegers · 1990
Earlier work this paper cites.
Partitioning planar graphs
T. N. Bui and A. Peck · 1992
Earlier work this paper cites.
Treewidth – Computations and Approximations , volume 842 of LNCS
T. Kloks · 1994
Earlier work this paper cites.
A parallel algorithm for multilevel graph partitioning and sparse matrix ordering
G. Karypis and V. Kumar · 1998
Earlier work this paper cites.
Upper bounds to the clique width of graphs
B. Courcelle and S. Olariu · 2000
Earlier work this paper cites.
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
W. Espelage, F. Gurski, and E. Wanke · 2001
Earlier work this paper cites.
New algorithms for k k -face cover, k k -feedback vertex set, and k k -disjoint cycles on plane and planar graphs
T. Kloks, C. M. Lee, and J. Liu · 2002
Earlier work this paper cites.
Graphcut textures: Image and video synthesis using graph cuts
V. Kwatra, A. Schödl, I. Essa, G. Turk, and A. Bobick · 2003
Earlier work this paper cites.
The Unique Games Conjecture, integrality gap for cut problems and embeddability of negative type metrics into ℓ 1 \ell_{1}
S. A. Khot and N. K. Vishnoi · 2005
Earlier work this paper cites.
Balanced graph partitioning
K. Andreev and H. Räcke · 2006
Earlier work this paper cites.
The treewidth and pathwidth of hypercubes
L. S. Chandran and T. Kavitha · 2006
Cited alongside, same era.
Parameterized Complexity Theory
J. Flum and M. Grohe · 2006
Cited alongside, same era.
Parameterized graph separation problems
D. Marx · 2006
Cited alongside, same era.
Invitation to Fixed-Parameter Algorithms
R. Niedermeier · 2006
Cited alongside, same era.
Multi-level μ \mu -finite element analysis for human bone structures
P. Arbenz, G. van Lenthe, U. Mennel, R. Müller, and M. Sala · 2007
Cited alongside, same era.
Invitation to data reduction and problem kernelization
J. Guo and R. Niedermeier · 2007
Cited alongside, same era.
Width parameters beyond tree-width and their applications
Customizable route planning
D. Delling, A. V. Goldberg, T. Pajor, and R. F. F. Werneck · 2011
Later among the works it cites.
An O ( n 4 ) O(n^{4}) time algorithm to compute the bisection width of solid grid graphs
A. E. Feldmann and P. Widmayer · 2011
Later among the works it cites.
Exact combinatorial branch-and-bound for graph bisection
D. Delling, A. V. Goldberg, I. Razenshteyn, and R. F. F. Werneck · 2012
Later among the works it cites.
Cluster vertex deletion: A parameterization between vertex cover and clique-width
M. Doucha and J. Kratochvíl · 2012
Later among the works it cites.
Balanced partitions of trees and applications
A. E. Feldmann and L. Foschini · 2012
Later among the works it cites.
Planar ℱ \mathcal{F} -deletion: Approximation, kernelization and optimal FPT algorithms
F. V. Fomin, D. Lokshtanov, N. Misra, and S. Saurabh · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Hliněný, S. Oum, D. Seese, and G. Gottlob · 2008
Cited alongside, same era.
Parameterized complexity and approximation algorithms
D. Marx · 2008
Cited alongside, same era.
Approximating rank-width and clique-width quickly
S. Oum · 2008
Cited alongside, same era.
Optimal hierarchical decompositions for congestion minimization in networks
H. Räcke · 2008
Cited alongside, same era.
Kernelization: New upper and lower bound techniques
H. L. Bodlaender · 2009
Cited alongside, same era.
Vertex bisection is hard, too
U. Brandes and D. Fleischer · 2009
Cited alongside, same era.
Later among the works it cites.
Personal communication, 2013
P. Arbenz · 2013
Closest in time.
An O ( c k n ) O(c^{k}n) 5-approximation algorithm for treewidth
H. L. Bodlaender, P. G. Drange, M. S. Dregi, F. V. Fomin, D. Lokshtanov, and M. Pilipczuk · 2013
Closest in time.
Fundamentals of Parameterized Complexity
R. G. Downey and M. R. Fellows · 2013
Closest in time.
Fast balanced partitioning is hard, even on grids and trees
A. E. Feldmann · 2013
Closest in time.
Expanding the expressive power of monadic second-order logic on restricted graph classes
R. Ganian and J. Obdržálek · 2013
Closest in time.
Bin packing with fixed number of bins revisited
K. Jansen, S. Kratsch, D. Marx, and I. Schlotter · 2013
Closest in time.
Finding small separators in linear time via treewidth reduction
D. Marx, B. O’Sullivan, and I. Razgon · 2013
Closest in time.
On the parameterized complexity of computing graph bisections
R. van Bevern, A. E. Feldmann, M. Sorge, and O. Suchý · 2013
Closest in time.
Personal communication, 2013
R. F. F. Werneck · 2013
Closest in time.
Kernelization lower bounds by cross-composition
H. L. Bodlaender, B. M. P. Jansen, and S. Kratsch · 2014
Closest in time.
Minimum bisection is fixed parameter tractable
M. Cygan, D. Lokshtanov, M. Pilipczuk, M. Pilipczuk, and S. Saurabh · 2014
Closest in time.