Desktop-Bild

Publikationen

Publikationen 2010
Optimization models for injured people evacuation in medium/maxi health-care emer- gencies  
Edoardo Amaldi, Stefano Coniglio, Claudio Iuliano
Proc. of the 1st IEEE Workshop on Health Care Management (WHCM) (2010).
Single and multi-group evacuation in medium and maxi health-care emergencies  
Edoardo Amaldi, Stefano Coniglio, Claudio Iuliano
Proc. of the 26th Operations Research Applied to Health Services Conference (ORAHS) (2010).
Signed star domatic number of a graph  
M. Atapour, A.N. Ghameshlou, S.M. Sheikholeslami, Lutz Volkmann
Discrete Appl. Math. 158 (2010), 213--218.
The signed k-domination number of directed graphs  
M. Atapour, R. Hajypory, S.M. Sheikholeslami, Lutz Volkmann
Cent. Eur. J. Math. 8 (2010), 1048--1057.
Treewidth Computations I: Upper Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster
Information and Computation 208 (2010), 259-275.
Treewidth Computations II: Lower Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster
Technical Report UU-CS-2010, Utrecht University (2010).
Graphen-und Netzwerkoptimierung  
Christina Büsing
, Spektrum (2010).
Recoverable Robust Knapsacks: the Discrete Scenario Case  
Christina Büsing, Arie M.C.A. Koster, Manuel Kutschka
Technical Report 018-2010, Technische Universität Berlin (2010).
Robust Algorithms for Sorting Railway Cars  
Christina Büsing, J. Maue
Algorithms -- EAS 2010 6346 (2010), 350 -- 361.
On the p-domination, the total domination and the connected domination numbers of graphs  
Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann
J. Combin. Math. Combin. Comput. 73 (2010), 65--75.
k-Independence stable graphs upon edge removal  
Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann
Discuss. Math. Graph Theory 30 (2010), 265--274.
Independence and global offensive alliance in graphs  
Mustapha Chellali, Lutz Volkmann
Australas. J. Combin 47 (2010), 125--131.
Improving cutting plane generation with 0-1 inequalities by bi-criteria separation  
Stefano Coniglio, Edoardo Amaldi, Stefano Gualandi
Proc. of the 9th International Symposium on Experimental Algorithms (SEA) (2010).
The diameter of almost Eulerian digraphs  
Peter Dankelmann, Lutz Volkmann
Electron. J. Combin. 17 (2010), no. R 157, 11 pp.
Proof of a conjecture on game domination  
Odile Favaron, H. Karami, R. Khoeilar, S.M. Sheikholeslami, Lutz Volkmann
J. Graph Theory 64 (2010), 323--329.
Signed (b,k)-matchings in graphs  
A.N. Ghameshlou, R. Saei, S.M. Sheikholeslami, Lutz Volkmann
An. Stiint. Univ. ``Ovidius" Constanta Ser. Mat. 18 (2010), no. (1), 127--138.
A general method in the theory of domination in graphs  
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
Int. J. Comput. Math. 87 (2010), no. 13, 2915--2924.
On the geodetic and geodetic domination numbers of a graph  
Adriana Hansberg, Lutz Volkmann
Discrete Math. 310 (2010), 2140--2146.
On local connectivity of graphs with given clique number  
A. Holtkamp, Lutz Volkmann
J. Graph Theory 63 (2010), 192--197.
Towards Robust Network Design using Integer Linear Programming Techniques  
Arie M.C.A. Koster, Manuel Kutschka, Christian Raack
Proceedings Next Generation Internet, NGI 2010, IEEE Xplore (2010).
Graphs and Algorithms in Communication Networks on Seven League Boots  
Arie M.C.A. Koster, X. Muñoz
In Graphs and Algorithms in Communication Networks, Springer Berlin Heidelberg (Koster, Arie M.C.A. and Muñoz, X., eds.) (2010), 1--59.
Branch-and-cut techniques for solving realistic two-layer network designproblems  
Arie M.C.A. Koster, S. Orlowski, Christian Raack, G. Baier, T. Engel, P. Belotti
In Graphs and Algorithms in Communication Networks, Springer Berlin Heidelberg (Koster, Arie M.C.A. and Muñoz, X., eds.) (2010), 95--118.
Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three   Mei10.pdf Mei10.pdf
Dirk Meierling
Discrete Math. 310 (2010), no. 13-14, 1940--1948.
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments  
Dirk Meierling
J. Graph Theory 63 (2010), no. 1, 82--92.
Cycle factors in strongly connected local tournaments  
Dirk Meierling, Lutz Volkmann
Discrete Math. 310 (2010), no. 4, 850--860.
Signed (k,k)-domatic number of a graph  
S.M. Sheikholeslami, Lutz Volkmann
Ann. Math. Inform. 37 (2010), 139--149.
Signed total (k,k)-domatic number of a graph  
S.M. Sheikholeslami, Lutz Volkmann
AKCE Int. J. Graphs Comb. 7 (2010), 189--199.
Signed total k-domination numbers of directed graphs  
S.M. Sheikholeslami, Lutz Volkmann
An. Stiint. Univ. ``Ovidius" Constanta Ser. Mat. 18 (2010), no. (2), 241--252.
The Roman domatic number of a graph  
S.M. Sheikholeslami, Lutz Volkmann
Appl. Math. Lett. 23 (2010), 1295--1300.
A Better Bouncer’s Algorithm  
Eberhard Triesch, Ferdinando Cicalese, Travis Gagie, Anthony J. Macula
Proceedings
An asymptotic bound for the complexity of monotone graph properties  
Eberhard Triesch, Torsten Korneffel
Combinatorica 30 (2010), no. 6, 735-743.
A bound on the k-domination number of a graph  
Lutz Volkmann
Czechoslovak Math. J. 60 (2010), 77--83.
Nordhaus-Gaddum bounds for domination sums of graphs with minimum degree at least two or three  
Lutz Volkmann
Util. Math. 82 (2010), 3--10.
On almost 1-extendable graphs  
Lutz Volkmann
Australas. J. Combin. 47 (2010), 83--89.
Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number  
Lutz Volkmann
Ars Combin. 96 (2010), 105--114.
On the path covering number of given subdigraphs of regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
J. Combin. Math. Combin. Comput. 72 (2010), 211--230.
Smallest close to regular bipartite graphs without an almost perfect matching  
Lutz Volkmann, Axel Zingsem
Acta Math. Sin. (Engl. Ser.) 26 (2010), 1403--1412.