A unifying method for the design of algorithms canonizing combinatorial objects

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: Pascal Schweitzer, Daniel Wiebking

Journal title: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019

Journal publisher: ACM Press

Published year: 2019

Published pages: 1247-1258

DOI identifier: 10.1145/3313276.3316338

ISBN: 9781450367059