Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Rajmohan Rajaraman and Omer Wasim. Improved Bounds for Online Balanced Graph Re-Partitioning. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 83:1-83:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{rajaraman_et_al:LIPIcs.ESA.2022.83, author = {Rajaraman, Rajmohan and Wasim, Omer}, title = {{Improved Bounds for Online Balanced Graph Re-Partitioning}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {83:1--83:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.83}, URN = {urn:nbn:de:0030-drops-170210}, doi = {10.4230/LIPIcs.ESA.2022.83}, annote = {Keywords: online algorithms, graph partitioning, competitive analysis} }
Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)
Omer Wasim and Valerie King. Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 33:1-33:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{wasim_et_al:LIPIcs.FSTTCS.2020.33, author = {Wasim, Omer and King, Valerie}, title = {{Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {33:1--33:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-174-0}, ISSN = {1868-8969}, year = {2020}, volume = {182}, editor = {Saxena, Nitin and Simon, Sunil}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.33}, URN = {urn:nbn:de:0030-drops-132746}, doi = {10.4230/LIPIcs.FSTTCS.2020.33}, annote = {Keywords: data structures, dynamic graph algorithms, approximate maximum cut, distributed computing, parallel computing} }
Feedback for Dagstuhl Publishing