Minimum Chain Cover in Almost Linear Time

Manuel Cáceres. Minimum Chain Cover in Almost Linear Time. In Kousha Etessami, Uriel Feige, Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany. Volume 261 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

@inproceedings{Caceres23-0,
  title = {Minimum Chain Cover in Almost Linear Time},
  author = {Manuel Cáceres},
  year = {2023},
  doi = {10.4230/LIPIcs.ICALP.2023.31},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.31},
  researchr = {https://researchr.org/publication/Caceres23-0},
  cites = {0},
  citedby = {0},
  booktitle = {50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany},
  editor = {Kousha Etessami and Uriel Feige and Gabriele Puppis},
  volume = {261},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-278-5},
}