Result 1 to 20 of 35 total
An introduction to categorical data analysis. (English)
New York, NY: Wiley. xi, 290 p. \sterling 24.95 (1996).
1
Statistics and data analysis: an introduction. 2nd ed. (English)
New York, NY: Wiley. xiii, 635 p. \sterling 17.99 (1996).
2
Robust statistical procedures: asymptotics and interrelations. (English)
Wiley Series in Probability and Mathematical Statistics. New York, NY: John Wiley \& Sons Ltd. xiv, 466 p. \sterling 50.00 (1996).
3
Adaptive sampling. (English)
Chichester: Wiley \& Sons. xi, 265 p. \sterling 45.00 (1996).
4
The cone of semimodular rank functions. (English)
Derigs, Ulrich (ed.) et al., Operations research proceedings 1994. Selected papers of the international conference on operations research, Berlin, August 30-September 2, 1994. Berlin: Springer-Verlag. 98-102 (1995).
5
Triangle and parallelogram laws on fuzzy graphs. (English)
Pattern Recognit. Lett. 15, No.8, 803-805 (1994).
6
The techniques of sampling. (Les techniques de sondage.) (French)
Paris: Éditions Technip. xv, 393 p. FF 375.00 (1994).
7
Operations on fuzzy graphs. (English)
Inf. Sci. 79, No.3-4, 159-170 (1994).
8
A theory of alternating paths and blossoms for proving correctness of the $O(\sqrt{V}E)$ general graph maximum matching algorithm. (English)
Combinatorica 14, No.1, 71-109 (1994).
9
On fuzzification of matroids. (English)
Fuzzy Sets Syst. 53, No.3, 319-327 (1993).
10
The infinite grid covers the infinite half-grid. (English)
Robertson, Neil (ed.) et al., Graph structure theory. Proceedings of the AMS-IMS-SIAM joint summer research conference on graph minors held June 22 to July 5, 1991 at the University of Washington, Seattle, WA (USA). Providence, RI: American Mathematical Society. Contemp. Math. 147, 455-460 (1993).
11
Spanning properties for fuzzy matroids. (English)
Fuzzy Sets Syst. 51, No.3, 313-321 (1992).
12
Fuzzy matroid sums and a greedy algorithm. (English)
Fuzzy Sets Syst. 52, No.2, 189-200 (1992).
13
Statistical sampling: theory and methods. (English)
Statistics: Textbooks and Monographs. 130. New York: Marcel Dekker, Inc.. xviii, 349 p. (1992).
14
Perfectly orderable graphs and almost all perfect graphs are kernel $M$- solvable. (English)
Graphs Comb. 8, No.2, 103-108 (1992).
15
Which rectangular chessboards have a knight’s tour? (English)
Math. Mag. 64, No.5, 325-332 (1991).
16
A survey on graphs with polynomial growth. (English)
Discrete Math. 95, No.1-3, 101-117 (1991).
17
The theorems of decomposition and representation for fuzzy graphs. (English)
Fuzzy Sets Syst. 42, No.2, 237-243 (1991).
18
Which line-graphs are perfectly orderable? (English)
J. Graph Theory 14, No.5, 555-558 (1990).
19
The non-parametric identification of generalized accelerated failure-time models. (English)
Rev. Econ. Stud. 57, No.2, 167-181 (1990).
20
Result 1 to 20 of 35 total
Start
Contact
Print
General Help
