Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (713 Publikationen)
«   1   2   3   4   5   6   7   8   9   10   11   12   13   14   15     »
 
Publications 2017
The budgeted minimum cost flow problem with unit upgrading cost  
Christina Büsing, Arie M.C.A. Koster, Sarah Kirchner, Annika Thome
Networks 69 (2017), 67-82.
Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected graphs  
Zhibing Chen, Guifu Su, Lutz Volkmann
Discrete Appl. Math. 218 (2017), 64--70.
Universal arcs in local tournaments  
Jia Guo, Yubao Guo, Mei Lu, Wei Meng, Lutz Volkmann
Discrete Math. 340 (2017), 2900--2915.
Robust and sustainable supply chains under market uncertainties and different risk attitudes-A case study of the German biodiesel market  
Laura Elisabeth Hombach, Christina Büsing, G. Walther
European Journal of Operational Research (2017)
Improved Handling of Uncertainty and Robustness in Set Covering Problems  
Pascal Lutter, Dirk Degel, Christina Büsing, Arie M.C.A. Koster, Brigitte Werners
European Journal of Operational Research 263 (2017), 35-49.
On the signed 2-independence number of graphs  
Seyyed Mehdi Hosseini Moghaddam, Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann
Electron J. Graph Theory Appl. 5 (2017), 36--42.
Ganzzahlige Optimierungsmethoden für die operative Planung von Erhaltungsmaßnahmen im Straßenbau  
Isabelle Schmidt, Hendrik Schaap, Robert Scheidweiler
Heureka 2017 (to appear) (2017)
Twin signed Roman domatic numbers in digraphs  
S.M. Sheikholeslami, Lutz Volkmann
Tamkang J. Math. 48 (2017), 265--272.
Bounds on the l-total k-domatic number of a graph  
Lutz Volkmann
Util. Math. 104 (2017), 103--113.
Lower bounds on the signed k-domination number of graphs  
Lutz Volkmann
Ars Combin. 135 (2017), 357--367.
Signed total 2-independence in digraphs  
Lutz Volkmann
Util. Math. 104 (2017), 295--306.
Signed total k-independence in graphs  
Lutz Volkmann
Util. Math. 103 (2017), 189--208.
Signed total Roman domination in digraphs  
Lutz Volkmann
Discuss. Math. Graph Theory 37 (2017), 261--272.
The signed total Roman k-domatic number of a graph  
Lutz Volkmann
Discuss. Math. Graph Theory 37 (2017), 1027--1038.
Sufficient conditions for maximally edge-connected and super-edge-connected graphs  
Lutz Volkmann, Zhen-Mu Hong
Communications in Combinatorics and Optimization 2 (2017), 35--41.
 
Publications 2016
On the rainbow restrained domination number  
H.A. Ahangar, J. Amjadi, V. Samodivkin, S.M. Sheikholeslami, Lutz Volkmann
Ars Combin. 125 (2016), 209--224.
Twin Roman domination number of a digraph  
H.A. Ahangar, J. Amjadi, V. Samodivkin, S.M. Sheikholeslami, Lutz Volkmann
Miskolc Mathematical Notes 17 (2016), no. 1, 3--14.
Signed Roman edge domination numbers in graphs  
H.A. Ahangar, J. Amjadi, S.M. Sheikholeslami, Lutz Volkmann, Y. Zhao
J. Comb. Optim. 31 (2016), 333-346.
Signed mixed Roman domination numbers in graphs  
H.A. Ahangar, L. Asgharsharghi, S.M. Sheikholeslami, Lutz Volkmann
J. Comb. Optim. 32 (2016), 299-317.
On the computational complexity of the virtual network embedding problem  
Edoardo Amaldi, Stefano Coniglio, Arie M.C.A. Koster, Martin Tieves
Electronic Notes in Discrete Mathematics 52 (2016), 213--220.

Gesamte Liste anzeigen (713 Publikationen)
«   1   2   3   4   5   6   7   8   9   10   11   12   13   14   15     »