Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (743 Publikationen)
1   2   3   4   5   6   7   8   9   10     »
 
Publications 2024
Quasi total double Roman domination in trees  
Maryam Akhoundi, Aysha Khan, Jana Shafi, L. Volkmann
Communications in Combinatorics and Optimization 9 (2024), 159--168.
Robust transshipment problem under consistent flow constraints  
Christina Büsing, Arie M.C.A. Koster, Sabrina Schmitz
Networks 83 (2024), no. 1, 53--82.
k-slow Burning: Complexity and Upper Bounds  
Michaela Hiller, Arie M.C.A. Koster, Philipp Pabst
In 19th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Springer (2024), .
Γ-robust optimization of project scheduling problems  
Arie M.C.A. Koster, Jenny Segschneider, Nicole Ventsch
Computers & Operations Research 161 (2024), no. 106453
New bounds on the outer-independent total double Roman domination number  
S.M. Sheikholeslami, Lutz Volkmann
Discrete Math. Algorithms Appl. 16 (2024), 13 pp..
Outer independent total double Italian domination number  
S.M. Sheikholeslami, Lutz Volkmann
Comput. Sci. J. Moldova 32 (2024), 19--37.
Signed total Italian k-domination in digraphs  
Lutz Volkmann
Communications in Combinatorics and Optimization 9 (2024), 339--351.
Weak signed Roman k-domination in digraphs  
L. Volkmann
Opuscula Math. 44 (2024), 285--296.
 
Publications 2023
Total restrained Roman domination  
J. Amjadi, Babak Samadi, Lutz Volkmann
Communications in Combinatorics and Optimization 8 (2023), 575--587.
A Branch & Bound Algorithm for Robust Binary Optimization with Budget Uncertainty  
Christina Büsing, Timo Gersing, Arie M.C.A. Koster
Mathematical Programming Computation 15 (2023), 269--326.
Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty  
Christina Büsing, Timo Gersing, Arie M.C.A. Koster
In Integer Programming and Combinatorial Optimization. IPCO 2023, Springer (Del Pia, A. and Kaibel, V. , eds.) (2023), 58--71.
Counterexamples to the Characterisation of Graphs with Equal Independence and Annihilation Number  
Michaela Hiller
The Electronic Journal of Combinatorics 30 (2023), no. P4.25
Independent Italian bondage of graphs  
S. Kosari, J. Amjadi, Aysha Khan, Lutz Volkmann
Communications in Combinatorics and Optimization 8 (2023), 649-664.
Outer-independent total 2-rainbow dominating functions in graphs  
A. Mahmoodi, Lutz Volkmann
Communications in Combinatorics and Optimization 8 (2023), 431--444.
Upper and lower bounds for competitive group testing  
Robert Scheidweiler, Eberhard Triesch
Discrete Applied Mathematics 333 (2023), 136--150.
Total Italian domatic number of graphs  
S.M. Sheikholeslami, Lutz Volkmann
Comput. Sci. J. Moldova 31 (2023), no. 2, 169--182.
Double Roman and double Italian domination  
Lutz Volkmann
Discuss. Math. Graph Theory, 43 (2023), 721--730.
Remarks on the restrained Italian domination number in graphs  
Lutz Volkmann
Communications in Combinatorics and Optimization 8 (2023), 183--191.
Signed total Italian domination in digraphs  
Lutz Volkmann
Communications in Combinatorics and Optimization 8 (2023), no. 457--466
Signed total Italian k-domatic number of a graph  
Lutz Volkmann
Communications in Combinatorics and Optimization 8 (2023), 39-52.

Gesamte Liste anzeigen (743 Publikationen)
1   2   3   4   5   6   7   8   9   10     »