Desktop-Bild

Publikationen

Publikationen 2015
Graphs with large geodetic number  
H.A. Ahangar, S. Kosari, S.M. Sheikholeslami, Lutz Volkmann
FILOMAT 29 (2015), 1361-1368.
Independent 2-rainbow domiantion in trees  
J. Amjadi, N. Dehgardi, N. Mohammadi, S.M. Sheikholeslami, Lutz Volkmann
Asian-Eur. J. Math. 8 (2015), no. 2, 8 pp..
The k-rainbow bondage number of a digraph  
J. Amjadi, N. Mohammadi, S.M. Sheikholeslami, Lutz Volkmann
Discuss. Math. Graph Theory 35 (2015), 261-270.
Global Roman domination in trees  
M. Atapour, S.M. Sheikholeslami, Lutz Volkmann
Graphs Combin. 31 (2015), 813-825.
The budgeted minimum cost flow problem with unit upgrading cost  
Christina Büsing, Arie M.C.A. Koster, Annika Thome, Sarah Kirchner
Optimization Online (2015)
Robust Metric Inequalities for Network Loading Under Demand Uncertainty  
Grit Claßen, Arie M.C.A. Koster, Manuel Kutschka, Issam Tahiri
Asia-Pacific Journal of Operational Research 32 (2015), no. 5, 1550038-1--27.
The multi-band robust knapsack problem -- A dynamic programming approach  
Grit Claßen, Arie M.C.A. Koster, Anke Schmeink
Discrete Optimization 18 (2015), 123--149.
Linearized Optimization Models for Decentralized Energy Supply Systems  
Martin Comis
Master thesis from RWTH Aachen University (2015).
Virtual network embedding under uncertainty: Exact and heuristic approaches  
Stefano Coniglio, Arie M.C.A. Koster, Martin Tieves
11th International Conference on the Design of Reliable Communication Networks (DRCN 2015), IEEE (2015), 1--8.
On the generation of cutting planes which maximize the bound improvement  
Stefano Coniglio, Martin Tieves
Experimental Algorithms, Springer (2015), 97--109.
The rainbow domination subdivision numbers of graphs  
N. Dehgardi, S.M. Sheikholeslami, Lutz Volkmann
Mat. Vesnik 67 (2015), 102-114.
Signed k-domatic numbers of graphs  
Odile Favaron, S.M. Sheikholeslami, Lutz Volkmann
Ars Combin. 123 (2015), 169-184.
Signed Roman k-domination in trees  
Michael Henning, Lutz Volkmann
Discrete Appl. Math. 186 (2015), 98-105.
On the signed (total) k-independence number in graphs  
A. Khodkar, Babak Samadi, Lutz Volkmann
Discuss. Math. Graph Theory 35 (2015), 651-662.
Network Design with Compression: Complexity and Algorithms  
Arie M.C.A. Koster, Martin Tieves
Operations Research and Computing: Algorithms and Software for Analytics - Proceedings of the 14th INFORMS Computing Society Conference (ICS2015), INFORMS (2015), 74--87.
Future research directions in design of reliable communication systems  
J. Raczek, Mario Pickavet, Kishor Trivedi, Javier Alonso Lopez, Arie M.C.A. Koster, James P.G. Sterbenz, Egemen K. Çetinkaya, Teresa Gomes, Matthias Gunkel, Krzysztof Walkowiak, Dimitri Staessens
Telecommunication Systems 60 (2015), no. 4, 423--450.
Gap-neighbour-distinguishing colourings  
Robert Scheidweiler, Eberhard Triesch
Journal of Comb. Math. and Comb. Comp. 94 (2015), 205--214.
Signed Roman domination in digraphs  
S.M. Sheikholeslami, Lutz Volkmann
J. Comb. Optim. 30 (2015), 456-467.
Signed star (j,k)-domatic numbers of digraphs  
S.M. Sheikholeslami, Lutz Volkmann
Discrete Math. Algorithms Appl. 7 (2015), no. 2, 12 pp..
Signed star k-domination and k-domatic numbers of digraphs  
S.M. Sheikholeslami, Lutz Volkmann
Adv. Stud. Contemp. Math. (Kyungshang) 25 (2015), 395-405.
The signed Roman domatic number of a digraph  
S.M. Sheikholeslami, Lutz Volkmann
Electron J. Graph Theory Appl. 3 (2015), 85-93.
The signed Roman k-domatic number of a graph  
Lutz Volkmann
Discrete Appl. Math. 180 (2015), 150-157.
Upper bounds on the signed (k,k)-domatic number of digraphs  
Lutz Volkmann
Bull. Malays. Math. Sci. Soc. 38 (2015), 1527-1536.
Upper bounds on the signed total (k,k)-domatic number of graphs  
Lutz Volkmann
Discuss. Math. Graph Theory 35 (2015), 641-650.