The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dieter Rautenbach: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Dieter Rautenbach, Bruce A. Reed
    Approximately covering by cycles in planar graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:402-406 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. Dieter Rautenbach
    Propagation of Mean Degrees. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  11. Dieter Rautenbach
    Rectilinear Spanning Trees Versus Bounding Boxes. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. Dieter Rautenbach
    Bounds on the strong domination number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:215, n:, pp:201-212 [Journal]
  31. 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]
  32. Dieter Rautenbach
    Reconstructing infinite objects. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:273-279 [Journal]
  33. 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]
  34. 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]
  35. Dieter Rautenbach
    Some remarks about leaf roots. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:13, pp:1456-1461 [Journal]
  36. 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]
  37. 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]
  38. 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]
  39. Dieter Rautenbach, Lutz Volkmann
    On alphargammas(k)-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:240-249 [Journal]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. Dieter Rautenbach
    Reconstructing Finite Sets of Points in Rnup to Groups of Isometries. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:8, pp:1139-1147 [Journal]
  46. 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]
  47. 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]
  48. 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]
  49. Dieter Rautenbach
    Lower bounds on treespan. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:2, pp:67-70 [Journal]
  50. 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]
  51. 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]
  52. 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]
  53. 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]
  54. 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]
  55. 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]
  56. 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]
  57. 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]
  58. 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]

  59. Timing optimization by restructuring long combinatorial paths. [Citation Graph (, )][DBLP]


  60. Fast buffering for optimizing worst slack and resource consumption in repeater trees. [Citation Graph (, )][DBLP]


  61. Brief Announcement: On Reversible and Irreversible Conversions. [Citation Graph (, )][DBLP]


  62. Cycles, Paths, Connectivity and Diameter in Distance Graphs. [Citation Graph (, )][DBLP]


  63. An independent dominating set in the complement of a minimum dominating set of a tree. [Citation Graph (, )][DBLP]


  64. Regular Weighted Graphs Without Positive Cuts. [Citation Graph (, )][DBLP]


  65. Disjoint dominating and total dominating sets in graphs. [Citation Graph (, )][DBLP]


  66. Dominating and large induced trees in regular graphs. [Citation Graph (, )][DBLP]


  67. The independence number in graphs of maximum degree three. [Citation Graph (, )][DBLP]


  68. Some remarks on lambdap, q-connectedness. [Citation Graph (, )][DBLP]


  69. A note on domination, girth and minimum degree. [Citation Graph (, )][DBLP]


  70. alpha-Domination perfect trees. [Citation Graph (, )][DBLP]


  71. Domination in bipartite graphs. [Citation Graph (, )][DBLP]


  72. On the OBDD size for graphs of bounded tree- and clique-width. [Citation Graph (, )][DBLP]


  73. On the existence of edge cuts leaving several large components. [Citation Graph (, )][DBLP]


  74. Remarks about disjoint dominating sets. [Citation Graph (, )][DBLP]


  75. Edge irregular total labellings for graphs of linear size. [Citation Graph (, )][DBLP]


  76. A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. [Citation Graph (, )][DBLP]


  77. On spanning tree congestion. [Citation Graph (, )][DBLP]


  78. Packing disjoint cycles over vertex cuts. [Citation Graph (, )][DBLP]


  79. Packing edge-disjoint cycles in graphs and the cyclomatic number. [Citation Graph (, )][DBLP]


  80. Some remarks on the geodetic number of a graph. [Citation Graph (, )][DBLP]


  81. Edge colouring by total labellings. [Citation Graph (, )][DBLP]


  82. Interpolating between bounds on the independence number. [Citation Graph (, )][DBLP]


  83. On the cost of optimal alphabetic code trees with unequal letter costs. [Citation Graph (, )][DBLP]


  84. Minimum degree and density of binary sequences. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002