Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (746 Publikationen)
«   19   20   21   22   23   24   25   26   27   28   29   30   31   32   33     »
 
Publications 2005
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.
Demand-wise Shared Protection for Meshed Optical Networks  
Arie M.C.A. Koster, A. Zymolka, M. Jäger, R. Hülsermann
Journal of Network and Systems Management 13 (2005), no. 1, 35--55.
A lower bound for the distance k-domination number of trees  
Dirk Meierling, Lutz Volkmann
Results Math. 47 (2005), no. 3-4, 335--339.
Improved results for competitive group testing  
Jens Schlaghoff, Eberhard Triesch
Combin. Probab. Comput. 14 (2005), no. 1-2, 191--202.
An upper bound for the domination number of a graph in terms of order and girth  
Lutz Volkmann
J. Combin. Math. Combin. Comput. 54 (2005), 195--212.
Complementary cycles in regular multipartite tournaments  
Lutz Volkmann
Australas. J. Combin. 31 (2005), 119--134.
Signed domatic numbers of the complete bipartite graphs  
Lutz Volkmann
Util. Math. 68 (2005), 71--77.
Upper bounds on the domination number of a graph in terms of diameter and girth  
Lutz Volkmann
J. Combin. Math. Combin. Comput. 52 (2005), 131--141.
Almost regular c-partite tournaments with c>=8 contain an n-cycle through a given arc for 4<=n<=c  
Lutz Volkmann, Stefan Winzen
Australas. J. Combin. 31 (2005), 61--84.
Signed domatic number of a graph  
Lutz Volkmann, Bohdan Zelinka
Discrete Appl. Math. 150 (2005), no. 1-3, 261--267.
Super connectivity of line graphs  
Jun-Ming Xu, Min Lü, Meijie Ma, Angelika Hellwig
Inform. Process. Lett. 94 (2005), no. 4, 191--195.
 
Publications 2004
Relations between the lower domination parameters and the chromatic number of a graph  
Mustapha Chellali, Lutz Volkmann
Discrete Math. 274 (2004), no. 1-3, 1--8.
Some remarks on alpha-domination  
Franz Dahme, Dieter Rautenbach, Lutz Volkmann
Discuss. Math. Graph Theory 24 (2004), no. 3, 423--430.
Erster Aachener Tag der Graphentheorie  
Miranca Fischermann, Yubao Guo, Angelika Hellwig, Arne Hoffmann, Dirk Meierling, Bert Randerath, Dieter Rautenbach, Meike Tewes, Stefan Winzen
, Rheinisch-Westfälische Technische Hochschule Aachen (2004).

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