Pages that link to "Item:Q1816464"
From MaRDI portal
The following pages link to New lower bounds for Hopcroft's problem (Q1816464):
Displaying 18 items.
- Bold graph drawings (Q654288) (← links)
- Reverse shortest path problem for unit-disk graphs (Q832915) (← links)
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space (Q934024) (← links)
- Covering lattice points by subspaces and counting point-hyperplane incidences (Q1716001) (← links)
- Local polyhedra and geometric graphs (Q1775780) (← links)
- On counting point-hyperplane incidences (Q1873152) (← links)
- Lower bounds for off-line range searching (Q2365324) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications (Q4585060) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- COMPUTING CLOSEST POINTS FOR SEGMENTS (Q4818603) (← links)
- (Q5111688) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Approximating Minimization Diagrams and Generalized Proximity Search (Q5502175) (← links)
- (Q5743403) (← links)
- (Q5881548) (← links)
