Desktop-Bild

Publikationen

Publikationen 2013
Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation  
Edoardo Amaldi, Antonio Capone, Stefano Coniglio, Luca Gianoli
Proceedings of IEEE CAMAD 2013, IEEE (2013).
Network Optimization Problems Subject to Max-Min Fair Flow Allocation  
Edoardo Amaldi, Antonio Capone, Stefano Coniglio, Luca Gianoli
IEEE Communication Letters 17 (2013), no. 7, 1463--1466.
A distance-based point-reassignment heuristic for the k-hyperplane clustering problem  
Edoardo Amaldi, Stefano Coniglio
European Journal of Operational Research 227 (2013), no. 1, 22--29.
On single-path network routing subject to max-min fair flow allocation  
Edoardo Amaldi, Stefano Coniglio, Luca Gianoli, Can Ileri
Proceedings of INOC 2013, Elsevier (2013), 543--550.
The rainbow domination number of a digraph  
J. Amjadi, A. Bahremandpour, S.M. Sheikholeslami, Lutz Volkmann
Kragujevac J. Math. 37 (2013), 257-268.
Roman game domination subdivision number of a graph  
J. Amjadi, H. Karami, S.M. Sheikholeslami, Lutz Volkmann
Trans. Comb. 2 (2013), 1-13.
The distance Roman domination numbers of graphs  
Hamideh Aram, S. Norouzian, S.M. Sheikholeslami, Lutz Volkmann
Discuss. Math. Graph Theory 33 (2013), 717-730.
On the total {k}-domination and total {k}-domatic number of graphs  
Hamideh Aram, S.M. Sheikholeslami, Lutz Volkmann
Bull. Malays. Math. Sci. Soc. 36 (2013), no. 2, 39-47.
Signed star {k}-domatic number of a graph  
M. Atapour, S.M. Sheikholeslami, Lutz Volkmann
Fasciculi Mathematici 51 (2013), 33-43.
Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control  
L. Belke, T. Kesselheim, Arie M.C.A. Koster, B. Vöcking
Proceedings of 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, Springer (2013), 30--41.
Robust optimization under multiband uncertainty  
Christina Büsing, Fabio Dandreagiovanni
CTW (2013), 35--38.
A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks  
Grit Claßen, Arie M.C.A. Koster, Anke Schmeink
Computers & Operations Research 40 (2013), no. 1, 80--90.
Speeding Up Column Generation for Robust Wireless Network Planning  
Grit Claßen, Arie M.C.A. Koster, Anke Schmeink
EURO Journal on Computational Optimization 1 (2013), no. 3, 253-281.
Bound-optimal cutting planes  
Stefano Coniglio
Proc. of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW) (2013), 59-62.
On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints  
Stefano Coniglio
Operations Research Quarterly 11 (2013), no. 1, 95--96.
Robust Redundancy Elimination for Energy-Aware Routing  
D. Coudert, Arie M.C.A. Koster, Truong Khoa Phan, Martin Tieves
IEEE GreenCom 2013, IEEE (2013), 179-186.
Γ-Robust Network Design for Mixed-Line-Rate-Planning of Optical Networks  
Svetoslav Duhovnikov, Arie M.C.A. Koster, Manuel Kutschka, Franz Rambach, Dominic Schupke
Proceedings of the National Fiber Optic Engineers Conference (OFC 2013), Optical Society of America (2013), JTh2A.02.
Connectivity of local tournaments  
Yubao Guo, A. Holtkamp, Sebastian Milz
Australas. J. Combin 57 (2013), 271--279.
Vertex and edge critical Roman domination in graphs  
Adriana Hansberg, N. Jafari Rad, Lutz Volkmann
Util. Math. 92 (2013), 73-88.
Total restrained bondage in graphs  
R. Hasni, N. Jafari Rad, J. Raczek, Lutz Volkmann
Acta Math. Sin. (Engl. Ser.) 29 (2013), 1033-1042.
Solution of a conjecture of Vandell on decycling bipartite tournaments by deleting arcs  
A. Holtkamp, Lutz Volkmann
J. Combin. Math. Combin. Comput. 87 (2013), 3-19.
A note on the independent domination number in graphs  
N. Jafari Rad, Lutz Volkmann
Discrete Appl. Math. 161 (2013), 3087-3089.
Roman domination dot-critical graphs  
N. Jafari Rad, Lutz Volkmann
Graphs Combin. 29 (2013), 527--533.
Robust Network Design: Formulations, Valid Inequalities, and Computations  
Arie M.C.A. Koster, Manuel Kutschka, Christian Raack
Networks 61 (2013), no. 2, 128–-149.
Extended Cutset Inequalities for the Network Power Consumption Problem  
Arie M.C.A. Koster, Truong Khoa Phan, Martin Tieves
Electronic Notes in Discrete Mathematics 41 (2013), 69-76.
A Lower Bound for the Complexity of Monotone Graph Properties  
Robert Scheidweiler, Eberhard Triesch
SIAM J. Discrete Math. 27 (2013), no. 1, 257--265.
Signed {k}-domatic numbers of graphs  
S.M. Sheikholeslami, Lutz Volkmann
J. Combin. Math. Combin. Comput. 87 (2013), 199-208.
Signed total distance k-domatic numbers of graphs  
S.M. Sheikholeslami, Lutz Volkmann
Mat. Vesnik (2013), no. 65, 387--393.
A Generic Multi-layer Network Optimization Model with Demand Uncertainty  
Uwe Steglich, T. Bauschert, Christina Büsing, Manuel Kutschka
Advances in Communication Networking - 19th EUNICE/IFIP WG 6.6 International Workshop, Springer (2013), 13-24.
Bounds on the signed 2-independence number in graphs  
Lutz Volkmann
Discuss. Math. Graph Theory 33 (2013), 709-715.
Complementary cycles in almost regular multipartite tournaments, where one cycle has length four  
Lutz Volkmann
Discrete Appl. Math. 161 (2013), 2169-2177.
Signed total (j,k)-domatic numbers of graphs  
Lutz Volkmann
Australas. J. Combin. 57 (2013), 39--48.
Smallest regular and almost regular triangle-free graphs without perfect matchings  
Lutz Volkmann
Ars Combin. 111 (2013), 463--472.
Upper bounds on the signed (k,k)-domatic number  
Lutz Volkmann
Aequationes Math. 86 (2013), 279-287.
Signed k-domatic numbers of digraphs  
Lutz Volkmann, Hamideh Aram, M. Atapour, S.M. Sheikholeslami
Bull. Malays. Math. Sci. Soc. 36 (2013), no. 2, 143-150.