Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes

Abstract

Full Citation:

Jan Dreier, Nikolas Mählmann, Szymon Toruńczyk. Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes. Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), pages 1550–1560, 2024.

Jan Niclas Dreier
Jan Niclas Dreier

Jan Niclas Dreier was a Postdoctoral Researcher at the Algorithms and Complexity Group.