Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (747 Publikationen)
«   1   2   3   4   5   6   7   8   9   10   11   12   13   14     »
 
Publications 2019
Patients, Primary Care, and Policy: Simulation Modeling for Health Care Decision Support  
Martin Comis, Catherine Cleophas, Christina Büsing
arXiv.org (2019), no. 1910.11027, 1--30.
Nonnegative signed edge domination in graphs  
N. Dehgardi, Lutz Volkmann
Kragujevac J. Math. 43 (2019), 31--47.
Nonnegative signed Roman domination in graphs  
N. Dehgardi, Lutz Volkmann
J. Combin. Math. Combin. Comput. 110 (2019), 259--277.
Signed edge k-independence in graphs  
N. Dehgardi, Lutz Volkmann
J. Combin. Math. Combin. Comput. 108 (2019), 173--185.
Accurate optimization models for interference constrained bandwidth allocation in cellular networks  
Grit Ecker, Di Yuan, Arie M.C.A. Koster, Anke Schmeink
Computers & Operations Research 101 (2019), 1--12.
Roman k-domination number upon vertex and edge removal  
A.N. Ghameshlou, H. Golmohammadi, Seyyed Mehdi Hosseini Moghaddam, Lutz Volkmann
Util. Math. 112 (2019), 225--234.
The Synthesis Problem of Decentralized Energy Systems is strongly NP-hard  
Sebastian Goderbauer, Martin Comis, Felix Willamowski
Computers & Chemical Engineering 124 (2019), 343--349.
Maximally and super connected multisplit graphs and digraphs  
Litao Guo, Guifu Su, Lutz Volkmann, Xingke Zhao
Appl. Anal. Discrete Math. 13 (2019), 224--239.
Bounds on the fair total domination number in trees and unicyclic graphs  
M. Hajian, N. Jafari Rad, Lutz Volkmann
Australas. J. Combin. 74 (2019), 460--475.
Bounds on the signed Roman k-domination number of a digraph  
Guoliang Hao, Xiaodan Chen, Lutz Volkmann
Discuss. Math. Graph Theory, 39 (2019), 67--79.
Double Roman domination in digraphs  
Guoliang Hao, Xiaodan Chen, Lutz Volkmann
Bull. Malays. Math. Sci. Soc. 42 (2019), 1907--1920.
On the Burning Number of p-Caterpillars  
Michaela Hiller, Eberhard Triesch, Arie M.C.A. Koster
arXiv.org (2019), no. 1912.10897, 1--10.
Locating Roman domination in graphs  
N. Jafari Rad, Hadi Rahbani, Lutz Volkmann
Util. Math. 110 (2019), 203--222.
An adaptive discretization algorithm for the design of water usage and treatment networks  
Arie M.C.A. Koster, Sascha Kuhnke
Optimization and Engineering 20 (2019), no. 2, 497--542.
A flow based pruning scheme for enumerative equitable coloring algorithms  
Arie M.C.A. Koster, Robert Scheidweiler, Martin Tieves
Annals of Operations Research 272 (2019), no. 1--2, 3--28.
Sufficient conditions for maximally edge-connected and super-edge-connected digraphs depending on the size  
Sebastian Milz, Lutz Volkmann
Acta Math. Sin. (Engl. Ser.) 35 (2019), 1861-1870.
On the co-Roman domination in graphs  
Zehui Shao, S.M. Sheikholeslami, Marzieh Soroudi, Lutz Volkmann, Xinmiao Liu
Discuss. Math. Graph Theory 39 (2019), 455--472.
On the number of solutions of x1⋯xpk=g in a finite p-group  
Jan Simon
Archiv der Mathematik 112 (2019), 227--231 .
Italian domination in digraphs  
Lutz Volkmann
Journal of Comb. Math. and Comb. Comp. 111 (2019), 269--278.
Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number  
Lutz Volkmann
Discuss. Math. Graph Theory 39 (2019), 567--573.

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