Entity usage

Showing below up to 41 results in range #1 to #41.

1. A Generalization of Conway Number Games to Multiple Players: Label: en
2. Combinatorial optimization. Theory and applications.: Label: en
3. The mathematics of Paul Erdős. Vol. II: Label: en
4. Topics in discrete mathematics. Dedicated to Jarik Nešetřil on the occasion of his 60th birthday: Label: en
5. Combinatorial optimization. Theory and algorithms.: Label: en
6. The mathematics of Paul Erdős. Vol. I: Label: en
7. Optimal interconnection trees in the plane. Theory, algorithms and applications: Label: en
8. Matrices and matroids for systems analysis: Label: en
9. Linear optimization and extensions: Label: en
10. Combinatorial Optimization. Polyhedra and efficiency. CD-ROM: Label: en
11. Combinatorial optimization. Polyhedra and efficiency (3 volumes): Label: en
12. Combinatorial optimization. Theory and algorithms: Label: en
13. Combinatorial optimization. Theory and algorithms.: Label: en
14. Combinatorial optimization. Theory and algorithms: Label: en
15. Discrete and computational geometry. The Goodman-Pollack Festschrift: Label: en
16. Geometry of cuts and metrics: Label: en
17. Geometric algorithms and combinatorial optimization.: Label: en
18. Applied finite group actions.: Label: en
19. Linear optimization and extensions.: Label: en
20. Geometric discrepancy. An illustrated guide: Label: en
21. Modern cryptography, probabilistic proofs and pseudo-randomness: Label: en
22. Probabilistic methods for algorithmic discrete mathematics: Label: en
23. Irregularities of partitions. Papers from the meeting held at Fertod, Hungary, from July 7th through 10th, 1986: Label: en
24. Geometric algorithms and combinatorial optimization: Label: en
25. Matroid theory and its applications in electric network theory and in statics: Label: en
26. Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany: Label: en
27. Mathematics of Ramsey theory. Collected papers of the Prague symposium on graph theory held in Prague, Czechoslovakia: Label: en
28. Systems analysis by graphs and matroids. Structural solvability and controllability: Label: en
29. The simplex method. A probabilistic analysis: Label: en
30. Matrices and matroids for systems analysis: Label: en
31. Geometric discrepancy. An illustrated guide: Label: en
32. Geometry of cuts and metrics: Label: en
33. Greedoids: Label: en
34. New trends in discrete and computational geometry: Label: en
35. Discrete images, objects, and functions in \(Z^ n\): Label: en
36. Combinatorial optimization. Theory and algorithms.: Label: en
37. Boolean function complexity. Advances and frontiers.: Label: en
38. Combinatorics and complexity of partition functions: Label: en
39. Sparsity. Graphs, structures, and algorithms: Label: en
40. Graph colouring and the probabilistic method: Label: en
41. The strange logic of random graphs: Label: en