Desktop-Bild

Publikationen

Publikationen 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.
Robust Two-Dose Vaccination Schemes and the Directed b-Matching Problem  
Jenny Segschneider, Arie M.C.A. Koster
Technical Report , Optimization Online (2023).
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.