Desktop-Bild

Publikationen

Publikationen 2009
An adaptive point-reassignment metaheuristic for the k-hyperplane clustering problem  
Edoardo Amaldi, Stefano Coniglio
Proc. of 8th Metaheuristc International Conference (MIC) (2009).
k-hyperplane clustering problem: column generation and a metaheuristic  
Edoardo Amaldi, Stefano Coniglio, Kanika Dhyani
Proc. of the 8th Cologne-Twente Workshop on Graphs and Optimization (CTW) (2009).
The Exact Subgraph Recoverable Robust Shortest Path Problem  
Christina Büsing
In Robust and Online Large-Scale Optimization, Springer (2009), 231 -- 248.
Bounds on the global offensive k-alliance number in graphs  
Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann
Discuss. Math. Graph Theory, 29 (2009), 597--613.
Global offensive alliance numbers in graphs with emphasis on trees  
Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann
Australas. J. Combin. 45 (2009), 87--96.
Inverse degree and edge-connectivity  
Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
Discrete Math. 309 (2009), 2943--2947.
Minimum size of a graph or digraph of given radius  
Peter Dankelmann, Lutz Volkmann
Inform. Process. Lett. 109 (2009), 971--973.
Searching for an edge in a graph with restricted test sets  
Tatjana Gerzen
Discrete Math. 309 (2009), no. 6, 1334--1346.
A characterization of even order trees with domination number half their order minus one  
Adriana Hansberg, Lutz Volkmann
Australas. J. Combin. 44 (2009), 247--254.
Lower bounds on the p-domination number in terms of cycles and matching number  
Adriana Hansberg, Lutz Volkmann
J. Combin. Math. Combin. Comput. 68 (2009), 245--255.
Upper bounds on the k-domination number and the k-Roman domination number  
Adriana Hansberg, Lutz Volkmann
Discrete Appl. Math. 157 (2009), no. 7, 1634--1639.
Complementary cycles in regular multipartite tournaments, where one cycle has length five  
Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen
Discrete Math. 309 (2009), 3131--3149.
On the connectivity of p-diamond-free graphs  
A. Holtkamp, Lutz Volkmann
Discrete Math. 309 (2009), 6065--6069.
Roman k-domination in graphs  
K. Kaemmerling, Lutz Volkmann
J. Korean Math. Soc. 46 (2009), 1309--1318.
The k-domatic number of a graph  
K. Kaemmerling, Lutz Volkmann
Czechoslovak Math. J. 59 (2009), 539--550.
Multi-commodity Single Path Routing with submodular bandwidth consumption  
Arie M.C.A. Koster, Manuel Kutschka
Proceedings of INOC 2009 (2009).
Algorithms to separate $\{0,\frac{1}{2}\}$ Chvátal-Gomory cuts  
Arie M.C.A. Koster, A. Zymolka, Manuel Kutschka
Algorithmica 55 (2009), 375--391.
Approximationserhaltende Reduktionen und ihre Anwendungen  
Stephan Lemkens
Master thesis from RWTH Aachen (2009).
Parity and disparity subgraphs  
Terry A. McKee, Lutz Volkmann
Discrete Math. 309 (2009), no. 8, 2608--2612.
On the number of nonseparating vertices in strongly connected in-tournaments  
Dirk Meierling
Australas. J. Combin. 44 (2009), 123--152.
Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments  
Dirk Meierling
J. Graph Theory 60 (2009), no. 2, 130--148.
A remark on degree sequences of multigraphs  
Dirk Meierling, Lutz Volkmann
Math. Methods Oper. Res. 69 (2009), no. 2, 369--374.
On the number of cycles in local tournaments  
Dirk Meierling, Lutz Volkmann
Discrete Math. 309 (2009), no. 8, 2042--2052.
The signed domatic number of some regular graphs  
Dirk Meierling, Lutz Volkmann, Stephan Zitzen
Discrete Appl. Math. 157 (2009), no. 8, 1905--1912.
An integer set-packing problem arising in two-layer network design  
Christian Raack, Arie M.C.A. Koster
Proceedings of INOC 2009 (2009).
On the existence of edge cuts leaving several large components  
Dieter Rautenbach, Lutz Volkmann
Discrete Math. 309 (2009), no. 6, 1703--1707.
Prioritizing connection requests in GMPLS-controlled optical networks  
S. Ruepp, Arie M.C.A. Koster, N. Andriolli, A. V. Manolova
International Conference on Photonics in Switching, PS'09 (2009), 1-2.
Connected p-domination in graphs  
Lutz Volkmann
Util. Math. 79 (2009), 81--90.
Degree sequence conditions for super-edge-connected oriented graphs  
Lutz Volkmann
J. Combin. Math. Combin. Comput. 68 (2009), 193--204.
On regular (1,q)-extendable graphs  
Lutz Volkmann
Australas. J. Combin. 45 (2009), 207--215.
Some remarks on the signed domatic number of graphs with small minimum degree  
Lutz Volkmann
Appl. Math. Lett. 22 (2009), 1166--1169.
Every cycle-connected multipartite tournament has a universal arc  
Lutz Volkmann, Stefan Winzen
Discrete Math. 309 (2009), no. 4, 1013--1017.