Conflict-free hypergraph matchings

Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev. Conflict-free hypergraph matchings. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 2991-3005, SIAM, 2023. [doi]

@inproceedings{GlockJKKL23,
  title = {Conflict-free hypergraph matchings},
  author = {Stefan Glock and Felix Joos and Jaehoon Kim and Marcus Kühn and Lyuben Lichev},
  year = {2023},
  doi = {10.1137/1.9781611977554.ch115},
  url = {https://doi.org/10.1137/1.9781611977554.ch115},
  researchr = {https://researchr.org/publication/GlockJKKL23},
  cites = {0},
  citedby = {0},
  pages = {2991-3005},
  booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023},
  editor = {Nikhil Bansal 0001 and Viswanath Nagarajan},
  publisher = {SIAM},
  isbn = {978-1-61197-755-4},
}