Solving Partition Problems Almost Always Requires Pushing Many Vertices Around - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Iyad A. Kanj' in GoogleThis author has not been identified. Look up 'Christian Komusiewicz' in GoogleThis author has not been identified. Look up 'Manuel Sorge' in GoogleThis author has not been identified. Look up 'Erik Jan van Leeuwen' in Google

runs on WebDSL