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
Sparse parity-check matrices over finite fields
COCOON'03 Proceedings of the 9th annual international conference on Computing and 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
Distributions of points in d dimensions and large k-point simplices
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Distributions of points and large quadrangles
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |
We consider the problem of finding deterministically a large independent set of guaranteed size in a hypergraph on n vertices and with m edges. With respect to the Turán bound, the quality of our solutions is better for hypergraphs with not too many small cycles by a logarithmic factor in the input size. The algorithms are fast; they often have a running time of O(m) + o(n3). Indeed, the denser the hypergraphs are the closer the running times are to the linear times. For the first time, this gives for some combinatorial problems algorithmic solutions with state-of-the-art quality, solutions of which only the existence was known to date. In some cases, the corresponding upper bounds match the lower bounds up to constant factors. The involved concepts are uncrowded hypergraphs.