Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (739 Publikationen)
«   18   19   20   21   22   23   24   25   26   27   28   29   30   31   32     »
 
Publications 2006
Upper bounds on the domination number of a graph in terms of order and minimum degree  
Lutz Volkmann
Ars Combin. 81 (2006), 3--22.
Cycles with a given number of vertices from each partite set in regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Czechoslovak Math. J. 56(131) (2006), no. 3, 827--843.
On the connectivity of close to regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Discrete Appl. Math. 154 (2006), no. 9, 1437--1452.
Paths with a given number of vertices from each partite set in regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Discrete Math. 306 (2006), no. 21, 2724--2732.
 
Publications 2005
Iterative solution of algebraic matrix Riccati equations in open loop Nash games  
Teresa Paula Azevedo-Perdicoúlis, Gerhard Jank
Internat. J. Robust Nonlinear Control 15 (2005), no. 2, 55--62.
Linear quadratic Nash games on positive linear systems  
Teresa Paula Azevedo-Perdicoúlis, Gerhard Jank
Eur. J. Control 11 (2005), no. 6, 632--644.
On the p-domination number of cactus graphs  
Mostafa Blidia, Mustapha Chellali, Lutz Volkmann
Discuss. Math. Graph Theory 25 (2005), no. 3, 355--361.
Pre-processing rules for triangulation of probabilistic networks  
Hans L. Bodlaender, Arie M.C.A. Koster, F. van den Eijkhof
Computational Intelligence 21 (2005), no. 3, 286--305.
Average distance in k-connected tournaments  
Peter Dankelmann, Lutz Volkmann
Ars Combin. 77 (2005), 289--294.
Extremal trees with respect to dominance order  
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
Ars Combin. 76 (2005), 249--255.
A remark on a conjecture for the (k,p)-domination number  
Miranca Fischermann, Lutz Volkmann
Util. Math. 67 (2005), 223--227.
A note on the number of matchings and independent sets in trees  
Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach
Discrete Appl. Math. 145 (2005), no. 3, 483--489.
Unique irredundance, domination and independent domination in graphs  
Miranca Fischermann, Lutz Volkmann, Igor Zverovich
Discrete Math. 305 (2005), no. 1-3, 190--200.
Cuts leaving components of given minimum order  
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 292 (2005), no. 1-3, 55--65.
Neighborhood conditions for graphs and digraphs to be maximally edge-connected  
Angelika Hellwig, Lutz Volkmann
Australas. J. Combin. 33 (2005), 265--277.
Sufficient conditions for graphs to be $\lambda'$-optimal, super-edge-connected, and maximally edge-connected  
Angelika Hellwig, Lutz Volkmann
J. Graph Theory 48 (2005), no. 3, 228--246.
Branch and Tree Decomposition Techniques for Discrete Optimization  
I.V. Hicks, Arie M.C.A. Koster, E. Kolotouglu
In TutORials 2005, INFORMS Annual Meeting (J. Cole Smith, eds.) (2005), 1--29.
Structural remarks on bipartite graphs with unique f-factors  
Arne Hoffmann, Lutz Volkmann
Graphs Combin. 21 (2005), no. 4, 421--425.
Matrix Riccati differential equations  
Gerhard Jank
, Universidade de Coimbra Departamento de Matem (2005).
On cycles and the stable multi-set polytope  
Arie M.C.A. Koster, A. Zymolka
Discrete Optimization 2 (2005), no. 3, 241--255.

Gesamte Liste anzeigen (739 Publikationen)
«   18   19   20   21   22   23   24   25   26   27   28   29   30   31   32     »