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.ICALP.2024.76.8) 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
doi:10.4230/LIPIcs.ICALP. 2024.76. 8 Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, and Sebastian Siebertz. Kernelization complexity of solution discovery problems. In35th International Symposium on Algorithms and Computation, ISAAC 2024, LIPIcs, pages 36:1–36:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.doi:10.4230/LIPIcs. ISAAC.2024.36. 9 Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, and Kirill Simonov. Upward and orthogonal planarity are W[1]-Hard parameterized by treewidth. InGraph Drawing and Network Visualization, pages 203–217, Cham,
Evidence payload
{
"printed_excerpt": "doi:10.4230/LIPIcs.ICALP. 2024.76. 8 Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, and Sebastian Siebertz. Kernelization complexity of solution discovery problems. In35th International Sympos",
"reconstructed_doi": "10.4230/LIPIcs.ICALP.2024.76.8",
"ref_index": 7,
"resolved_title": null,
"verdict_class": "incontrovertible"
}