Desktop-Bild

Publications

Publications 2008
2-domination subdivision number of graphs  
M. Atapour, Adriana Hansberg, A. Khodkar, S.M. Sheikholeslami, Lutz Volkmann
AKCE Int. J. Graphs Comb. 5 (2008), no. 2, 169-177.
Treewidth Lower Bounds with Brambles  
Hans L. Bodlaender, A. Grigoriev, Arie M.C.A. Koster
Algorithmica 51 (2008), 81--98.
Combinatorial Optimisation on Graphs of bounded Treewidth  
Hans L. Bodlaender, Arie M.C.A. Koster
The Computer Journal 51 (2008), no. 3, 255--269.
Treewidth Computations I: Upper Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster
Technical Report UU-CS-2008, Utrecht University (2008).
Qualitative properties and stabilizability of a model for blood thrombin formation  
S. Cunha Orfao, Gerhard Jank, K. Mottaghy, S. Walcher, E. Zerz
J. Math. Anal. Appl. 346 (2008), no. 1, 218--226.
alpha-domination perfect trees  
Franz Dahme, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 308 (2008), no. 15, 3187--3198.
On k-domination and minimum degree in graphs  
Odile Favaron, Adriana Hansberg, Lutz Volkmann
J. Graph Theory 57 (2008), no. 1, 33--40.
Independence and 2-domination in bipartite graphs  
Jun Fujisawa, Adriana Hansberg, Takahiro Kubo, Akira Saito, Masahide Sugita, Lutz Volkmann
Australas. J. Combin. 40 (2008), 265--268.
Holomorphic functions in the plane and $n$-dimensional space  
Klaus Gürlebeck, Klaus Habetha, Wolfgang Sprößig
, Birkh (2008).
Characterization of unicyclic graphs with equal 2-domination number and domination number plus one  
Adriana Hansberg, Lutz Volkmann
Util. Math. 77 (2008), 265--276.
On graphs with equal domination and 2-domination numbers  
Adriana Hansberg, Lutz Volkmann
Discrete Math. 308 (2008), no. 11, 2277--2281.
Maximally edge-connected and vertex-connected graphs and digraphs: a survey  
Angelika Hellwig, Lutz Volkmann
Discrete Math. 308 (2008), no. 15, 3265--3296.
The connectivity of a graph and its complement  
Angelika Hellwig, Lutz Volkmann
Discrete Appl. Math. 156 (2008), no. 17, 3325--3328.
A remark on the (2,2)-domination number  
Torsten Korneffel, Dirk Meierling, Lutz Volkmann
Discuss. Math. Graph Theory 28 (2008), no. 2, 361--366.
Single-Layer Cuts for Multi-Layer Network Design Problems  
Arie M.C.A. Koster, S. Orlowski, Christian Raack, G. Baier, T. Engel
In Telecommunications Modeling, Policy, and Technology, Springer (S. Raghavan, Bruce Golden, Edward Wasil, eds.) (2008), 1--23.
Benchmarking RWA Strategies for Dynamically Controlled Optical Networks  
Arie M.C.A. Koster, S. Ruepp
Proceedings of the 13th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2008) (2008).
Comparing Imperfection Ratio and Imperfection Index for Graph Classes  
Arie M.C.A. Koster, A.K. Wagler
RAIRO -- Operations Research 42 (2008), 485--500.
All 2-connected in-tournaments that are cycle complementary  
Dirk Meierling, Lutz Volkmann
Discrete Math. 308 (2008), no. 11, 2115--2133.
On arc-traceable local tournaments  
Dirk Meierling, Lutz Volkmann
Discrete Math. 308 (2008), no. 24, 6513--6526.
Restricted arc-connectivity of generalized tournaments  
Dirk Meierling, Lutz Volkmann, Stefan Winzen
Australas. J. Combin. 40 (2008), 269--278.
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles  
Dieter Rautenbach, Lutz Volkmann
Networks 52 (2008), no. 4, 252--255.
Some remarks on lambda(p,q)-connectedness  
Dieter Rautenbach, Lutz Volkmann
Discrete Math. 308 (2008), no. 23, 5562--5569.
How close to regular must a multipartite tournament be to secure a given path covering number?  
Irene Stella, Lutz Volkmann, Stefan Winzen
Ars Combin. 87 (2008), 359--375.
A characterization of bipartite graphs with independence number half their order  
Lutz Volkmann
Australas. J. Combin. 41 (2008), 219--222.
A Nordhaus-Gaddum-type result for the 2-domination number  
Lutz Volkmann
J. Combin. Math. Combin. Comput. 64 (2008), 227--235.
On local connectivity of graphs  
Lutz Volkmann
Appl. Math. Lett. 21 (2008), no. 1, 63--66.
Almost regular c-partite tournaments contain a strong subtournament of order c when c>=5  
Lutz Volkmann, Stefan Winzen
Discrete Math. 308 (2008), no. 9, 1710--1721.
Strong subtournaments containing a given vertex in regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Discrete Math. 308 (2008), no. 23, 5516--5521.
Weakly complementary cycles in 3-connected multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Kyungpook Math. J. 48 (2008), no. 2, 287--302.
On the order of almost regular bipartite graphs without perfect matchings  
Lutz Volkmann, Axel Zingsem
Australas. J. Combin. 42 (2008), 165--170.