Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen

Journal title: Proceedings of the 26th Annual European Symposium on Algorithms (ESA '18)

Journal publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Published year: 2018

Published pages: 51:1-51:14

DOI identifier: 10.4230/LIPIcs.ESA.2018.51