An approximation algorithm for the minimum latency set cover problemHASSIN, Refael; LEVIN, Asaf.Lecture notes in computer science. 2005, pp 726-733, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 8 p.Conference Paper

Derivation, Lψ-bounded martingales and covering conditionsTALAGRAND, M.Transactions of the American Mathematical Society. 1986, Vol 293, Num 1, pp 257-291, issn 0002-9947Article

Variability orderings related to coverage problems on the circleHUFFER, F.Journal of applied probability. 1986, Vol 23, Num 1, pp 97-106, issn 0021-9002Article

Tilings whose members have finitely many neighborsBREEN, M.Israel Journal of Mathematics. 1985, Vol 52, Num 1-2, pp 140-146, issn 0021-2172Article

Mean and variance of vacancy for distribution of k-dimensional spheres within k-dimensional spaceHALL, P.Journal of applied probability. 1984, Vol 21, Num 4, pp 738-752, issn 0021-9002Article

The communication complexity of approximate set packing and coveringNISAN, Noam.Lecture notes in computer science. 2002, pp 868-875, issn 0302-9743, isbn 3-540-43864-5, 8 p.Conference Paper

Random coverings of the circle by ARCS with restricted endpointsJANSON, S.Journal of applied probability. 1988, Vol 25, Num 1, pp 215-219, issn 0021-9002Article

Tiling complexity of small n-ominoes (N<10)RAWSTHORNE, D. A.Discrete mathematics. 1988, Vol 70, Num 1, pp 71-75, issn 0012-365XArticle

Induced restricted Ramsey theorems for spacesFRANKL, P; GRAHAM, R. L; RODL, V et al.Journal of combinatorial theory. Series A. 1987, Vol 44, Num 1, pp 120-128, issn 0097-3165Article

The number of small semispaces of a finite set of points in the planeALON, N; GYORI, E.Journal of combinatorial theory. Series A. 1986, Vol 41, Num 1, pp 154-157, issn 0097-3165Article

Toroidal tilings from de Bruijn-good cyclic sequencesCOCK, J. C.Discrete mathematics. 1988, Vol 70, Num 2, pp 209-210, issn 0012-365XArticle

Explicit construction of exponential sized families of k-independent setsALON, N.Discrete mathematics. 1986, Vol 58, Num 2, pp 191-193, issn 0012-365XArticle

On the categorizing of simply separable relations in partial four-valued logicRENREN LIU; ZHIWEI GONG; FEN XU et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28323-4, 3Vol, Part 3, 1251-1256Conference Paper

A new method in order to determine the most significant members within a large sample, in problems of surface approximationBOZZINI, M; DE TISI, F; LENARDUZZI, L et al.SIAM journal on scientific and statistical computing. 1986, Vol 7, Num 1, pp 98-104, issn 0196-5204Article

Non-trivial intersecting familiesFRANKL, P; FUREDI, Z.Journal of combinatorial theory. Series A. 1986, Vol 41, Num 1, pp 150-153, issn 0097-3165Article

On point processes on the circleHÜSLER, J.Journal of applied probability. 1986, Vol 23, Num 2, pp 322-331, issn 0021-9002Article

Some intersection theorems on two-valued functionsFAUDREE, R. J; SCHELP, R. H; SOS, V. T et al.Combinatorica (Print). 1986, Vol 6, Num 4, pp 327-333, issn 0209-9683Article

A class of polynomially solvable set-covering problemsBERTOLAZZI, P; SASSANO, A.SIAM journal on discrete mathematics. 1988, Vol 1, Num 3, pp 306-316Article

On the impossibility of packing space with different cubesDAWSON, R. J. M.Journal of combinatorial theory. Series A. 1988, Vol 48, Num 2, pp 174-188, issn 0097-3165Article

Exact coverings of the integers by arithmetic progressionsSIMPSON, R. J.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 181-190, issn 0012-365XArticle

The Lee association scheme; Etude du schéma d'association de Lee = Le schéma d'association de LeeSOLE, Patrick.Rapports de recherche - INRIA. 1986, Vol 591, issn 0249-6399, 12 p.Report

A characterization of graphical covers = Soit S une famille d'ensembles. Un recouvrement S est graphique si et seulement si: 1 S=eS; 2 mS≤S; et 3 S satisfait la condition de chaîne affinanteBEDNAREK, A. R; OSTEEN, R. E.Discrete mathematics. 1985, Vol 57, Num 1-2, pp 155-158, issn 0012-365XArticle

On construction of the set of irreducible partial coversMOSHKOV, Mikhail Ju.Lecture notes in computer science. 2005, pp 38-44, issn 0302-9743, isbn 3-540-29498-8, 1Vol, 7 p.Conference Paper

Cycle covering of binary matroidsJAMSHY, U; TARSI, M.Journal of combinatorial theory. Series B. 1989, Vol 46, Num 2, pp 154-161, issn 0095-8956Article

Parallelepipeds in sets of integersBEREND, D.Journal of combinatorial theory. Series A. 1987, Vol 45, Num 2, pp 163-170, issn 0097-3165Article