Reference change · event page

An algorithm to find maximum area polygons circumscribed about a convex polygon , url =

Published notice on a work cited in the Pith corpus. Exact quotes below. No model judges whether any citation was load-bearing.

This page records that a citing paper's bibliography includes a work with a published notice. It is not a judgment on the citing paper.

Correction Crossref 1 open · 1 total · 0 disputed

DOI: 10.1016/j.dam.2018.08.017
Notice DOI: 10.1016/j.dam.2024.04.013
Event date: 2024-05-11
Machine twin: JSON

01One-hop citing occurrences

Correction Open

Couplings Farthest from the Independent Gaussian

ref [229] · 2609.10467 · notice #10946 · dispute

Raw extraction · bibliography line

Ausserhofer, Markus and Dann, Susanna and L\'. An algorithm to find maximum area polygons circumscribed about a convex polygon , url =. Discrete Appl. Math. , mrclass =. 2019 , bdsk-url-1 =. doi:10.1016/j.dam.2018.08.017 , fjournal =

Parser render (TeX stripped for reading; raw above is the evidence)

Ausserhofer, Markus and Dann, Susanna and L . An algorithm to find maximum area polygons circumscribed about a convex polygon, url =. Discrete Appl. Math., mrclass =. 2019, bdsk-url-1 =. doi:10.1016/j.dam.2018.08.017, fjournal =

Status lifecycle on notices: open → disputed → (response attached on the notice page). Repaired counts matter as much as open counts. There is no “safe,” “invalid,” or “resolved” badge.