Desktop-Bild

Publikationen

Publikationen 2018
The restrained rainbow bondage number of a graph  
J. Amjadi, N. Dehgardi, R. Khoeilar, S.M. Sheikholeslami, Lutz Volkmann
Tamkang J. Math. 49 (2018), 115--127.
Mixed k-rainbow domination numbers in graphs  
J. Amjadi, N. Dehgardi, A. Parnian, S.M. Sheikholeslami, Lutz Volkmann
Util. Math. 108 (2018), 53--71.
An upper bound on the double Roman domination number  
J. Amjadi, S. Nazari-Moghaddam, S.M. Sheikholeslami, Lutz Volkmann
J. Comb. Optim. 36 (2018), 81--89.
Minimum Color-Degree Perfect b-Matchings  
Mariia Anapolska, Christina Büsing, Martin Comis
Proc. of the 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW) (2018), 13--16.
Relating the annihilation number and the Roman domination number  
Hamideh Aram, R. Khoeilar, S.M. Sheikholeslami, Lutz Volkmann
Acta Math. Univ. Comenianae 87 (2018), 1--13.
Budgeted Colored Matching Problems  
Christina Büsing, Martin Comis
Electronic Notes in Discrete Mathematics 64 (2018), 245--254.
Multi-budgeted matching problems  
Christina Büsing, Martin Comis
Networks 72 (2018), no. 1, 25--41.
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation  
Christina Büsing, Sigrid Knust, Xuan Thanh Le
EURO Journal on Computational Optimization 6 (2018), 339--365.
Lot sizing with storage losses under demand uncertainty  
Stefano Coniglio, Arie M.C.A. Koster, Nils Spiekermann
Journal of Combinatorial Optimization 36 (2018), no. 3, 763--788.
The Synthesis Problem of Decentralized Energy Systems is strongly NP-hard  
Sebastian Goderbauer, Martin Comis, Felix Willamowski
Optimization Online (2018), 1--16.
Robust flows over time: models and complexity results  
Corinna Gottschalk, Arie M.C.A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
Mathematical Programming, series A 171 (2018), no. 1--2, 55--85.
The matching extension problem in general graphs is co-NP-complete  
Jan Hackfeld, Arie M.C.A. Koster
Journal of Combinatorial Optimization 35 (2018), no. 3, 853--859.
Sufficient conditions for digraphs to be maximally connected and super-connected  
Zhen-Mu Hong, Lutz Volkmann, Jun-Ming Xu
J. University Science Technology China 48 (2018), no. 8, 6 pages.
A Note on Edge Weightings Inducing Proper Vertex Colorings  
Anna Margarethe Limbach, Robert Scheidweiler
Graphs Combin. 34 (2018), no. 6, 1269--1277.
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number  
Sebastian Milz, Lutz Volkmann
Discrete Mathematics 341 (2018), no. 2, 484--491.
On chordal graph and line graph squares  
Robert Scheidweiler, Sebastian Wiederrecht
Discrete Applied Mathematics 243 (2018), 239--247.
The Combinatorial k-Deck  
Jan Simon
Graphs Combin. 34 (2018), no. 6, 1597--1618.
Double Roman domination and domatic numbers of graphs  
Lutz Volkmann
Communication in Combinatorics and Optimization 3 (2018), 71--77.
Lower bounds on the signed (total) k-domination number depending on the clique number  
Lutz Volkmann
Communications in Combinatorics and Optimization 3 (2018), 173--178.
Signed total Roman k-domination in graphs  
Lutz Volkmann
J. Combin. Math. Combin. Comput. 105 (2018), 105--116.
The double Roman domatic number of a graph  
Lutz Volkmann
J. Combin. Math. Combin. Comput. 104 (2018), 205--215.