Skip to content

Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings.

Tamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna, Stanislav Zivn

VenueA*ICALP
Year2025
ProceedingsICALP

Browse the full ICALP paper archive.