Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Largest unit rectangles inscribed in a convex polygon: Label: en
Packing unequal disks in the Euclidean plane: Label: en
Improved approximation for two-dimensional vector multiple knapsack: Label: en
A note on the \(k\)-colored crossing ratio of dense geometric graphs: Label: en
On the line-separable unit-disk coverage and related problems: Label: en
Routing on heavy path WSPD spanners: Label: en
Online class cover problem: Label: en
Enumerating combinatorial resultant trees: Label: en
Geometric triangulations and discrete Laplacians on manifolds: an update: Label: en
Distance measures for geometric graphs: Label: en
Editorial: Label: en
Isometric deformations of discrete and smooth T-surfaces: Label: en
Distance queries over dynamic interval graphs: Label: en
The parameterized complexity of finding minimum bounded chains: Label: en
An analytical representation of the 2d generalized balanced power diagram: Label: en
Panel-point model for rigidity and flexibility analysis of rigid origami: Label: en
An exact algorithm for the Euclidean \(k\)-Steiner tree problem: Label: en
Hierarchical categories in colored searching: Label: en
Maximum-width rainbow-bisecting empty annulus: Label: en
Bounds on soft rectangle packing ratios: Label: en
Global strong convexity and characterization of critical points of time-of-arrival-based source localization: Label: en
Erratum to: ``Densest lattice packings of 3-polytopes: Label: en
Generalized class cover problem with axis-parallel strips: Label: en
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions: Label: en
Editorial: Label: en
Geometric dominating-set and set-cover via local-search: Label: en
Keep your distance: land division with separation: Label: en
Augmenting graphs to minimize the radius: Label: en
Any Platonic solid can transform to another by \(O(1)\) refoldings: Label: en
Density of triangulated ternary disc packings: Label: en
Range updates and range sum queries on multidimensional points with monoid weights: Label: en
Half-plane point retrieval queries with independent and dependent geometric uncertainties: Label: en
Colouring bottomless rectangles and arborescences: Label: en
Multi-robot motion planning for unit discs with revolving areas: Label: en
Algorithms for radius-optimally augmenting trees in a metric space: Label: en
Simple linear time algorithms for piercing pairwise intersecting disks: Label: en
Cut locus realizations on convex polyhedra: Label: en
The constant of point-line incidence constructions: Label: en
Bottleneck matching in the plane: Label: en
Partial matchings induced by morphisms between persistence modules: Label: en
On the geometric priority set cover problem: Label: en
Shortcut hulls: vertex-restricted outer simplifications of polygons: Label: en
Angles of arc-polygons and lombardi drawings of cacti: Label: en
Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces: Label: en
An algorithmic framework for the single source shortest path problem with applications to disk graphs: Label: en
How close is a quad mesh to a polycube?: Label: en
Unfoldings and nets of regular polytopes: Label: en
Dynamic data structures for \(k\)-nearest neighbor queries: Label: en
Untangling circular drawings: algorithms and complexity: Label: en
Complexity results on untangling red-blue matchings: Label: en