Author:  
All :: A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z 
All :: Kaad, ... , Koerwien, Kohlberg, Kohn, ... , Kümmel 
References
70.
Matthias Kreck
Bordism of diffeomorphisms and related topics
Volume 1069 of Lecture Notes in Mathematics
Publisher: Springer-Verlag, Berlin,
1984
ISBN: 3-540-13362-3
69.
Ravi Kannan and Bernhard Korte
Approximative combinatorial algorithms
Mathematical programming (Rio de Janeiro, 1981)
page 195--248.
Publisher: North-Holland, Amsterdam,
1984
68.
Bernhard Korte and Rainer Schrader
Can the ellipsoid method be efficient?
Operations research and economic theory
page 337--343.
Publisher: Springer, Berlin,
1984
67.
Bernhard Korte and László Lovász
Greedoids---a structural framework for the greedy algorithm
Progress in combinatorial optimization (Waterloo, Ont., 1982)
page 221--243.
Publisher: Academic Press, Toronto, ON,
1984
66.
Bernhard Korte
Kombinatorische Optimierung und algorithmische Prinzipien
15th Styrian mathematical symposium (Graz, 1984) Volume 230 of Berichte
page Ber. No. 235, 46.
Publisher: Forschungszentrum Graz, Graz,
1984
65.
W. Kohnen and D. Zagier
Modular forms with rational periods
Modular forms (Durham, 1983) of Ellis Horwood Ser. Math. Appl.: Statist. Oper. Res.
page 197--249.
Publisher: Horwood, Chichester,
1984
64.
Bernhard Korte and László Lovász
Shelling structures, convexity and a happy end
Graph theory and combinatorics (Cambridge, 1983)
page 219--232.
Publisher: Academic Press, London,
1984
63.
M. Kreck
Some closed 4-manifolds with exotic differentiable structure
Algebraic topology, Aarhus 1982 (Aarhus, 1982) Volume 1051 of Lecture Notes in Math.
page 246--262.
Publisher: Springer, Berlin,
1984
62.
Hans-Dieter Donder and Peter Koepke
On the consistency strength of â??accessibleâ?? Jónsson cardinals and of the weak Chang conjecture
Ann. Pure Appl. Logic, 25(3):233--261
1983
61.
Bernhard Korte and László Lovász
Structural properties of greedoids
Combinatorica, 3(3-4):359--374
1983
60.
Per M. Jensen and Bernhard Korte
Complexity of matroid property algorithms
SIAM J. Comput., 11(1):184--190
1982
59.
Marek Karpiński
Decidability of â??Skolem matrix emptiness problemâ?? entails constructability of exact regular expression
Theoret. Comput. Sci., 17(1):99--102
1982
Page:  
Previous | 1, ... , 120, 121, 122, 123, 124, ... , 127 | Next
Export as:
BibTeX, XML