On the Parameterized Complexity of Computing Balanced Partitions in Graphs

René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý. On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Theory Comput. Syst., 57(1):1-35, 2015. [doi]

@article{BevernFSS15,
  title = {On the Parameterized Complexity of Computing Balanced Partitions in Graphs},
  author = {René van Bevern and Andreas Emil Feldmann and Manuel Sorge and Ondrej Suchý},
  year = {2015},
  doi = {10.1007/s00224-014-9557-5},
  url = {http://dx.doi.org/10.1007/s00224-014-9557-5},
  researchr = {https://researchr.org/publication/BevernFSS15},
  cites = {0},
  citedby = {0},
  journal = {Theory Comput. Syst.},
  volume = {57},
  number = {1},
  pages = {1-35},
}