| 2009 |
|---|
| 73 | EE | Jochen Harant,
Dieter Rautenbach:
Domination in bipartite graphs.
Discrete Mathematics 309(1): 113-122 (2009) |
| 2008 |
|---|
| 72 | EE | Dieter Rautenbach:
A note on domination, girth and minimum degree.
Discrete Mathematics 308(11): 2325-2329 (2008) |
| 71 | EE | F. Dahme,
Dieter Rautenbach,
Lutz Volkmann:
alpha-Domination perfect trees.
Discrete Mathematics 308(15): 3187-3198 (2008) |
| 70 | EE | Dieter Rautenbach,
Lutz Volkmann:
Some remarks on lambdap, q-connectedness.
Discrete Mathematics 308(23): 5562-5569 (2008) |
| 69 | EE | Jochen Harant,
Michael A. Henning,
Dieter Rautenbach,
Ingo Schiermeyer:
The independence number in graphs of maximum degree three.
Discrete Mathematics 308(23): 5829-5833 (2008) |
| 68 | EE | Dieter Rautenbach,
Christian Szegedy,
Jürgen Werber:
On the cost of optimal alphabetic code trees with unequal letter costs.
Eur. J. Comb. 29(2): 386-394 (2008) |
| 67 | EE | Stephan Brandt,
Jozef Miskuf,
Dieter Rautenbach:
On a conjecture about edge irregular total labelings.
Journal of Graph Theory 57(4): 333-343 (2008) |
| 66 | EE | Dieter Rautenbach:
A conjecture of Borodin and a coloring of Grünbaum.
Journal of Graph Theory 58(2): 139-147 (2008) |
| 65 | EE | Dieter Rautenbach,
Lutz Volkmann:
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles.
Networks 52(4): 252-255 (2008) |
| 2007 |
|---|
| 64 | EE | Jürgen Werber,
Dieter Rautenbach,
Christian Szegedy:
Timing optimization by restructuring long combinatorial paths.
ICCAD 2007: 536-543 |
| 63 | EE | Dieter Rautenbach,
Lutz Volkmann:
New bounds on the k-domination number and the k-tuple domination number.
Appl. Math. Lett. 20(1): 98-102 (2007) |
| 62 | | Dieter Rautenbach:
Regular Weighted Graphs Without Positive Cuts.
Ars Comb. 84: (2007) |
| 61 | EE | Dieter Rautenbach,
Christian Szegedy,
Jürgen Werber:
The delay of circuits whose inputs have specified arrival times.
Discrete Applied Mathematics 155(10): 1233-1243 (2007) |
| 60 | EE | Michael A. Henning,
Dieter Rautenbach:
On the irregularity of bipartite graphs.
Discrete Mathematics 307(11-12): 1467-1472 (2007) |
| 59 | EE | Dieter Rautenbach:
Dominating and large induced trees in regular graphs.
Discrete Mathematics 307(24): 3177-3186 (2007) |
| 58 | EE | Yair Caro,
Dieter Rautenbach:
Reconstructing graphs from size and degree properties of their induced k-subgraphs.
Discrete Mathematics 307(6): 694-703 (2007) |
| 57 | EE | Frédéric Maffray,
Dieter Rautenbach:
Small step-dominating sets in trees.
Discrete Mathematics 307(9-10): 1212-1215 (2007) |
| 56 | EE | Vadim V. Lozin,
Dieter Rautenbach:
The relative clique-width of a graph.
J. Comb. Theory, Ser. B 97(5): 846-858 (2007) |
| 2006 |
|---|
| 55 | EE | Dogan Kesdogan,
Dakshi Agrawal,
Vinh Pham,
Dieter Rautenbach:
Fundamental Limits on the Anonymity Provided by the MIX Technique.
IEEE Symposium on Security and Privacy 2006: 86-99 |
| 54 | EE | Christoph Bartoschek,
Stephan Held,
Dieter Rautenbach,
Jens Vygen:
Efficient generation of short and fast repeater tree topologies.
ISPD 2006: 120-127 |
| 53 | EE | Klaus Meer,
Dieter Rautenbach:
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.
IWPEC 2006: 72-83 |
| 52 | EE | Dieter Rautenbach:
Some remarks about leaf roots.
Discrete Mathematics 306(13): 1456-1461 (2006) |
| 51 | EE | Kefeng Diao,
Guizhen Liu,
Dieter Rautenbach,
Ping Zhao:
A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2.
Discrete Mathematics 306(7): 670-672 (2006) |
| 50 | EE | Dieter Rautenbach:
A Conjecture of Borodin and a Coloring of Grünbaum.
Electronic Notes in Discrete Mathematics 24: 187-194 (2006) |
| 49 | EE | Dieter Rautenbach,
Andreas Brandstädt,
Van Bang Le:
Distance-Hereditary 5-Leaf Powers.
Electronic Notes in Discrete Mathematics 27: 85-86 (2006) |
| 48 | EE | Dieter Rautenbach,
Ingo Schiermeyer:
Extremal Problems for Imbalanced Edges.
Graphs and Combinatorics 22(1): 103-111 (2006) |
| 47 | EE | Dieter Rautenbach,
Christian Szegedy,
Jürgen Werber:
Delay optimization of linear depth boolean circuits with prescribed input arrival times.
J. Discrete Algorithms 4(4): 526-537 (2006) |
| 2005 |
|---|
| 46 | | Miranca Fischermann,
Dieter Rautenbach,
Lutz Volkmann:
Extremal Trees with Respect to Dominance Order.
Ars Comb. 76: (2005) |
| 45 | EE | Miranca Fischermann,
Lutz Volkmann,
Dieter Rautenbach:
A note on the number of matchings and independent sets in trees.
Discrete Applied Mathematics 145(3): 483-489 (2005) |
| 44 | EE | Angelika Hellwig,
Dieter Rautenbach,
Lutz Volkmann:
Cuts leaving components of given minimum order.
Discrete Mathematics 292(1-3): 55-65 (2005) |
| 43 | EE | Dieter Rautenbach,
Irene Stella:
On the maximum number of cycles in a Hamiltonian graph.
Discrete Mathematics 304(1-3): 101-107 (2005) |
| 42 | EE | Dieter Rautenbach:
Lower bounds on treespan.
Inf. Process. Lett. 96(2): 67-70 (2005) |
| 2004 |
|---|
| 41 | EE | Miranca Fischermann,
Werner Knoben,
Dirk Kremer,
Dieter Rautenbach:
Competition polysemy.
Discrete Mathematics 282(1-3): 251-255 (2004) |
| 40 | EE | Miranca Fischermann,
Werner Knoben,
Dirk Kremer,
Dieter Rautenbach:
The solution of two problems on bound polysemy.
Discrete Mathematics 282(1-3): 257-261 (2004) |
| 39 | EE | Vadim V. Lozin,
Dieter Rautenbach:
Chordal bipartite graphs of bounded tree- and clique-width.
Discrete Mathematics 283(1-3): 151-158 (2004) |
| 38 | EE | Dieter Rautenbach:
Propagation of Mean Degrees.
Electr. J. Comb. 11(1): (2004) |
| 37 | EE | Dieter Rautenbach:
Rectilinear Spanning Trees Versus Bounding Boxes.
Electr. J. Comb. 11(1): (2004) |
| 36 | EE | Angelika Hellwig,
Dieter Rautenbach,
Lutz Volkmann:
Note on the connectivity of line graphs.
Inf. Process. Lett. 91(1): 7-10 (2004) |
| 35 | EE | Miranca Fischermann,
Werner Knoben,
Dirk Kremer,
Dieter Rautenbach:
The Numbers of Shared Upper Bounds Determine a Poset.
Order 21(2): 131-135 (2004) |
| 34 | EE | Vadim V. Lozin,
Dieter Rautenbach:
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree.
SIAM J. Discrete Math. 18(1): 195-206 (2004) |
| 2003 |
|---|
| 33 | | Dieter Rautenbach:
Four traps are almost always enough to catch a square-celled animal.
Ars Comb. 66: (2003) |
| 32 | | Dieter Rautenbach:
Finite sets in Rn given up to translation have reconstruction number three.
Ars Comb. 68: (2003) |
| 31 | EE | Miranca Fischermann,
Arne Hoffmann,
Dieter Rautenbach,
Lutz Volkmann:
A Linear-programming Approach to the Generalized Randic Index.
Discrete Applied Mathematics 128(2-3): 375-385 (2003) |
| 30 | EE | Charles Delorme,
Odile Favaron,
Dieter Rautenbach:
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees.
Discrete Applied Mathematics 130(3): 503-512 (2003) |
| 29 | EE | Miranca Fischermann,
Dieter Rautenbach,
Lutz Volkmann:
Maximum graphs with a unique minimum dominating set.
Discrete Mathematics 260(1-3): 197-203 (2003) |
| 28 | EE | Miranca Fischermann,
Dieter Rautenbach,
Lutz Volkmann:
Remarks on the bondage number of planar graphs.
Discrete Mathematics 260(1-3): 57-67 (2003) |
| 27 | EE | Dieter Rautenbach,
Lutz Volkmann:
Extremal subgraphs with respect to vertex degree bounds.
Discrete Mathematics 263(1-3): 297-303 (2003) |
| 26 | EE | Dieter Rautenbach,
Lutz Volkmann:
On alphargammas(k)-perfect graphs.
Discrete Mathematics 270(1-3): 240-249 (2003) |
| 25 | EE | Dieter Rautenbach:
A note on trees of maximum weight and restricted degrees.
Discrete Mathematics 271(1-3): 335-342 (2003) |
| 24 | EE | Vadim V. Lozin,
Dieter Rautenbach:
Some results on graphs without long induced paths.
Inf. Process. Lett. 88(4): 167-171 (2003) |
| 2002 |
|---|
| 23 | | Miranca Fischermann,
Arne Hoffmann,
Dieter Rautenbach,
László A. Székely,
Lutz Volkmann:
Wiener index versus maximum degree in trees.
Discrete Applied Mathematics 122(1-3): 127-137 (2002) |
| 22 | EE | Dieter Rautenbach:
On Kelly's lemma for infinite sets of integers.
Discrete Mathematics 245(1-3): 279-282 (2002) |
| 21 | EE | Peter Dankelmann,
Dieter Rautenbach,
Lutz Volkmann:
Weighted domination in triangle-free graphs.
Discrete Mathematics 250(1-3): 233-239 (2002) |
| 20 | EE | Dieter Rautenbach:
Reconstructing infinite objects.
Discrete Mathematics 250(1-3): 273-279 (2002) |
| 19 | EE | Charles Delorme,
Odile Favaron,
Dieter Rautenbach:
On the Randic Image index.
Discrete Mathematics 257(1): 29-38 (2002) |
| 18 | EE | Charles Delorme,
Odile Favaron,
Dieter Rautenbach:
On the reconstruction of the degree sequence.
Discrete Mathematics 259(1-3): 293-300 (2002) |
| 17 | EE | Dieter Rautenbach,
Lutz Volkmann:
Independent domination and matchings in graphs.
Discrete Mathematics 259(1-3): 325-330 (2002) |
| 16 | EE | Dieter Rautenbach,
Eberhard Triesch:
Reconstruction up to isometries.
Discrete Mathematics 259(1-3): 331-336 (2002) |
| 15 | EE | Dieter Rautenbach:
On a Reconstruction Problem of Harary and Manvel.
J. Comb. Theory, Ser. A 99(1): 32-39 (2002) |
| 14 | EE | Dieter Rautenbach,
Eberhard Triesch:
Reconstructing Infinite Sets of Integers.
J. Comb. Theory, Ser. A 99(2): 297-306 (2002) |
| 2001 |
|---|
| 13 | EE | Dieter Rautenbach,
Bruce A. Reed:
Approximately covering by cycles in planar graphs.
SODA 2001: 402-406 |
| 12 | EE | Dieter Rautenbach,
Bruce A. Reed:
The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs.
Combinatorica 21(2): 267-278 (2001) |
| 11 | EE | Dieter Rautenbach,
Vadim E. Zverovich:
Perfect graphs of strong domination and independent strong domination.
Discrete Mathematics 226(1-3): 297-311 (2001) |
| 10 | EE | Odile Favaron,
Michael A. Henning,
Joël Puech,
Dieter Rautenbach:
On domination and annihilation in graphs with claw-free blocks.
Discrete Mathematics 231(1-3): 143-151 (2001) |
| 9 | EE | Dieter Rautenbach:
On vertex orderings and the stability number in triangle-free graphs.
Discrete Mathematics 231(1-3): 411-420 (2001) |
| 8 | EE | Lothar Dohmen,
Dieter Rautenbach,
Lutz Volkmann:
i gamma(1)-perfect graphs.
Discrete Mathematics 234(1-3): 133-138 (2001) |
| 7 | EE | Dieter Rautenbach:
Reconstructing Finite Sets of Points in Rnup to Groups of Isometries.
Eur. J. Comb. 22(8): 1139-1147 (2001) |
| 2000 |
|---|
| 6 | EE | Dieter Rautenbach:
Bounds on the strong domination number.
Discrete Mathematics 215: 201-212 (2000) |
| 5 | EE | Lothar Dohmen,
Dieter Rautenbach,
Lutz Volkmann:
A characterization of rho alpha(k)-perfect graphs.
Discrete Mathematics 224(1-3): 265-271 (2000) |
| 4 | EE | Peter Dankelmann,
Dieter Rautenbach,
Lutz Volkmann:
Some results on graph parameters in weighted graphs.
Electronic Notes in Discrete Mathematics 5: 85-88 (2000) |
| 1999 |
|---|
| 3 | EE | Dieter Rautenbach:
The influence of special vertices on strong domination.
Discrete Mathematics 197-198: 683-690 (1999) |
| 2 | EE | Dieter Rautenbach:
On the differences between the upper irredundance, upper domination and independence numbers of a graph.
Discrete Mathematics 203(1-3): 239-252 (1999) |
| 1998 |
|---|
| 1 | EE | Dieter Rautenbach,
Lutz Volkmann:
The domatic number of block-cactus graphs.
Discrete Mathematics 187(1-3): 185-193 (1998) |
