This work charts a nuanced complexity landscape for diameter computation on 2D intersection graphs, delivering new subquadratic algorithms for some object types and diameter values while proving hardness for others under fine-grained assumptions.
Title resolution pending
4 Pith papers cite this work, alongside 487 external citations. Polarity classification is still indexing.
4
Pith papers citing it
487
external citations · external index
citation-role summary
background 1
citation-polarity summary
years
2026 4roles
background 1polarities
background 1representative citing papers
For every odd k at least 3, an undirected weighted graph admits a (2k/3)-approximation of girth in O~(m+n^(1+2/k)) time, matching the known unweighted trade-off.
Credit-based amortized analysis is sound for persistent data structures when credits are stored only on thunks, and Okasaki's debit approach receives a formal operational semantics.
Presents the Cascade Log, a reference-stable tiered append structure using a coalescing interval map for handles, with Θ(A) space, O(log A) point resolution, and sublinear cost on append-dominated histories where A is the fragmentation measure.
citing papers explorer
-
Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
This work charts a nuanced complexity landscape for diameter computation on 2D intersection graphs, delivering new subquadratic algorithms for some object types and diameter values while proving hardness for others under fine-grained assumptions.
-
Tighter bounds for weighted and unweighted shortest cycle approximation
For every odd k at least 3, an undirected weighted graph admits a (2k/3)-approximation of girth in O~(m+n^(1+2/k)) time, matching the known unweighted trade-off.
-
Persistent Amortised Analysis, Operationally
Credit-based amortized analysis is sound for persistent data structures when credits are stored only on thunks, and Okasaki's debit approach receives a formal operational semantics.
-
The Cascade Log: Reference-Stable Windowing over Tiered Append Sequences
Presents the Cascade Log, a reference-stable tiered append structure using a coalescing interval map for handles, with Θ(A) space, O(log A) point resolution, and sublinear cost on append-dominated histories where A is the fragmentation measure.