The algorithmic aspects of uncrowded hypergraphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Sparse 0-1-matrices and forbidden hypergraphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On Heilbronn's problem in higher dimension
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints
Random Structures & Algorithms
Sparse Parity-Check Matrices over ${GF(q)}$
Combinatorics, Probability and Computing
Distributions of points in the unit-square and large k-gons
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Large triangles in the d-dimensional unit cube
Theoretical Computer Science - Computing and combinatorics
Distributions of points in the unit square and large k-gons
European Journal of Combinatorics
Convex Hulls of Point-Sets and Non-uniform Hypergraphs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
No l Grid-Points in Spaces of Small Dimension
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
On sets of points that determine only acute angles
European Journal of Combinatorics
Point sets in the unit square and large areas of convex hulls of subsets of points
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
The maximum size of a Sidon set contained in a sparse random set of integers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |