http://www.tu-ilmenau.de

Logo TU Ilmenau



Foto des Ansprechpartners
Ansprechpartner

Prof. Dr. rer. nat. habil. Matthias Kriesell

Institutsdirektor

Telefon +49 3677 69-3633

E-Mail senden


Ihre Position

INHALTE

Veröffentlichungen

Veröffentlichungen am Institut für Mathematik seit 1990

Anzahl der Treffer: 1176
Erstellt: Mon, 24 Feb 2020 23:05:44 +0100 in 0.0389 sec


Nehse, Reinhard;
[Rezension von: Dontchev, Asen L., 1948-, Well-posed optimization problems]. - In: OR spectrum. - Berlin : Springer, ISSN 1436-6304, 1, S. 28
, Rezension von : Dontchev, Asen L., 1948-: Well-posed optimization problems. - Berlin [u.a.] : Springer, 1993
https://doi.org/10.1007/BF01539877
Nehse, Reinhard;
[Rezension von: Sakawa, Masatoshi, 1947-, Fuzzy sets and interactive multiobjective optimization]. - In: OR spectrum. - Berlin : Springer, ISSN 1436-6304, 4, S. 230
, Rezension von : Sakawa, Masatoshi, 1947-: Fuzzy sets and interactive multiobjective optimization. - New York, NY [u.a.] : Plenum Press, 1993
https://doi.org/10.1007/BF01540161
Nehse, Reinhard;
[Rezension von: Gregory, Geoffrey, Decision analysis]. - In: OR spectrum. - Berlin : Springer, ISSN 1436-6304, 4, S. 208
, Rezension von : Gregory, Geoffrey: Decision analysis. - New York [u.a.] : Plenum Press, 1988
https://doi.org/10.1007/BF01540157
John, Peter E.; Mallion, Roger B.;
Calculating the number of spanning trees in a labeled planar molecular graph whose inner dual is a tree. - In: International journal of quantum chemistry. - New York, NY : Wiley, ISSN 1097-461X, Bd. 60 (1996), 1, S. 59-66

https://doi.org/10.1002/(SICI)1097-461X(1996)60:1<59::AID-QUA6>3.0.CO;2-4
Voigt, Margit;
Choosability of planar graphs. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 150 (1996), 1/3, S. 457-460

http://dx.doi.org/10.1016/0012-365X(95)00216-J
Walther, Hansjoachim;
A nonhamiltonian five-regular multitriangular polyhedral graph. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 150 (1996), 1/3, S. 387-392

http://dx.doi.org/10.1016/0012-365X(95)00203-9
Kostochka, Alexandr V.; Stiebitz, Michael; Wirth, B.;
The colour theorems of Brooks and Gallai extended. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 162 (1996), 1/3, S. 299-303

http://dx.doi.org/10.1016/0012-365X(95)00294-7
Fabrici, Igor; ,
An inequality concerning edges of minor weight in convex 3-polytopes. - In: Discussiones mathematicae. - Warsaw : De Gruyter Open, ISSN 2083-5892, Bd. 16 (1996), 1, S. 81-87

https://doi.org/10.7151/dmgt.1024
Tuza, Zsolt; Voigt, Margit
Every 2-choosable graph is (2m, m)-choosable. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 1097-0118, Bd. 22 (1996), 3, S. 245-252

http://dx.doi.org/10.1002/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-M
Böhme, Thomas; Broersma, H. J.; Veldman, H. J.
Toughness and longest cycles in 2-connected planar graphs. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 1097-0118, Bd. 23 (1996), 3, S. 257-263

http://dx.doi.org/10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-R