Heilbronn triangle‐type problems in the unit square [0,1]2
From MaRDI portal
Publication:6074876
DOI10.1002/rsa.21109zbMath1523.51022OpenAlexW4287218992MaRDI QIDQ6074876
Fabrício Siqueira Benevides, Knut Odermann, Hanno Lefmann, Carlos Hoppen
Publication date: 19 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.21109
Cites Work
- Unnamed Item
- Extremal uncrowded hypergraphs
- Developments in Heilbronn's triangle problem
- Distributions of points in the unit square and large \(k\)-gons
- A Lower Bound for Heilbronn's Triangle Problem in d Dimensions
- On the Heilbronn Optimal Configuration of Seven Points in the Square
- Lower Bounds on the Complexity of Polytope Range Searching
- On Heilbronn's Triangle Problem
- A Lower Bound for Heilbronn'S Problem
- The Algorithmic Aspects of Uncrowded Hypergraphs
- On smallest triangles
- An Algorithm for Heilbronn's Problem
- The average‐case area of Heilbronn‐type triangles*
- New versions of Suen's correlation inequality
- An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
- On a Problem of Heilbronn†
- Maximizing the Smallest Triangle Made by N Points in a Square
- On a Problem of Heilbronn, II
- On a Problem of Heilbronn
- New lower bounds for Heilbronn numbers
This page was built for publication: Heilbronn triangle‐type problems in the unit square [0,1]2