The Computational Complexity of Positive Non-Clashing Teaching in Graphs

Abstract

Full Citation:

Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton. The Computational Complexity of Positive Non-Clashing Teaching in Graphs. The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.

Liana Khazaliya

Liana Khazaliya is a Project Assistant at the Algorithms and Complexity Group.

Mathis Teva Rocton

Mathis Teva Rocton is a Project Assistant at the Algorithms and Complexity Group.