An O(n^2) optimal algorithm for cardinality-constrained diameter partitioning via reduction to bottleneck 2-coloring and tree DP on the maximum spanning tree, with a matching lower bound.
Springer (1985)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Linkage realization in polygonal domains is W[1]-hard parameterized by graph size and NP-hard for paths with prescribed endpoints, with a linear-time algorithm for short paths in convex polygons.
O(n log n) algorithm renders unit circular arc intersection graphs edgeless and k-clique-free; GGED is strongly NP-hard on unweighted interval graphs and on d-balls/d-cubes for d >= 2.
citing papers explorer
-
An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
An O(n^2) optimal algorithm for cardinality-constrained diameter partitioning via reduction to bottleneck 2-coloring and tree DP on the maximum spanning tree, with a matching lower bound.
-
Realizing Planar Linkages in Polygonal Domains
Linkage realization in polygonal domains is W[1]-hard parameterized by graph size and NP-hard for paths with prescribed endpoints, with a linear-time algorithm for short paths in convex polygons.
-
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
O(n log n) algorithm renders unit circular arc intersection graphs edgeless and k-clique-free; GGED is strongly NP-hard on unweighted interval graphs and on d-balls/d-cubes for d >= 2.