Search the dblp DataBase
Dieter Rautenbach :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Christoph Bartoschek , Stephan Held , Dieter Rautenbach , Jens Vygen Efficient generation of short and fast repeater tree topologies. [Citation Graph (0, 0)][DBLP ] ISPD, 2006, pp:120-127 [Conf ] Klaus Meer , Dieter Rautenbach On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. [Citation Graph (0, 0)][DBLP ] IWPEC, 2006, pp:72-83 [Conf ] Dieter Rautenbach , Bruce A. Reed Approximately covering by cycles in planar graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:402-406 [Conf ] Dogan Kesdogan , Dakshi Agrawal , Vinh Pham , Dieter Rautenbach Fundamental Limits on the Anonymity Provided by the MIX Technique. [Citation Graph (0, 0)][DBLP ] S&P, 2006, pp:86-99 [Conf ] Dieter Rautenbach , Lutz Volkmann New bounds on the k -domination number and the k -tuple domination number. [Citation Graph (0, 0)][DBLP ] Appl. Math. Lett., 2007, v:20, n:1, pp:98-102 [Journal ] Miranca Fischermann , Dieter Rautenbach , Lutz Volkmann Extremal Trees with Respect to Dominance Order. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2005, v:76, n:, pp:- [Journal ] Dieter Rautenbach Four traps are almost always enough to catch a square-celled animal. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2003, v:66, n:, pp:- [Journal ] Dieter Rautenbach Finite sets in Rn given up to translation have reconstruction number three. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2003, v:68, n:, pp:- [Journal ] Dieter Rautenbach , Bruce A. Reed The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2001, v:21, n:2, pp:267-278 [Journal ] Dieter Rautenbach Propagation of Mean Degrees. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal ] Dieter Rautenbach Rectilinear Spanning Trees Versus Bounding Boxes. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal ] Charles Delorme , Odile Favaron , Dieter Rautenbach Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:130, n:3, pp:503-512 [Journal ] Miranca Fischermann , Arne Hoffmann , Dieter Rautenbach , László A. Székely , Lutz Volkmann Wiener index versus maximum degree in trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:127-137 [Journal ] Miranca Fischermann , Arne Hoffmann , Dieter Rautenbach , Lutz Volkmann A Linear-programming Approach to the Generalized Randic Index. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:375-385 [Journal ] Miranca Fischermann , Lutz Volkmann , Dieter Rautenbach A note on the number of matchings and independent sets in trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:3, pp:483-489 [Journal ] Dieter Rautenbach , Christian Szegedy , Jürgen Werber The delay of circuits whose inputs have specified arrival times. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:10, pp:1233-1243 [Journal ] Peter Dankelmann , Dieter Rautenbach , Lutz Volkmann Weighted domination in triangle-free graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:250, n:1-3, pp:233-239 [Journal ] Charles Delorme , Odile Favaron , Dieter Rautenbach On the reconstruction of the degree sequence. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:259, n:1-3, pp:293-300 [Journal ] Charles Delorme , Odile Favaron , Dieter Rautenbach On the Randic Image index. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:257, n:1, pp:29-38 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:7, pp:670-672 [Journal ] Lothar Dohmen , Dieter Rautenbach , Lutz Volkmann A characterization of rho alpha(k )-perfect graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:224, n:1-3, pp:265-271 [Journal ] Lothar Dohmen , Dieter Rautenbach , Lutz Volkmann i gamma(1)-perfect graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:234, n:1-3, pp:133-138 [Journal ] Miranca Fischermann , Werner Knoben , Dirk Kremer , Dieter Rautenbach Competition polysemy. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:282, n:1-3, pp:251-255 [Journal ] Miranca Fischermann , Werner Knoben , Dirk Kremer , Dieter Rautenbach The solution of two problems on bound polysemy. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:282, n:1-3, pp:257-261 [Journal ] Miranca Fischermann , Dieter Rautenbach , Lutz Volkmann Remarks on the bondage number of planar graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:260, n:1-3, pp:57-67 [Journal ] Miranca Fischermann , Dieter Rautenbach , Lutz Volkmann Maximum graphs with a unique minimum dominating set. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:260, n:1-3, pp:197-203 [Journal ] Odile Favaron , Michael A. Henning , Joël Puech , Dieter Rautenbach On domination and annihilation in graphs with claw-free blocks. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:231, n:1-3, pp:143-151 [Journal ] Angelika Hellwig , Dieter Rautenbach , Lutz Volkmann Cuts leaving components of given minimum order. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2005, v:292, n:1-3, pp:55-65 [Journal ] Vadim V. Lozin , Dieter Rautenbach Chordal bipartite graphs of bounded tree- and clique-width. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:283, n:1-3, pp:151-158 [Journal ] Dieter Rautenbach Bounds on the strong domination number. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:215, n:, pp:201-212 [Journal ] Dieter Rautenbach On vertex orderings and the stability number in triangle-free graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:231, n:1-3, pp:411-420 [Journal ] Dieter Rautenbach Reconstructing infinite objects. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:250, n:1-3, pp:273-279 [Journal ] Dieter Rautenbach On Kelly's lemma for infinite sets of integers. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:245, n:1-3, pp:279-282 [Journal ] Dieter Rautenbach A note on trees of maximum weight and restricted degrees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:271, n:1-3, pp:335-342 [Journal ] Dieter Rautenbach Some remarks about leaf roots. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:13, pp:1456-1461 [Journal ] Dieter Rautenbach , Irene Stella On the maximum number of cycles in a Hamiltonian graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2005, v:304, n:1-3, pp:101-107 [Journal ] Dieter Rautenbach , Eberhard Triesch Reconstruction up to isometries. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:259, n:1-3, pp:331-336 [Journal ] Dieter Rautenbach , Lutz Volkmann Independent domination and matchings in graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:259, n:1-3, pp:325-330 [Journal ] Dieter Rautenbach , Lutz Volkmann On alphar gammas (k )-perfect graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:270, n:1-3, pp:240-249 [Journal ] Dieter Rautenbach , Lutz Volkmann Extremal subgraphs with respect to vertex degree bounds. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:263, n:1-3, pp:297-303 [Journal ] Dieter Rautenbach , Vadim E. Zverovich Perfect graphs of strong domination and independent strong domination. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:226, n:1-3, pp:297-311 [Journal ] Frédéric Maffray , Dieter Rautenbach Small step-dominating sets in trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:9-10, pp:1212-1215 [Journal ] Yair Caro , Dieter Rautenbach Reconstructing graphs from size and degree properties of their induced k-subgraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:6, pp:694-703 [Journal ] Michael A. Henning , Dieter Rautenbach On the irregularity of bipartite graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:11-12, pp:1467-1472 [Journal ] Dieter Rautenbach Reconstructing Finite Sets of Points in R n up to Groups of Isometries. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2001, v:22, n:8, pp:1139-1147 [Journal ] Dieter Rautenbach , Ingo Schiermeyer Extremal Problems for Imbalanced Edges. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2006, v:22, n:1, pp:103-111 [Journal ] Angelika Hellwig , Dieter Rautenbach , Lutz Volkmann Note on the connectivity of line graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:91, n:1, pp:7-10 [Journal ] Vadim V. Lozin , Dieter Rautenbach Some results on graphs without long induced paths. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:88, n:4, pp:167-171 [Journal ] Dieter Rautenbach Lower bounds on treespan. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2005, v:96, n:2, pp:67-70 [Journal ] Dieter Rautenbach On a Reconstruction Problem of Harary and Manvel. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2002, v:99, n:1, pp:32-39 [Journal ] Dieter Rautenbach , Eberhard Triesch Reconstructing Infinite Sets of Integers. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2002, v:99, n:2, pp:297-306 [Journal ] Dieter Rautenbach , Christian Szegedy , Jürgen Werber Delay optimization of linear depth boolean circuits with prescribed input arrival times. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2006, v:4, n:4, pp:526-537 [Journal ] Miranca Fischermann , Werner Knoben , Dirk Kremer , Dieter Rautenbach The Numbers of Shared Upper Bounds Determine a Poset. [Citation Graph (0, 0)][DBLP ] Order, 2004, v:21, n:2, pp:131-135 [Journal ] Vadim V. Lozin , Dieter Rautenbach On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:18, n:1, pp:195-206 [Journal ] Dieter Rautenbach On the differences between the upper irredundance, upper domination and independence numbers of a graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:203, n:1-3, pp:239-252 [Journal ] Dieter Rautenbach The influence of special vertices on strong domination. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:197, n:, pp:683-690 [Journal ] Dieter Rautenbach , Lutz Volkmann The domatic number of block-cactus graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:187, n:1-3, pp:185-193 [Journal ] Vadim V. Lozin , Dieter Rautenbach The relative clique-width of a graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2007, v:97, n:5, pp:846-858 [Journal ] Timing optimization by restructuring long combinatorial paths. [Citation Graph (, )][DBLP ] Fast buffering for optimizing worst slack and resource consumption in repeater trees. [Citation Graph (, )][DBLP ] Brief Announcement: On Reversible and Irreversible Conversions. [Citation Graph (, )][DBLP ] Cycles, Paths, Connectivity and Diameter in Distance Graphs. [Citation Graph (, )][DBLP ] An independent dominating set in the complement of a minimum dominating set of a tree. [Citation Graph (, )][DBLP ] Regular Weighted Graphs Without Positive Cuts. [Citation Graph (, )][DBLP ] Disjoint dominating and total dominating sets in graphs. [Citation Graph (, )][DBLP ] Dominating and large induced trees in regular graphs. [Citation Graph (, )][DBLP ] The independence number in graphs of maximum degree three. [Citation Graph (, )][DBLP ] Some remarks on lambdap, q -connectedness. [Citation Graph (, )][DBLP ] A note on domination, girth and minimum degree. [Citation Graph (, )][DBLP ] alpha-Domination perfect trees. [Citation Graph (, )][DBLP ] Domination in bipartite graphs. [Citation Graph (, )][DBLP ] On the OBDD size for graphs of bounded tree- and clique-width. [Citation Graph (, )][DBLP ] On the existence of edge cuts leaving several large components. [Citation Graph (, )][DBLP ] Remarks about disjoint dominating sets. [Citation Graph (, )][DBLP ] Edge irregular total labellings for graphs of linear size. [Citation Graph (, )][DBLP ] A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. [Citation Graph (, )][DBLP ] On spanning tree congestion. [Citation Graph (, )][DBLP ] Packing disjoint cycles over vertex cuts. [Citation Graph (, )][DBLP ] Packing edge-disjoint cycles in graphs and the cyclomatic number. [Citation Graph (, )][DBLP ] Some remarks on the geodetic number of a graph. [Citation Graph (, )][DBLP ] Edge colouring by total labellings. [Citation Graph (, )][DBLP ] Interpolating between bounds on the independence number. [Citation Graph (, )][DBLP ] On the cost of optimal alphabetic code trees with unequal letter costs. [Citation Graph (, )][DBLP ] Minimum degree and density of binary sequences. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.604secs