Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen. Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. In Yossi Azar, Hannah Bast, Grzegorz Herman, editors, 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland. Volume 112 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

@inproceedings{KanjKSL18-0,
  title = {Solving Partition Problems Almost Always Requires Pushing Many Vertices Around},
  author = {Iyad A. Kanj and Christian Komusiewicz and Manuel Sorge and Erik Jan van Leeuwen},
  year = {2018},
  doi = {10.4230/LIPIcs.ESA.2018.51},
  url = {https://doi.org/10.4230/LIPIcs.ESA.2018.51},
  researchr = {https://researchr.org/publication/KanjKSL18-0},
  cites = {0},
  citedby = {0},
  booktitle = {26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland},
  editor = {Yossi Azar and Hannah Bast and Grzegorz Herman},
  volume = {112},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-081-1},
}