http://www.tu-ilmenau.de

Logo TU Ilmenau



Photo of the Contact Person
Contact Person

Prof. Dr. Michael Stiebitz

Head of Institute

Phone +49 3677 69-3633

Send email


INHALTE

Publications

Publications at the institute since 1990

Anzahl der Treffer: 1183
Erstellt: Sun, 24 May 2020 08:14:21 +0200 in 0.0218 sec


Ziegler, Klaus;
Adaptive kernel estimation of the mode in a nonparametric design regression model. - In: Probability and mathematical statistics. - Wrocław : Wydawn. Uniw. Wrocławskiego, ISSN 0208-4147, Bd. 24 (2004), 2, S. 213-235

Herrmann, Eva; Ziegler, Klaus
Rates of consistency for nonparametric estimation of the mode in absence of smoothness assumptions. - In: Statistics & probability letters. - Amsterdam : Elsevier Science, Bd. 68 (2004), 4, S. 359-368

http://dx.doi.org/10.1016/j.spl.2004.04.005
Gyárfás, Andras; Jensen, Tommy; Stiebitz, Michael
On graphs with strongly independent color-classes. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 1097-0118, Bd. 46 (2004), 1, S. 1-14

http://dx.doi.org/10.1002/jgt.10165
Bang-Jensen, Jorgen; Brandt, Stephan
Subgraphs in vertex neighborhoods of Kr-free graphs. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 1097-0118, Bd. 47 (2004), 1, S. 29-38

http://dx.doi.org/10.1002/jgt.20014
Brandt, Stephan; Wozniák, Mariusz
On cyclic packing of a tree. - In: Graphs and combinatorics. - Tokyo : Springer-Verl. Tokyo, ISSN 1435-5914, Bd. 20 (2004), 4, S. 435-442

http://dx.doi.org/10.1007/s00373-004-0583-y
Harant, Jochen;
On paths and cycles through specified vertices. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 286 (2004), 1/2, S. 95-98

http://dx.doi.org/10.1016/j.disc.2003.11.059
Schreyer, Jens; Walther, Hansjoachim
Edge-oblique polyhedral graphs. - In: Discrete applied mathematics. - [S.l.] : Elsevier, Bd. 136 (2004), 2/3, S. 315-327

Let G=G(V;E;F) be a polyhedral graph with vertex set V, edge set E and face set F. e=(x,y,alpha,beta) in E(G) denotes an edge incident with the two vertices x, y in V(G) with d(x)<=d(y), and incident with the two faces alpha, beta in F(G) with d(alpha)<=d(beta). - [d(x),d(y);d(alpha),d(beta)] is the type of the face e=(x,y;alpha,beta). A graph which contains no two edges of a common edge-type is called edge-oblique and if it contains at most z faces of each type it is called z-edge-oblique. In this work we shall prove, that there is only a finite number of edge-oblique and z-edge-oblique graphs. For the first case some bounds for the maximum degree and the number of edges are given.



http://dx.doi.org/10.1016/S0166-218X(03)00447-5
Göring, Frank; Harant, Jochen; Hexel, Erhard; Tuza, Zsolt
On short cycles through prescribed vertices of a graph. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 286 (2004), 1/2, S. 67-74

http://dx.doi.org/10.1016/j.disc.2003.11.047
Böhme, Thomas; Mohar, Bojan; Krekovski, Riste; Stiebitz, Michael
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 1097-0118, Bd. 45 (2004), 4, S. 270-274

http://dx.doi.org/10.1002/jgt.10161
Geletu W. Selassie, Abebe; Hoffmann, Armin
A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization. - In: European journal of operational research : EJOR.. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, Bd. 157 (2004), 1, S. 3-15

http://dx.doi.org/10.1016/j.ejor.2003.08.009