Published in: LIPIcs, Volume 323, 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)
Anand Louis, Alantha Newman, and Arka Ray. Improved Linearly Ordered Colorings of Hypergraphs via SDP Rounding. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 30:1-30:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{louis_et_al:LIPIcs.FSTTCS.2024.30, author = {Louis, Anand and Newman, Alantha and Ray, Arka}, title = {{Improved Linearly Ordered Colorings of Hypergraphs via SDP Rounding}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {30:1--30:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.30}, URN = {urn:nbn:de:0030-drops-222199}, doi = {10.4230/LIPIcs.FSTTCS.2024.30}, annote = {Keywords: hypergraph coloring, SDP rounding, promise constraint satisfaction problems} }
Published in: LIPIcs, Volume 294, 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)
Anand Louis, Rameesh Paul, and Arka Ray. Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 33:1-33:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{louis_et_al:LIPIcs.SWAT.2024.33, author = {Louis, Anand and Paul, Rameesh and Ray, Arka}, title = {{Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {33:1--33:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.33}, URN = {urn:nbn:de:0030-drops-200739}, doi = {10.4230/LIPIcs.SWAT.2024.33}, annote = {Keywords: Sparse Cuts, Random Walks, Link Expansion, Hypergraph Expansion, Simplicial Complexes, High Dimensional Expander, Threshold Rank} }
Feedback for Dagstuhl Publishing