Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Felix Klingelhoefer and Alantha Newman. Coloring Tournaments with Few Colors: Algorithms and Complexity. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 71:1-71:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{klingelhoefer_et_al:LIPIcs.ESA.2023.71, author = {Klingelhoefer, Felix and Newman, Alantha}, title = {{Coloring Tournaments with Few Colors: Algorithms and Complexity}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {71:1--71:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.71}, URN = {urn:nbn:de:0030-drops-187247}, doi = {10.4230/LIPIcs.ESA.2023.71}, annote = {Keywords: Tournaments, Graph Coloring, Algorithms, Complexity} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Arash Haddadan and Alantha Newman. Towards Improving Christofides Algorithm for Half-Integer TSP. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 56:1-56:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{haddadan_et_al:LIPIcs.ESA.2019.56, author = {Haddadan, Arash and Newman, Alantha}, title = {{Towards Improving Christofides Algorithm for Half-Integer TSP}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {56:1--56:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola 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.2019.56}, URN = {urn:nbn:de:0030-drops-111772}, doi = {10.4230/LIPIcs.ESA.2019.56}, annote = {Keywords: Traveling salesman problem, subtour elimination relaxation, integrality gap, gluing subtours} }
Published in: OASIcs, Volume 61, 1st Symposium on Simplicity in Algorithms (SOSA 2018)
Alantha Newman. Complex Semidefinite Programming and Max-k-Cut. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 13:1-13:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{newman:OASIcs.SOSA.2018.13, author = {Newman, Alantha}, title = {{Complex Semidefinite Programming and Max-k-Cut}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {13:1--13:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.13}, URN = {urn:nbn:de:0030-drops-83098}, doi = {10.4230/OASIcs.SOSA.2018.13}, annote = {Keywords: Graph Partitioning, Max-k-Cut, Semidefinite Programming} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
Alantha Newman, Heiko Röglin, and Johanna Seif. The Alternating Stock Size Problem and the Gasoline Puzzle. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 71:1-71:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{newman_et_al:LIPIcs.ESA.2016.71, author = {Newman, Alantha and R\"{o}glin, Heiko and Seif, Johanna}, title = {{The Alternating Stock Size Problem and the Gasoline Puzzle}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {71:1--71:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.71}, URN = {urn:nbn:de:0030-drops-64134}, doi = {10.4230/LIPIcs.ESA.2016.71}, annote = {Keywords: approximation algorithms, stock size problem, scheduling with non-renewable resources} }
Feedback for Dagstuhl Publishing