Recoverable Identifier
advisory
doi_compliance
recoverable_identifier
DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPICS.DISC.2018.6(cit.on) was visible in the surrounding text but could not be confirmed against doi.org as printed.
Paper page Integrity report arXiv Try DOI
Evidence text
Ed. by Ulrich Schmid and Josef Widder. LIPIcs. Schloss Dagstuhl - Leibniz- Zentrum für Informatik, 2018, 6:1–6:17.doi:10.4230/LIPICS.DISC.2018.6(cit. on p. 3). [AKS15] Chidambaram Annamalai, Christos Kalaitzis, and Ola Svensson. “Combinatorial AlgorithmforRestrictedMax-MinFairAllocation”.In:Proceedings of the Twenty- Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. Ed. by Piotr Indyk. SIAM, 2015, pp. 1357– 1372.doi:10.1137/1.9781611973730.90(cit. on pp. 3, 8). [BBHO+19] Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. “Lower Bounds for Maximal Matchings and Maximal Inde- pendent Sets”. In:60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019. Ed. by David Zuckerman. IEEE Computer Society, 2019, pp. 481–497.doi:10.1109/ FOCS.2019.00037(cit. on p. 3). [BCDE+19] Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, and Ami Paz. “Hardness of Distributed Optimization”. In:Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. Ed. by Peter Robinson and Faith Ellen. ACM, 2019, pp. 238–247.doi:10.1145/3293611.3331597. arXiv:1905.10284 (cit. on p. 3). [BCG09] MohammadHosseinBateni,MosesCharikar,andVenkatesanGuruswami.“MaxMin allocation via degree lower-bounded arborescences”. In:Proceedings of the 41st Annual AC
Evidence payload
{
"printed_excerpt": "Ed. by Ulrich Schmid and Josef Widder. LIPIcs. Schloss Dagstuhl - Leibniz- Zentrum f\u00fcr Informatik, 2018, 6:1\u20136:17.doi:10.4230/LIPICS.DISC.2018.6(cit. on p. 3). [AKS15] Chidambaram Annamalai, Christos Kalaitzis, and Ola Svensson. \u201cCombinator",
"reconstructed_doi": "10.4230/LIPICS.DISC.2018.6(cit.on",
"ref_index": 1,
"resolved_title": null,
"verdict_class": "incontrovertible"
}