| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach |
Independent sets and matchings in subcubic graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Löwenstein, Dieter Rautenbach |
Pairs of Disjoint Dominating Sets in Connected Cubic Graphs. |
Graphs and Combinatorics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
On the Convexity Number of Graphs. |
Graphs and Combinatorics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Unit and single point interval graphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman |
On the Radon Number for P 3-Convexity. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
On the Carathéodory Number for the Convexity of Paths of Order Three. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmen C. Centeno, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Irreversible conversion of graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre Costa Dourado, Dieter Rautenbach, Philipp Matthias Schäfer |
On finite convexity spaces induced by sets of paths in graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer |
Finite Sholander trees, trees, and their betweenness. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach |
Dominating sets, packings, and the maximum degree. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Connectivity and diameter in distance graphs. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Löwenstein, Dieter Rautenbach, Friedrich Regen |
On Hamiltonian paths in distance graphs. |
Appl. Math. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter |
On subbetweennesses of trees: Hardness, algorithms, and characterizations. |
Computers & Mathematics with Applications |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Philipp Matthias Schäfer |
Strict Betweennesses Induced by Posets as well as by Graphs. |
Order |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Löwenstein, Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen |
Independence, odd girth, and average degree. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter |
Powers of cycles, powers of paths, and distance graphs. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter |
Characterization and representation problems for intersection betweennesses. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
Average distance and domination number revisited. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Sune Pedersen, Dieter Rautenbach |
Recolouring-resistant colourings. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Dieter Rautenbach |
Independence in connected graphs. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen |
Lower bounds on the independence number of certain graphs of odd girth at least seven. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen |
Combinatorial Optimization in VLSI Design. |
Combinatorial Optimization - Methods and Applications |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
The South Zone: Distributed Algorithms for Alliances. |
SSS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen |
The repeater tree construction problem. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, Dieter Rautenbach |
Exact leaf powers. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Some remarks on the geodetic number of a graph. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anett Boßecker, Dieter Rautenbach |
Interpolating between bounds on the independence number. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen |
Packing edge-disjoint cycles in graphs and the cyclomatic number. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz |
Edge colouring by total labellings. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel |
Packing disjoint cycles over vertex cuts. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Long cycles and paths in distance graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmen C. Centeno, S. Dantas, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Convex Partitions of Graphs induced by Paths of Order Three. |
Discrete Mathematics & Theoretical Computer Science |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stephan Brandt, Janina Müttel, Dieter Rautenbach, Friedrich Regen |
Minimum degree and density of binary sequences. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach |
An independent dominating set in the complement of a minimum dominating set of a tree. |
Appl. Math. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer |
Random Procedures for Dominating Sets in Graphs. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Christian Löwenstein, Dieter Rautenbach |
Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs. |
Graphs and Combinatorics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach |
Partitioning a graph into a dominating set, a total dominating set, and something else. |
Discussiones Mathematicae Graph Theory |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, Friedrich Regen, Imre Z. Ruzsa |
Edge-Injective and Edge-Surjective Vertex Labellings. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
On the Hull Number of Triangle-Free Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer |
Cycle length parities and the chromatic number. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach, Justin Southey |
Disjoint dominating and total dominating sets in graphs. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Brief Announcement: On Reversible and Irreversible Conversions. |
DISC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach |
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Friedrich Regen |
On packing shortest cycles in graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Mörig, Dieter Rautenbach, Michiel H. M. Smid, Jan Tusch |
An Omega(nlogn) lower bound for computing the sum of even-ranked elements. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Maßberg, Dieter Rautenbach |
Binary trees with choosable edge lengths. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Löwenstein, Dieter Rautenbach, Friedrich Regen |
On spanning tree congestion. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Brandt, Jozef Miskuf, Dieter Rautenbach |
Edge irregular total labellings for graphs of linear size. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, Dieter Rautenbach |
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Meer, Dieter Rautenbach |
On the OBDD size for graphs of bounded tree- and clique-width. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Lutz Volkmann |
On the existence of edge cuts leaving several large components. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Dieter Rautenbach |
Domination in bipartite graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach |
Remarks about disjoint dominating sets. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer |
On F-independence in graphs. |
Discussiones Mathematicae Graph Theory |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sven Peyer, Dieter Rautenbach, Jens Vygen |
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Cycles, Paths, Connectivity and Diameter in Distance Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen |
Fast buffering for optimizing worst slack and resource consumption in repeater trees. |
ISPD |
2009 |
DBLP DOI BibTeX RDF |
interconnect buffering, repeater tree, physical design, repeater insertion, timing closure |
| 1 | Dieter Rautenbach, Lutz Volkmann |
Some remarks on lambdap, q-connectedness. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
A note on domination, girth and minimum degree. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer |
The independence number in graphs of maximum degree three. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | F. Dahme, Dieter Rautenbach, Lutz Volkmann |
alpha-Domination perfect trees. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Lutz Volkmann |
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Christian Szegedy, Jürgen Werber |
On the cost of optimal alphabetic code trees with unequal letter costs. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Löwenstein, Dieter Rautenbach |
Domination in Graphs of Minimum Degree at least Two and Large Girth. |
Graphs and Combinatorics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Brandt, Jozef Miskuf, Dieter Rautenbach |
On a conjecture about edge irregular total labelings. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
A conjecture of Borodin and a coloring of Grünbaum. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Dieter Rautenbach |
The relative clique-width of a graph. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
Dominating and large induced trees in regular graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Dieter Rautenbach |
Reconstructing graphs from size and degree properties of their induced k-subgraphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Maffray, Dieter Rautenbach |
Small step-dominating sets in trees. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Dieter Rautenbach |
On the irregularity of bipartite graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Lutz Volkmann |
New bounds on the k-domination number and the k-tuple domination number. |
Appl. Math. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Christian Szegedy, Jürgen Werber |
The delay of circuits whose inputs have specified arrival times. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
Regular Weighted Graphs Without Positive Cuts. |
Ars Comb. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dieter Rautenbach, Bruce Reed |
Domination in Cubic Graphs of Large Girth. |
KyotoCGGT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Werber, Dieter Rautenbach, Christian Szegedy |
Timing optimization by restructuring long combinatorial paths. |
ICCAD |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Andreas Brandstädt, Van Bang Le |
Distance-Hereditary 5-Leaf Powers. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
A Conjecture of Borodin and a Coloring of Grünbaum. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
Some remarks about leaf roots. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Ingo Schiermeyer |
Extremal Problems for Imbalanced Edges. |
Graphs and Combinatorics |
2006 |
DBLP DOI BibTeX RDF |
extremal graph, irregularity, Imbalance |
| 1 | Dieter Rautenbach, Christian Szegedy, Jürgen Werber |
Delay optimization of linear depth boolean circuits with prescribed input arrival times. |
J. Discrete Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dogan Kesdogan, Dakshi Agrawal, Dang Vinh Pham, Dieter Rautenbach |
Fundamental Limits on the Anonymity Provided by the MIX Technique. |
IEEE Symposium on Security and Privacy |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen |
Efficient generation of short and fast repeater tree topologies. |
ISPD |
2006 |
DBLP DOI BibTeX RDF |
inverter tree, repeater tree, buffering, tree topology, rectilinear Steiner tree |
| 1 | Klaus Meer, Dieter Rautenbach |
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
Lower bounds on treespan. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann |
Cuts leaving components of given minimum order. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Irene Stella |
On the maximum number of cycles in a Hamiltonian graph. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach |
A note on the number of matchings and independent sets in trees. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann |
Extremal Trees with Respect to Dominance Order. |
Ars Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann |
Note on the connectivity of line graphs. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Dieter Rautenbach |
Chordal bipartite graphs of bounded tree- and clique-width. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach |
The solution of two problems on bound polysemy. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach |
Competition polysemy. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
Rectilinear Spanning Trees Versus Bounding Boxes. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Dieter Rautenbach |
Propagation of Mean Degrees. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin, Dieter Rautenbach |
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach |
The Numbers of Shared Upper Bounds Determine a Poset. |
Order |
2004 |
DBLP DOI BibTeX RDF |
bound graph, poset |
| 1 | Vadim V. Lozin, Dieter Rautenbach |
Some results on graphs without long induced paths. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Lutz Volkmann |
Extremal subgraphs with respect to vertex degree bounds. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")