The following pages link to Problems, problems, problems (Q1175791):
Displaying 21 items.
- On packing squares into a rectangle (Q634254) (← links)
- On the approximation of shortest escape paths (Q827333) (← links)
- Robust gift wrapping for the three-dimensional convex hull (Q1337472) (← links)
- Every graph is an integral distance graph in the plane (Q1374191) (← links)
- Stabbing convex subdivisions with \(k\)-flats (Q1792082) (← links)
- Wetzel's sector covers unit arcs (Q2043720) (← links)
- \(z\)-arcs in the thirty degrees sector (Q2059939) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- A convex cover for closed unit curves has area at least 0.1 (Q2218649) (← links)
- Moser's shadow problem (Q2327756) (← links)
- Placing of points into the \(5\)-dimensional unit cube (Q2454590) (← links)
- Viterbo's conjecture as a worm problem (Q2699875) (← links)
- LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS (Q3459368) (← links)
- Sectorial Covers for Unit Arcs (Q5108564) (← links)
- Still Spinning: The Moser Spindle at Sixty (Q6044726) (← links)
- Universal convex covering problems under translations and discrete rotations (Q6060891) (← links)
- Packing a triangle by equilateral triangles of harmonic sidelengths (Q6080241) (← links)
- A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\) (Q6169837) (← links)
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024 (Q6613406) (← links)
- On a traveling salesman problem for points in the unit cube (Q6614116) (← links)
- Packing of non-blocking squares into the unit square (Q6614507) (← links)
