Desktop-Bild

Publications

Publications 2007
Models and Solution Techniques for the Frequency Assignment Problem  
K.I. Aardal, C.P.M. van Hoesel, Arie M.C.A. Koster, C. Mannino, A. Sassano
Annals of Operations Research 153 (2007), 79--129.
Total and connected domination in digraphs  
S. Arumugam, K. Jacob, Lutz Volkmann
Australas. J. Combin. 39 (2007), 283--292.
On the Maximum Cardinality Search Lower Bound for Treewidth  
Hans L. Bodlaender, Arie M.C.A. Koster
Discrete Applied Mathematics 155 (2007), 1348--1372.
On the connectivity of diamond-free graphs  
Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
Discrete Appl. Math. 155 (2007), no. 16, 2111--2117.
Average distance in bipartite tournaments  
Peter Dankelmann, Lutz Volkmann
Ars Combin. 83 (2007), 295--306.
Graph and 2-D systems approach in gas transport network modeling  
Siarhei Dymkou, Gerhard Jank, Teresa Paula Azevedo-Perdicoúlis
Int. J. Tomogr. Stat. 6 (2007), no. S07, 21--26.
Safe reduction rules for weighted treewidth  
F. van den Eijkhof, Hans L. Bodlaender, Arie M.C.A. Koster
Algorithmica 47 (2007), no. 2, 139--158.
Factoring logic functions using star-colorings  
Tatjana Gerzen, Bert Randerath
Australas. J. Combin. 39 (2007), 115--127.
Distance domination and distance irredundance in graphs  
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
Electron. J. Combin. 14 (2007), no. R 35, 10 pp.
Characterization of block graphs with equal 2-domination number and domination number plus one  
Adriana Hansberg, Lutz Volkmann
Discuss. Math. Graph Theory 27 (2007), no. 1, 93--103.
A disturbed Nash game approach for gas network optimization  
Gerhard Jank, Teresa Paula Azevedo-Perdicoúlis
Int. J. Tomogr. Stat. 7 (2007), no. F07, 43--48.
On the order of certain close to regular graphs without a matching of given size  
Sabine Klinkenberg, Lutz Volkmann
Czechoslovak Math. J. 57(132) (2007), no. 3, 907--918.
On the order of close to regular graphs without a matching of given size  
Sabine Klinkenberg, Lutz Volkmann
Ars Combin. 85 (2007), 99--106.
Algorithms to separate ${0,frac{1}{2}}$ Chvátal-Gomory cuts  
Arie M.C.A. Koster, Manuel Kutschka, A. Zymolka
Technical Report 07--10, Zuse Institute Berlin (2007).
Single-layer Cuts for Multi-layer Network Design Problems  
Arie M.C.A. Koster, S. Orlowski, Christian Raack, G. Baier, T. Engel
Technical Report 07--21, ZIB (2007).
A Routing and Network Dimensioning Strategy to reduce Wavelength Continuity Conflicts in All-Optical Networks  
Arie M.C.A. Koster, M. Scheffel
Proceedings of INOC 2007, International Network Optimization Conference (2007).
Demand-wise Shared Protection and Multiple Failures  
Arie M.C.A. Koster, A. Zymolka
Proceedings of INOC 2007, International Network Optimization Conference (2007).
Tight LP-based Lower Bounds for Wavelength Conversion in Optical Networks  
Arie M.C.A. Koster, A. Zymolka
Statistica Neerlandica 61 (2007), no. 1, 115--136.
Algorithms to separate $\{0,\frac{1}{2}\}$ Chvátal-Gomory cuts  
Arie M.C.A. Koster, A. Zymolka, Manuel Kutschka
Proceedings 15th Annual European Symposium on Algorithms, ESA2007, Springer, Lecture Notes in Computer Science (2007), 693--704.
Algorithmen zur Separierung von ${0,frac{1}{2}}$-Schnitten  
Manuel Kutschka
Master thesis from Technische Universität Berlin (2007).
Local Tournaments and In-Tournaments  
Dirk Meierling
PhD thesis from RWTH Aachen University (2007).
On the number of nonseparating vertices in strongly connected local tournaments  
Dirk Meierling, Lutz Volkmann
Australas. J. Combin. 39 (2007), 301--315.
Overview of resilience mechanisms based on multipath structures  
M. Menth, R. Martin, Arie M.C.A. Koster, S. Orlowski
Proceedings of DRCN 2007, Design of Reliable Communication Networks (2007).
Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics  
S. Orlowski, Arie M.C.A. Koster, Christian Raack, R. Wessälly
Proceedings of INOC 2007, International Network Optimization Conference (2007).
Capacitated network design using general flow-cutset inequalities  
Christian Raack, Arie M.C.A. Koster, S. Orlowski, R. Wessälly
Proceedings of INOC 2007, International Network Optimization Conference (2007).
On the strength of cut-based inequalities for capacitated network design polyhedra  
Christian Raack, Arie M.C.A. Koster, R. Wessälly
Technical Report 07--08, ZIB (2007).
New bounds on the k-domination number and the k-tuple domination number  
Dieter Rautenbach, Lutz Volkmann
Appl. Math. Lett. 20 (2007), no. 1, 98--102.
Each regular 3-partite tournament has a 9-cycle  
Irene Stella, Lutz Volkmann
An. Univ. Bucurecsti Mat. 56 (2007), no. 1, 91--120.
Strongly 4-path-connectivity in almost regular multipartite tournaments  
Irene Stella, Lutz Volkmann, Stefan Winzen
Discrete Math. 307 (2007), no. 24, 3213--3219.
A remark on cycles through an arc in strongly connected multipartite tournaments  
Lutz Volkmann
Appl. Math. Lett. 20 (2007), no. 11, 1148--1150.
A short proof of a theorem of Kano and Yu on factors in regular graphs  
Lutz Volkmann
Electron. J. Combin. 14 (2007), no. 1, note 10, 2 pp. .
Local-edge-connectivity in digraphs and oriented graphs  
Lutz Volkmann
Discrete Math. 307 (2007), no. 24, 3207--3212.
Lower bounds on the vertex-connectivity of oriented graphs and bipartite oriented graphs  
Lutz Volkmann
Util. Math. 73 (2007), 45--54.
Multipartite tournaments: a survey  
Lutz Volkmann
Discrete Math. 307 (2007), no. 24, 3097--3129.
Restricted arc-connectivity of digraphs  
Lutz Volkmann
Inform. Process. Lett. 103 (2007), no. 6, 234--239.
Some remarks on lower bounds on the p-domination number in trees  
Lutz Volkmann
J. Combin. Math. Combin. Comput. 61 (2007), 159--167.
Cycles through a given set of vertices in regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
J. Korean Math. Soc. 44 (2007), no. 3, 683--695.