Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (746 Publikationen)
«   9   10   11   12   13   14   15   16   17   18   19   20   21   22   23     »
 
Publications 2012
Column Generation for Frequency Assignment in Slow Frequency Hopping Networks  
Arie M.C.A. Koster, Martin Tieves
EURASIP Journal on Wireless Communications and Networking (2012), no. 253, 1-14.
k-restricted edge-connectivity in triangle-free graphs  
Dirk Meierling, A. Holtkamp, Luis Pedro Montejano
Discrete Appl. Math. 160 (2012), no. 9, 1345-1355.
Maximally connected graphs  
Dirk Meierling, Lutz Volkmann
In Topics in Structural Graph Theory, Cambrige University Press (L.W. Beineke and R. Wilson, eds.) (2012), 40--70.
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected  
Dirk Meierling, Lutz Volkmann
Discrete Appl. Math. 160 (2012), no. 12, 1775-1781.
Signed distance k-domatic numbers of graphs  
S.M. Sheikholeslami, Lutz Volkmann
J. Combin. Math. Combin. Comput. 83 (2012), 121-128.
Signed total (k, k)-domatic number of digraphs  
S.M. Sheikholeslami, Lutz Volkmann
Aequationes Math. 83 (2012), no. 1-2, 87-96.
Signed total {k}-domination and {k}-domatic numbers of Graphs  
S.M. Sheikholeslami, Lutz Volkmann
Discrete Math. Algorithms Appl. 4 (2012), no. 1, 11 pages.
The signed Roman domatic number of a graph  
S.M. Sheikholeslami, Lutz Volkmann
Ann. Math. Inform. 40 (2012), 105-112.
The total {k}-domatic number of a graph  
S.M. Sheikholeslami, Lutz Volkmann
J. Comb. Optim. 23 (2012), no. 2, 252-260.
The total {k}-domatic number of digraphs  
S.M. Sheikholeslami, Lutz Volkmann
Discuss. Math. Graph Theory 32 (2012), no. 3, 461-471.
On regular (2,q)-extendable graphs  
Lutz Volkmann
Ars Combin. 105 (2012), 53-64.
On the geodomatic number of a graph  
Lutz Volkmann
J. Combin. Math. Combin. Comput. 81 (2012), 151-159.
Signed 2-independence in digraphs  
Lutz Volkmann
Discrete Mathematics 312 (2012), no. 2, 465-471.
The smallest regular graphs which are not 1-extendable  
Lutz Volkmann
Ars Combin. 104 (2012), 179-184.
Changing and unchanging the Roman domination number of a graph  
Lutz Volkmann, N. Jafari Rad
Util. Math. 89 (2012), 79-95.
The k-rainbow domatic number of a graph  
Lutz Volkmann, S.M. Sheikholeslami
Discuss. Math. Graph Theory 32 (2012), no. 1, 129-140.
The signed (k, k)-domatic number of digraphs  
Lutz Volkmann, S.M. Sheikholeslami
Math. Commun. 17 (2012), no. 1-2, 537-546.
 
Publications 2011
Signed total k-domatic numbers of digraphs  
M. Atapour, S.M. Sheikholeslami, Lutz Volkmann
Kragujevac J. Math. 35 (2011), 359-368.
Treewidth Computations II. Lower Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster
Information and Computation 209 (2011), no. 7, 1103--1119.
Recoverable Robust Knapsacks: the Discrete Scenario Case  
Christina Büsing, Arie M.C.A. Koster, Manuel Kutschka
Optimization Letters 5 (2011), no. 3, 379--392.

Gesamte Liste anzeigen (746 Publikationen)
«   9   10   11   12   13   14   15   16   17   18   19   20   21   22   23     »