Citation notice #10946 · 2026-09-10 06:33:56.711434+00:00

Couplings Farthest from the Independent Gaussian

Correction Crossref Open

cites An algorithm to find maximum area polygons circumscribed about a convex polygon , url =, which carries a correction notice dated 2024-05-11. One-hop deterministic notice: the citation edge exists in the Pith bibliography graph; no model judged whether the citation was load-bearing.

This is not a judgment on the citing paper.

Citing paper Event page Original DOI Notice DOI File a formal challenge All reference changes

01Evidence

Raw extraction · bibliography line · bibliography index 229

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 =

02Event

Type: Correction
Source: Crossref
Original DOI: 10.1016/j.dam.2018.08.017
Notice DOI: 10.1016/j.dam.2024.04.013
Date: 2024-05-11
Title: Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]
Reasons: ['Erratum']
Work: An algorithm to find maximum area polygons circumscribed about a convex polygon , url = (2019)

Schema constants (for re-runners): correction · crossref

03Dispute this notice

If this citation does not depend on the flagged claim, or the event is wrong, say so. Disputes are public. For a signed challenge against the paper itself, use the formal challenge form.