Lehr- und Forschungsgebiet Diskrete Optimierung

Total alpha-domination in graphs

Z. Alibeigi, N. Jafari Rad, Dirk Meierling, Lutz Volkmann

Bull. Inst. Combin. Appl. 66 (2012), 72--88.

k-Piecewise Affine Model Fitting: Heuristics based on multiway linear classification

Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari

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

On the total domatic number of regular graphs

Hamideh Aram, S.M. Sheikholeslami, Lutz Volkmann

Transactions on Combinatorics 1 (2012), no. 1, 45-51.

The distance Roman domatic number of a graph

Hamideh Aram, S.M. Sheikholeslami, Lutz Volkmann

AKCE Int. J. Graphs Comb. 9 (2012), no. 2, 205-212.

Upper signed k-domination number of directed graphs

Hamideh Aram, Lutz Volkmann, S.M. Sheikholeslami

Acta Math. Univ. Comenianae 81 (2012), no. 1, 9-14.

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

Hans L. Bodlaender, F.V. Fomin, Arie M.C.A. Koster, D. Kratsch, D.M. Thilikos

Theory of Computing Systems 50 (2012), no. 3, 420--432.

On exact algorithms for treewidth

Hans L. Bodlaender, F.V. Fomin, Arie M.C.A. Koster, D. Kratsch, D.M. Thilikos

ACM Transactions on Algorithms 9 (2012), no. 1, Art 12.

Recoverable robust shortest path problem

Christina Büsing

Networks 59 (2012), no. 1, 181 -- 189.

Kreuz und quer durchs Land der Graphen : Projekte aus der Graphentheorie für Schülerinnen und Schüler

Christina Büsing, Georg Hoever

Der Mathematikunterricht (2012), 52-63.

k-Domination and k-Independence in Graphs: A Survey

Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann

Graphs Combin. 28 (2012), no. 1, 1-55.

Some results on Roman domination edge critical graphs

Mustapha Chellali, N. Jafari Rad, Lutz Volkmann

AKCE Int. J. Graphs Comb. 9 (2012), no. 2, 195-203.

Global offensive k-alliance in bipartite graphs

Mustapha Chellali, Lutz Volkmann

Opuscula Math. 32 (2012), no. 1, 83-89.

New results about multi-band uncertainty in robust optimization

Fabio Dandreagiovanni, Christina Büsing

International Symposium on Experimental Algorithms (2012), 63--74.

Vertex-removal in alpha-domination

N. Jafari Rad, Lutz Volkmann

FILOMAT 26 (2012), 1257--1262.

Formulations and algorithms for multipath selection problem for network routing

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

Proceedings of RNDM 2012, IEEE (2012), 738 -744.

BMBF Project ROBUKOM: Robust Communication Networks

Arie M.C.A. Koster, C. Helmberg, A. Bley, M. Grötschel, T. Bauschert

Proceedings of the 12th Würzburg Workshop on IP: ITG Workshop "Visions of Future Generation Networks" (EuroView2012) (2012).

Column Generation for Frequency Assignment in Slow Frequency Hopping Networks

Arie M.C.A. Koster, Martin Tieves

EURASIP Journal on Wireless Communications and Networking (2012), no. 253, 1-14.

k-restricted edge-connectivity in triangle-free graphs

Dirk Meierling, A. Holtkamp, Luis Pedro Montejano

Discrete Appl. Math. 160 (2012), no. 9, 1345-1355.

Maximally connected graphs

Dirk Meierling, Lutz Volkmann

In Topics in Structural Graph Theory, Cambrige University Press (L.W. Beineke and R. Wilson, eds.) (2012), 40--70.

Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected

Dirk Meierling, Lutz Volkmann

Discrete Appl. Math. 160 (2012), no. 12, 1775-1781.

New Estimations of the Gap-k-coloring Number

Robert Scheidweiler, Eberhard Triesch

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Universität der Bundeswehr München (2012), 240--244.

Signed distance k-domatic numbers of graphs