On odd covering systems with distinct moduliSONG GUO; SUN, Zhi-Wei.Advances in applied mathematics (Print). 2005, Vol 35, Num 2, pp 182-187, issn 0196-8858, 6 p.Article

Zur Eindeutigkeit volumenminimaler Ellipsoidüberdeckungen = About uniqueness of minimal volume ellipsoidal coveringsJUHNKE, F.Wissenschaftliche Zeitschrift der Technischen Hochschule Otto von Guericke Magdeburg. 1989, Vol 33, Num 6, pp 67-69, issn 0541-8933, 3 p.Article

On a New Relative Invariant Covering DimensionGEORGIOU, D. N; MEGARITIS, A. C.Extracta mathematicae. 2010, Vol 25, Num 3, pp 263-275, issn 0213-8743, 13 p.Conference Paper

When is a Group Homomorphism a Covering Homomorphism?SANTOS, José Carlos.Extracta mathematicae. 2007, Vol 22, Num 3, pp 325-330, issn 0213-8743, 6 p.Article

Recouvrements d'un rectangle de largeur 3 à l'aide de triminos = Tilings of a rectangle of width 3 with triminoesKREWERAS, G.Mathématiques, informatique et sciences humaines. 1995, Num 130, pp 27-31, issn 0995-2314Article

The reduction of a double covering of a Mumford curveVAN STEEN, G.Bulletin of the Belgian Mathematical Society. Simon Stevin. 1994, Vol 1, Num 4, pp 469-475, issn 1370-1444Article

A surprising covering of the real lineKUN, Gabor.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 12, pp 3555-3559, issn 0002-9939, 5 p.Article

An additive optimum covering problemSABIRYANOVA, K. G.Computational mathematics and mathematical physics. 1996, Vol 36, Num 4, pp 545-551, issn 0965-5425Article

An algorithm to find minimal cover of a set of functional dependenciesSAXENA, P. C; TRIPATHI, R. C.Computers and artificial intelligence. 1988, Vol 7, Num 3, pp 277-285, issn 0232-0274Article

Kirkman covering designs with even-sized holesJIANXING YIN; CHENGMIN WANG.Discrete mathematics. 2009, Vol 309, Num 6, pp 1422-1434, issn 0012-365X, 13 p.Article

COMPUTATION OF HIGHLY RAMIFIED COVERINGSVIDUNAS, Raimundas; KITAEV, Alexander V.Mathematics of computation. 2009, Vol 78, Num 268, pp 2371-2395, issn 0025-5718, 25 p.Article

CORE PARTITIONS AND BLOCK COVERINGSOLSSON, JØrn B.Proceedings of the American Mathematical Society. 2009, Vol 137, Num 9, pp 2943-2951, issn 0002-9939, 9 p.Article

All n-cotilting modules are pure-injectiveSOVICEK, Jan.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 7, pp 1891-1897, issn 0002-9939, 7 p.Article

Covering numbers under small perturbationsFERNANDES, Rosario.Linear algebra and its applications. 2002, Vol 350, pp 105-124, issn 0024-3795Article

A new multi-resource cumulatives constraint with negative heightsBELDICEANU, Nicolas; CARLSSON, Mats.Lecture notes in computer science. 2002, pp 63-79, issn 0302-9743, isbn 3-540-44120-4, 17 p.Conference Paper

Approximation algorithms for covering polygons with squares and similar problemsLEVCOPOULOS, C; GUDMUNDSSON, J.Lecture notes in computer science. 1997, pp 27-41, issn 0302-9743, isbn 3-540-63248-4Conference Paper

Optimal arrangements of equal circles on a sphereTARNAI, T; FOWLER, P. W.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 515-516, issn 0044-2267, SUP5Conference Paper

AE1: an extension matrix approximate method for the general covering problemJIARONG HONG.International journal of computer & information sciences. 1985, Vol 14, Num 6, pp 421-437, issn 0091-7036Article

A note on the edge cover number and independence number in hypergraphsBERGE, Eli; ZIV, Ran.Discrete mathematics. 2008, Vol 308, Num 12, pp 2649-2654, issn 0012-365X, 6 p.Article

De Bruijn covering codes with arbitrary alphabetsVU, V.Advances in applied mathematics (Print). 2005, Vol 34, Num 1, pp 65-70, issn 0196-8858, 6 p.Article

Uniform coverings of 2-paths with 5-paths in the complete graphKOBAYASHI, Midori; NAKAMURA, Gisaku; NARA, Chie et al.Discrete mathematics. 2005, Vol 299, Num 1-3, pp 154-161, issn 0012-365X, 8 p.Article

The computational power of a family of decision forestsAMANO, Kazuyuki; HIROSAWA, Tsukuru; WATANABE, Yusuke et al.Lecture notes in computer science. 2001, pp 123-134, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Covering a rectangle with six and seven circlesMELISSEN, J. B. M; SCHUUR, P. C.Discrete applied mathematics. 2000, Vol 99, Num 1-3, pp 149-156, issn 0166-218XConference Paper

An improved inductive learning algorithm with a preanalysis of dataKACPRZYK, J; SZKATUŁA, G.Lecture notes in computer science. 1997, pp 157-166, issn 0302-9743, isbn 3-540-63614-5Conference Paper

Parallelism in multigrid methods : How much is too much?MATHESON, L. R; TARJAN, R. E.International journal of parallel programming. 1996, Vol 24, Num 5, pp 397-432, issn 0885-7458Article