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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The polylogarithm motive over S = P^1 minus {0,1,∞} is realized as the relative cohomology motive of the complement of the hypersurface {1 - z t1⋯tn = 0} in A^n_S relative to the hyperplanes ti=0 and ti=1.
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.
-
A construction of the polylogarithm motive
The polylogarithm motive over S = P^1 minus {0,1,∞} is realized as the relative cohomology motive of the complement of the hypersurface {1 - z t1⋯tn = 0} in A^n_S relative to the hyperplanes ti=0 and ti=1.