[{"date_updated":"2026-09-08T10:24:20Z","author":[{"last_name":"Adler","first_name":"Enno","full_name":"Adler, Enno"},{"full_name":"Böttcher, Stefan","first_name":"Stefan","last_name":"Böttcher"},{"full_name":"Hartel, Rita","last_name":"Hartel","first_name":"Rita"}],"status":"public","title":"Compressing Hypergraphs using Suffix Sorting","year":"2026","user_id":"14961","doi":"10.1109/DCC66757.2026.00019","_id":"67068","publisher":"IEEE","page":"113–122","citation":{"bibtex":"@inproceedings{Adler_Böttcher_Hartel_2026, title={Compressing Hypergraphs using Suffix Sorting}, DOI={<a href=\"https://doi.org/10.1109/DCC66757.2026.00019\">10.1109/DCC66757.2026.00019</a>}, booktitle={Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026}, publisher={IEEE}, author={Adler, Enno and Böttcher, Stefan and Hartel, Rita}, year={2026}, pages={113–122} }","ama":"Adler E, Böttcher S, Hartel R. Compressing Hypergraphs using Suffix Sorting. In: <i>Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026</i>. IEEE; 2026:113–122. doi:<a href=\"https://doi.org/10.1109/DCC66757.2026.00019\">10.1109/DCC66757.2026.00019</a>","mla":"Adler, Enno, et al. “Compressing Hypergraphs Using Suffix Sorting.” <i>Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026</i>, IEEE, 2026, pp. 113–122, doi:<a href=\"https://doi.org/10.1109/DCC66757.2026.00019\">10.1109/DCC66757.2026.00019</a>.","chicago":"Adler, Enno, Stefan Böttcher, and Rita Hartel. “Compressing Hypergraphs Using Suffix Sorting.” In <i>Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026</i>, 113–122. IEEE, 2026. <a href=\"https://doi.org/10.1109/DCC66757.2026.00019\">https://doi.org/10.1109/DCC66757.2026.00019</a>.","short":"E. Adler, S. Böttcher, R. Hartel, in: Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026, IEEE, 2026, pp. 113–122.","ieee":"E. Adler, S. Böttcher, and R. Hartel, “Compressing Hypergraphs using Suffix Sorting,” in <i>Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026</i>, 2026, pp. 113–122, doi: <a href=\"https://doi.org/10.1109/DCC66757.2026.00019\">10.1109/DCC66757.2026.00019</a>.","apa":"Adler, E., Böttcher, S., &#38; Hartel, R. (2026). Compressing Hypergraphs using Suffix Sorting. <i>Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026</i>, 113–122. <a href=\"https://doi.org/10.1109/DCC66757.2026.00019\">https://doi.org/10.1109/DCC66757.2026.00019</a>"},"publication":"Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026","department":[{"_id":"69"}],"type":"conference","date_created":"2026-09-08T09:42:41Z"}]