Polygon Exploration with Time-Discrete Vision

Polygonal Chains Cannot Lock in 4D

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks

Polynomial Bounds on the Slicing Number

Polynomial cases of the Discretizable Molecular Distance Geometry Problem

Polynomial-time homology for simplicial Eilenberg-MacLane spaces

Polyominoes and Polyiamonds as Fundamental Domains of Isohedral Tilings with Rotational Symmetry

Power Assignment Problems in Wireless Communication

Practical Conditions for Well-behaved-ness of Anisotropic Voronoi Diagrams

Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible

Priority Range Trees

Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data

Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions

Probabilistic Matching of Planar Regions

Proximity Drawings of High-Degree Trees

PushPush and Push-1 are NP-hard in 2D

PushPush is NP-hard in 2D

PushPush is NP-hard in 3D