Lehr- und Forschungsgebiet Diskrete Optimierung

Desktop-Bild

Publications

Publications 2011

Formulations and heuristics for the k-Piecewise Affine Model Fitting problem

Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari

Proc. of the 10th Cologne-Twente Workshop on Graphs and Optimization (CTW) (2011).

Signed total k-domatic numbers of digraphs

M. Atapour, S.M. Sheikholeslami, Lutz Volkmann

Kragujevac J. Math. 35 (2011), 359-368.

Treewidth Computations II. Lower Bounds

Hans L. Bodlaender, Arie M.C.A. Koster

Information and Computation 209 (2011), no. 7, 1103--1119.

Recoverable Robust Knapsacks: Gamma-Scenarios

Christina Büsing, Arie M.C.A. Koster, Manuel Kutschka

Proceedings of INOC 2011, International Network Optimization Conference, Springer (2011), 583--588.

Recoverable Robust Knapsacks: the Discrete Scenario Case

Christina Büsing, Arie M.C.A. Koster, Manuel Kutschka

Optimization Letters 5 (2011), no. 3, 379--392.

Line planning, path constrained network flow and inapproximability

Christina Büsing, Sebastian Stiller

Networks 57 (2011), no. 1, 106 -- 113.

Routage et Ordonnancement Robustes dans les Réseaux Radio Maillés

C. Caillouet, Arie M.C.A. Koster

13èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel11) (2011), 119-122.

A Multi-objective Approach for Data Collection in Wireless Sensor Networks

C. Caillouet, X. Li, T. Razafindralambo

10th International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW), Springer (2011), 220--233.

Compromis Energie-Délai pour la Collecte de Données dans les Réseaux de Capteurs

C. Caillouet, T. Razafindralambo

13èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel11) (2011), 97-100.

Characterization of trees with equal 2-domination number and domination number plus two

Mustapha Chellali, Lutz Volkmann

Discuss. Math. Graph Theory 31 (2011), 687-697.

A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks

Grit Claßen, D. Coudert, Arie M.C.A. Koster, N. Nepomuceno

Network Optimization, 5th International Conference, INOC 2011, Hamburg, Germany, June 2011, Proceedings, Springer (2011), 37--42.

Bandwidth assignment for reliable fixed broadband wireless networks

Grit Claßen, D. Coudert, Arie M.C.A. Koster, N. Nepomuceno

12th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM) (2011).

Robust Planning of Green Wireless Networks

Grit Claßen, Arie M.C.A. Koster, Anke Schmeink

NetGCooP 2011 International Conference on NETwork Games, COntrol and OPtimization (2011).

On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints

Stefano Coniglio

PhD thesis from Dipartimento di Elettronica e Informazione, Politecnico di Milano (2011).

On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints

Stefano Coniglio

PhD thesis from Dipartimento di Elettronica e Informazione, Politecnico di Milano (2011).

The impact of the norm on the k-Hyperplane Clustering problem: relaxations, restrictions, approximation factors, and exact formulations

Stefano Coniglio

Proc. of the 10th Cologne-Twente Workshop on Graphs and Optimization (CTW) (2011).

On the Roman k-bondage number of a graph

N. Dehgardi, S.M. Sheikholeslami, Lutz Volkmann

AKCE Int. J. Graphs Combin. 8 (2011), 169-180.

Unique response Roman domination in graphs

E. Ebrahimi Targhi, N. Jafari Rad, Lutz Volkmann

Discrete Appl. Math. 159 (2011), 1110--1117.

Geodetic domination in graphs

R. Escuadro, N. Gera, Adriana Hansberg, N. Jafari Rad, Lutz Volkmann

J. Combin. Math. Combin. Comput. 77 (2011), 89--101.

Characterization of Roman domination critical unicyclic graphs

Adriana Hansberg, N. Jafari Rad, Lutz Volkmann

Util. Math. 86 (2011), 129-146.

Independence and k-domination in graphs

Adriana Hansberg, Dirk Meierling, Lutz Volkmann

Int. J. Comput. Math. 88 (2011), no. 5, 905--915.

2-domination in bipartite graphs with odd independence number

Adriana Hansberg, Lutz Volkmann

Australas. J. Combin. 51 (2011), 115-124.

On 2-domination and independence domination numbers of graphs

Adriana Hansberg, Lutz Volkmann

Ars Combin. 101 (2011), 405--415.

An Experimental Evaluation of Treewidth at most Four Reductions

A. Hein, Arie M.C.A. Koster

Proceedings of International Symposium on Experimental Algorithms (SEA 2011) (2011), 218--229.

On local connectivity of K(2,p)-free graphs

A. Holtkamp, Lutz Volkmann

Australas. J. Combin. 51 (2011), 29-40.

On the Roman bondage number of planar graphs

N. Jafari Rad, Lutz Volkmann

Graphs Combin. 27 (2011), 531--538.

Roman bondage in graphs

N. Jafari Rad, Lutz Volkmann

Discuss. Math. Graph Theory 31 (2011), 763-773.

Roman domination dot-critical trees

N. Jafari Rad, Lutz Volkmann

AKCE Int. J. Graphs Combin. 8 (2011), 75-83.

Roman domination perfect graphs

N. Jafari Rad, Lutz Volkmann

An. Stiint. Univ. ``Ovidius' Constanta Ser. Mat. 19 (2011), 167-174.

The Roman (k,k)-domatic number of a graph

A.P. Kazemi, S.M. Sheikholeslami, Lutz Volkmann

Ann. Math. Inform. 38 (2011), 45-57.

An Integer Linear Programming Model for Optimal Self Protection Multi-Path Selection

N.A. Kazmi, Arie M.C.A. Koster

Proceedings of RNDM 2011, Reliable Network Design and Modelling (2011).

Wiley Encyclopedia of Operations Research and Management Science Treewidth, Tree Decompositions, and Brambles

Arie M.C.A. Koster

In Wiley Encyclopedia of Operations Research and Management Science, Wiley (2011), .

An integrated model for survivable network design under demand uncertainty

Arie M.C.A. Koster, Manuel Kutschka

Design of Reliable Communication Networks (DRCN), 2011 8th International Workshop on the , IEEE Xplore (2011), 54--61 .

Network Design Under Demand Uncertainties: A Case Study on the Abilene and GEANT network data

Arie M.C.A. Koster, Manuel Kutschka

Tagungsband der 12. ITG-Fachtagung Photonische Netze, VDE Verlag GmbH (2011), 154--161.

Cutset Inequalities for Robust Network Design

Arie M.C.A. Koster, Manuel Kutschka, Christian Raack

Proceedings of INOC 2011, International Network Optimization Conference, Springer (2011), 118--123.

On the robustness of optimal network designs

Arie M.C.A. Koster, Manuel Kutschka, Christian Raack

Proceedings IEEE International Conference on Communications, ICC 2011, IEEE Xplore (2011), 1--5.

Robust Network Design: Formulations, Valid Inequalities, and Computations

Arie M.C.A. Koster, Manuel Kutschka, Christian Raack

Technical Report 11-34, Zuse Institute Berlin (2011).

Designing AC Power Grids using Integer Linear Programming

Arie M.C.A. Koster, Stephan Lemkens

Network Optimization, 5th International Conference, INOC 2011, Hamburg, Germany, Springer (2011), 478--483.

Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph

Dirk Meierling, S.M. Sheikholeslami, Lutz Volkmann

Appl. Math. Lett. 24 (2011), 1758--1761.

The {k}-domatic number of a graph

Dirk Meierling, S.M. Sheikholeslami, Lutz Volkmann

Aequationes Math. 82 (2011), 25--34.

On cut-based inequalities for capacitated network design polyhedra

Christian Raack, Arie M.C.A. Koster, S. Orlowski, R. Wessälly

Networks 57 (2011), 141--156.

Matchings in balanced hypergraphs

Robert Scheidweiler

PhD thesis from RWTH Aachen University (2011).

Matchings in balanced hypergraphs

Robert Scheidweiler, Eberhard Triesch

Proceedings of the 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Università di Roma "Tor Vergata" e "Roma Tre" (2011), 244--247.

Signed star k-domatic number of a graph

S.M. Sheikholeslami, Lutz Volkmann

Contribut. Discrete Math. 6 (2011), 20-31.

The (j,k)-domatic number of a graph

S.M. Sheikholeslami, Lutz Volkmann

AKCE Int. J. Graphs Combin. 8 (2011), 161-168.

The Roman domination number of a digraph

S.M. Sheikholeslami, Lutz Volkmann

Acta Univ. Apulensis Math. Inform 27 (2011), 77-86.

The Roman k-domatic number of a graph

S.M. Sheikholeslami, Lutz Volkmann

Acta Math. Sin. (Engl. Ser.) 27 (2011), 1899-1906.

Frequency Assignments in Slow Frequency-Hopping GSM Networks - A MIP Approach -

Master thesis from RWTH Aachen University (2011).

A note on signed total 2-independence in graphs

J. Tong, Lutz Volkmann, H.C. Wang

Util. Math. 85 (2011), 213--223.

Bounds on the k-tuple domatic number of a graph

Math. Slovaca 61 (2011), 851-858.

Bounds on the signed domatic number

Appl. Math. Lett. 24 (2011), 196--198.

Connected global offensive k-alliances in graphs

Discuss. Math. Graph Theory 31 (2011), 699-707.

Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number

Ars Combin. 99 (2011), 55--64.

Graphen an allen Ecken und Kanten

, RWTH Aachen (2011).

Nordhaus-Gaddum type results for domination sums in graphs with minimum degree at least four, five or six

Util. Math. 85 (2011), 113--127.

Signed domination and signed domatic numbers of digraphs

Discuss. Math. Graph Theory 31 (2011), 415--427.

Some remarks on degree sets of multigraphs

J. Combin. Math. Combin. Comput. 77 (2011), 45--49.

Upper bounds on the signed total domatic number of graphs

Discrete Appl. Math. 159 (2011), 832--837.