Dieter Rautenbach

361 papers A* 2A 2B 8C 8Misc 3Journal 332Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
An optimization approach to degree deviation and spectral radius.
Discret. Optim.
Dieter Rautenbach, Florian Werner
2026 J jnl
Complexity of deciding the equality of matching numbers.
J. Comput. Syst. Sci.
Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter, Florian Werner
2026 J jnl
Largest Common Subgraph of Two Forests.
J. Graph Algorithms Appl.
Dieter Rautenbach, Florian Werner
2026 J jnl
Leaf to leaf path lengths in trees of given degree sequence.
Discret. Math.
Dieter Rautenbach, Johannes Scherer, Florian Werner
2026 J jnl
Maximum common induced subforests and minimum common induced superforests of a set of forests.
Discuss. Math. Graph Theory
Dieter Rautenbach, Florian Werner
2025 J jnl
A Faster Algorithm for Independent Cut.
CoRR
Vsevolod Chernyshev, Johannes Rauch, Dieter Rautenbach, Liliia Redina
2025 J jnl
A faster algorithm for independent cut.
Theor. Comput. Sci.
Vsevolod Chernyshev, Johannes Rauch, Dieter Rautenbach, Liliia Redina
2025 J jnl
Cutwidth and Crossings.
CoRR
Johannes Rauch, Dieter Rautenbach
2025 J jnl
Degree Deviation and Spectral Radius.
Electron. J. Comb.
Dieter Rautenbach, Florian Werner
2025 J jnl
Exact and parameterized algorithms for the independent cutset problem.
J. Comput. Syst. Sci.
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2025 J jnl
Forest cuts in sparse graphs.
Discret. Math.
Vsevolod Chernyshev, Johannes Rauch, Dieter Rautenbach
2025 J jnl
On conflict-free cuts: Algorithms and complexity.
Inf. Process. Lett.
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2025 J jnl
Revisiting Extremal Graphs Having No Stable Cutsets.
Electron. J. Comb.
Johannes Rauch, Dieter Rautenbach
2025 J jnl
Sparse Vertex Cutsets and the Maximum Degree.
Electron. J. Comb.
Stéphane Bessy, Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2024 J jnl
Bounding the Mostar index.
Discret. Math.
Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner
2024 J jnl
Complexity of Deciding the Equality of Matching Numbers.
CoRR
Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter, Florian Werner
2024 J jnl
FPT algorithms for packing k-safe spanning rooted sub(di)graphs.
Discret. Appl. Math.
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
2024 J jnl
Induced Subforests and Superforests.
CoRR
Dieter Rautenbach, Florian Werner
2024 J jnl
Largest common subgraph of two forests.
CoRR
Dieter Rautenbach, Florian Werner
2024 J jnl
Mostar index and bounded maximum degree.
Discret. Optim.
Michael A. Henning, Johannes Pardey, Dieter Rautenbach, Florian Werner
2023 J jnl
A bound on the dissociation number.
J. Graph Theory
Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach
2023 J jnl
Biholes in balanced bipartite graphs.
Discuss. Math. Graph Theory
Stefan Ehard, Elena Mohr, Dieter Rautenbach
2023 J jnl
Diameter, edge-connectivity, and
Discret. Math.
Vanessa Hiebeler, Johannes Pardey, Dieter Rautenbach
2023 J jnl
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation.
Discret. Appl. Math.
Johannes Pardey, Dieter Rautenbach
2023 J jnl
Efficiently recognizing graphs with equal independence and annihilation numbers.
Inf. Process. Lett.
Johannes Rauch, Dieter Rautenbach
2023 B conf
Exact and Parameterized Algorithms for the Independent Cutset Problem.
FCT
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2023 J jnl
Exact and Parameterized Algorithms for the Independent Cutset Problem.
CoRR
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2023 J jnl
Irregularity of Graphs Respecting Degree Bounds.
Electron. J. Comb.
Dieter Rautenbach, Florian Werner
2023 J jnl
Majority Edge-Colorings of Graphs.
Electron. J. Comb.
Felix Bock, Rafal Kalinowski, Johannes Pardey, Monika Pilsniak, Dieter Rautenbach, Mariusz Wozniak
2023 J jnl
Maximizing the Mostar index for bipartite graphs and split graphs.
Discret. Optim.
Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner
2023 J jnl
On Conflict-Free Cuts: Algorithms and Complexity.
CoRR
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2023 J jnl
Relating the independence number and the dissociation number.
J. Graph Theory
Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach
2023 J jnl
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs.
Electron. J. Comb.
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach
2023 J jnl
Vertex degrees close to the average degree.
CoRR
Johannes Pardey, Dieter Rautenbach
2023 J jnl
Vertex degrees close to the average degree.
Discret. Math.
Johannes Pardey, Dieter Rautenbach
2022 J jnl
Acyclic matchings in graphs of bounded maximum degree.
Discret. Math.
Julien Baste, Maximilian Fürst, Dieter Rautenbach
2022 J jnl
Additive tree O(ρlog⁡n)-spanners from tree breadth
Theor. Comput. Sci.
Oliver Bendele, Dieter Rautenbach
2022 J jnl
Algorithmic aspects of broadcast independence.
Discret. Appl. Math.
Stéphane Bessy, Dieter Rautenbach
2022 J jnl
Almost color-balanced perfect matchings in color-balanced complete graphs.
Discret. Math.
Johannes Pardey, Dieter Rautenbach
2022 J jnl
Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound.
Electron. J. Comb.
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach
2022 J jnl
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree.
Discret. Math. Theor. Comput. Sci.
Julien Baste, Stefan Ehard, Dieter Rautenbach
2022 J jnl
On Hamiltonian cycles in claw-free cubic graphs.
Discuss. Math. Graph Theory
Elena Mohr, Dieter Rautenbach
2022 J jnl
On the computational complexity of the bipartizing matching problem.
Ann. Oper. Res.
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2022 J jnl
Relating dissociation, independence, and matchings.
Discret. Appl. Math.
Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach
2022 J jnl
The hull number in the convexity of induced paths of order 3.
Theor. Comput. Sci.
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2022 J jnl
Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs.
Graphs Comb.
Elena Mohr, Johannes Pardey, Dieter Rautenbach
2021 J jnl
Bounding and approximating minimum maximal matchings in regular graphs.
Discret. Math.
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
2021 J jnl
Cubic graphs with equal independence number and matching number.
Discret. Math.
Elena Mohr, Dieter Rautenbach
2021 J jnl
Exponential independence in subcubic graphs.
Discret. Math.
Stéphane Bessy, Johannes Pardey, Dieter Rautenbach
2021 J jnl
FPT algorithms for packing k-safe spanning rooted sub(di)graphs.
CoRR
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
2021 J jnl
On the maximum number of maximum independent sets in connected graphs.
J. Graph Theory
Elena Mohr, Dieter Rautenbach
2021 J jnl
Reconfiguring Dominating Sets in Minor-Closed Graph Classes.
Graphs Comb.
Dieter Rautenbach, Johannes Redl
2021 J jnl
Uniquely restricted matchings in subcubic graphs without short cycles.
J. Graph Theory
Maximilian Fürst, Dieter Rautenbach
2020 J jnl
A short proof for a lower bound on the zero forcing number.
Discuss. Math. Graph Theory
Maximilian Fürst, Dieter Rautenbach
2020 J jnl
Additive Tree O(ρ log n)-Spanners from Tree Breadth ρ.
CoRR
Oliver Bendele, Dieter Rautenbach
2020 Misc conf
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies.
COCOON
Julien Baste, Maximilian Fürst, Dieter Rautenbach
2020 J jnl
Approximating connected safe sets in weighted trees.
Discret. Appl. Math.
Stefan Ehard, Dieter Rautenbach
2020 J jnl
Closed-neighborhood union-closed graphs.
Australas. J Comb.
Kelly Guest, Sarah H. Holliday, Peter D. Johnson Jr., Dieter Rautenbach, Matthew Walsh
2020 J jnl
Constant threshold intersection graphs of orthodox paths in trees.
Discret. Appl. Math.
Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2020 J jnl
Domination versus edge domination.
Discret. Appl. Math.
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
2020 J jnl
Equating
Discuss. Math. Graph Theory
Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach
2020 J jnl
Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier.
Discret. Optim.
Julien Baste, Maximilian Fürst, Dieter Rautenbach
2020 J jnl
Low Weight Perfect Matchings.
Electron. J. Comb.
Stefan Ehard, Elena Mohr, Dieter Rautenbach
2020 J jnl
Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree.
CoRR
Julien Baste, Stefan Ehard, Dieter Rautenbach
2020 J jnl
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs.
Theor. Comput. Sci.
Maximilian Fürst, Dieter Rautenbach
2020 J jnl
Partial immunization of trees.
Discret. Optim.
Mitre Costa Dourado, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
2019 J jnl
Approximating maximum uniquely restricted matchings in bipartite graphs.
Discret. Appl. Math.
Julien Baste, Dieter Rautenbach, Ignasi Sau
2019 J jnl
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives.
Discret. Math.
Christoph Brause, Stefan Ehard, Dieter Rautenbach
2019 J jnl
Dynamic monopolies for interval graphs with bounded thresholds.
Discret. Appl. Math.
Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
2019 J jnl
Forcing brushes.
Discret. Appl. Math.
Dirk Meierling, Dieter Rautenbach
2019 C conf
Identifying Codes in the Complementary Prism of Cycles.
LAGOS
Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Lucia Draque Penso, Dieter Rautenbach
2019 J jnl
Lower Bounds on the Uniquely Restricted Matching Number.
Graphs Comb.
Maximilian Fürst, Dieter Rautenbach
2019 J jnl
On matching numbers of tree and bipartite degree sequences.
Discret. Math.
Felix Bock, Dieter Rautenbach
2019 J jnl
On some hard and some tractable cases of the maximum acyclic matching problem.
Ann. Oper. Res.
Maximilian Fürst, Dieter Rautenbach
2019 J jnl
On some tractable and hard instances for partial incentives and target set selection.
Discret. Optim.
Stefan Ehard, Dieter Rautenbach
2019 J jnl
On the Kőnig?Egerváry theorem for k?paths.
J. Graph Theory
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
2019 J jnl
On the maximum number of minimum dominating sets in forests.
Discret. Math.
José D. Alvarado, Simone Dantas, Elena Mohr, Dieter Rautenbach
2019 J jnl
On the maximum number of minimum total dominating sets in forests.
Discret. Math. Theor. Comput. Sci.
Michael A. Henning, Elena Mohr, Dieter Rautenbach
2019 J jnl
Relating broadcast independence and independence.
Discret. Math.
Stéphane Bessy, Dieter Rautenbach
2019 J jnl
Sandwiches missing two ingredients of order four.
Ann. Oper. Res.
José D. Alvarado, Simone Dantas, Dieter Rautenbach
2019 C conf
The Hull Number in the Convexity of Induced Paths of Order 3.
IWOCA
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2019 J jnl
Uniquely restricted matchings in subcubic graphs.
Discret. Appl. Math.
Maximilian Fürst, Michael A. Henning, Dieter Rautenbach
2019 J jnl
Upper bounds on the uniquely restricted chromatic index.
J. Graph Theory
Julien Baste, Dieter Rautenbach, Ignasi Sau
2019 J jnl
Vaccinate your trees!
Theor. Comput. Sci.
Stefan Ehard, Dieter Rautenbach
2018 J jnl
A lower bound on the acyclic matching number of subcubic graphs.
Discret. Math.
Maximilian Fürst, Dieter Rautenbach
2018 J jnl
And/or-convexity: a graph convexity based on processes and deadlock models.
Ann. Oper. Res.
Carlos Vinícius G. C. Lima, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2018 J jnl
Approximately locating an invisible agent in a graph with relative distance queries.
Discret. Math.
Dennis Dayanikli, Dieter Rautenbach
2018 C conf
Bipartizing with a Matching.
COCOA
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2018 J jnl
Bounds on the burning number.
Discret. Appl. Math.
Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin
2018 J jnl
Degenerate matchings and edge colorings.
Discret. Appl. Math.
Julien Baste, Dieter Rautenbach
2018 J jnl
Dominating sets inducing large components in maximal outerplanar graphs.
J. Graph Theory
José D. Alvarado, Simone Dantas, Dieter Rautenbach
2018 J jnl
Dynamic monopolies for interval graphs with bounded thresholds.
CoRR
Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
2018 J jnl
Graphs in which some and every maximum matching is uniquely restricted.
J. Graph Theory
Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza
2018 J jnl
Hereditary equality of domination and exponential domination.
Discuss. Math. Graph Theory
Michael A. Henning, Simon Jäger, Dieter Rautenbach
2018 J jnl
Large values of the clustering coefficient.
Discret. Math.
Michael Gentner, Irene Heinrich, Simon Jäger, Dieter Rautenbach
2018 J jnl
Locally searching for large induced matchings.
Theor. Comput. Sci.
Maximilian Fürst, Marilena Leichter, Dieter Rautenbach
2018 J jnl
On some graphs with a unique perfect matching.
Inf. Process. Lett.
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
2018 J jnl
On some tractable and hard instances for partial incentives and target set selection.
CoRR
Stefan Ehard, Dieter Rautenbach
2018 J jnl
On the Maximum Number of Maximum Independent Sets.
Graphs Comb.
Elena Mohr, Dieter Rautenbach
2018 J jnl
On the hardness of finding the geodetic number of a subcubic graph.
Inf. Process. Lett.
Letícia Rodrigues Bueno, Lucia Draque Penso, Fábio Protti, Victor R. Ramos, Dieter Rautenbach, Uéverton S. Souza
2018 J jnl
Smallest domination number and largest independence number of graphs and forests with given degree sequence.
J. Graph Theory
Michael Gentner, Michael A. Henning, Dieter Rautenbach
2018 J jnl
Some bounds on the zero forcing number of a graph.
Discret. Appl. Math.
Michael Gentner, Dieter Rautenbach
2018 J jnl
The Geodetic Hull Number is Hard for Chordal Graphs.
SIAM J. Discret. Math.
Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2018 J jnl
The cat and the noisy mouse.
Discret. Math.
Dieter Rautenbach, Moritz Schneider
2017 J jnl
Approximating Connected Safe Sets in Weighted Trees.
CoRR
Stefan Ehard, Dieter Rautenbach
2017 J jnl
Bounds on the exponential domination number.
Discret. Math.
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
2017 J jnl
Burning a graph is hard.
Discret. Appl. Math.
Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin
2017 J jnl
Complexity properties of complementary prisms.
J. Comb. Optim.
Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza
2017 J jnl
Corrigendum to "Complexity analysis of P
Theor. Comput. Sci.
Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza
2017 J jnl
Decycling with a matching.
Inf. Process. Lett.
Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2017 J jnl
Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees.
Theor. Comput. Sci.
Michael Gentner, Dieter Rautenbach
2017 J jnl
Eliminating Odd Cycles by Removing a Matching.
CoRR
Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2017 J jnl
Exponential independence.
Discret. Math.
Simon Jäger, Dieter Rautenbach
2017 J jnl
Extremal Values of the Chromatic Number for a Given Degree Sequence.
Graphs Comb.
Stéphane Bessy, Dieter Rautenbach
2017 J jnl
Generalized threshold processes on graphs.
Theor. Comput. Sci.
Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2017 J jnl
Geodetic convexity parameters for (q, q-4)-graphs.
Discret. Appl. Math.
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2017 J jnl
Intersection Graphs of Orthodox Paths in Trees.
Electron. Notes Discret. Math.
Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach
2017 J jnl
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability.
Discret. Math.
Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer
2017 J jnl
On some Graphs with a Unique Perfect Matching.
CoRR
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
2017 J jnl
Optimal Colorings with Rainbow Paths.
Graphs Comb.
Oliver Bendele, Dieter Rautenbach
2017 J jnl
Relating 2-rainbow domination to Roman domination.
Discuss. Math. Graph Theory
José D. Alvarado, Simone Dantas, Dieter Rautenbach
2017 J jnl
Relating domination, exponential domination, and porous exponential domination.
Discret. Optim.
Michael A. Henning, Simon Jäger, Dieter Rautenbach
2017 J jnl
Sandwiches Missing Two Ingredients of Order Four.
CoRR
José D. Alvarado, Simone Dantas, Dieter Rautenbach
2017 J jnl
Some comments on the Slater number.
Discret. Math.
Michael Gentner, Dieter Rautenbach
2017 J jnl
The Geodetic Hull Number is Hard for Chordal Graphs.
CoRR
Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2017 J jnl
The Geodetic Hull Number is Hard for Chordal Graphs.
Electron. Notes Discret. Math.
Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2017 B conf
Uniquely Restricted Matchings and Edge Colorings.
WG
Julien Baste, Dieter Rautenbach, Ignasi Sau
2016 J jnl
A lower bound on the independence number of a graph in terms of degrees and local clique sizes.
Discret. Appl. Math.
Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer
2016 J jnl
Averaging 2-rainbow domination and Roman domination.
Discret. Appl. Math.
José D. Alvarado, Simone Dantas, Dieter Rautenbach
2016 J jnl
Cycles Avoiding a Color in Colorful Graphs.
J. Graph Theory
Dirk Meierling, Janina Müttel, Dieter Rautenbach
2016 J jnl
Dominating sets inducing large components.
Discret. Math.
José D. Alvarado, Simone Dantas, Dieter Rautenbach
2016 J jnl
Exponential Domination in Subcubic Graphs.
Electron. J. Comb.
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
2016 J jnl
Extremal values and bounds for the zero forcing number.
Discret. Appl. Math.
Michael Gentner, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza
2016 J jnl
Forbidden induced subgraphs for bounded p-intersection number.
Discret. Math.
Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2016 B conf
Geodetic Convexity Parameters for Graphs with Few Short Induced Paths.
WG
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2016 A* conf
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component.
FOCS
Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed
2016 J jnl
How to determine if a random graph with a fixed degree sequence has a giant component.
CoRR
Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed
2016 J jnl
Independence in uniform linear triangle-free hypergraphs.
Discret. Math.
Piotr Borowiecki, Michael Gentner, Christian Löwenstein, Dieter Rautenbach
2016 J jnl
Induced 2-regular subgraphs in k-chordal cubic graphs.
Discret. Appl. Math.
Michael A. Henning, Felix Joos, Christian Löwenstein, Dieter Rautenbach
2016 J jnl
Largest domination number and smallest independence number of forests with given degree sequence.
Discret. Appl. Math.
Michael Gentner, Michael A. Henning, Dieter Rautenbach
2016 J jnl
Near-linear-time algorithm for the geodetic Radon number of grids.
Discret. Appl. Math.
Mitre Costa Dourado, Vinícius Gusmão Pereira de Sá, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2016 J jnl
On the geodetic hull number of P
Theor. Comput. Sci.
Mitre Costa Dourado, Lucia Draque Penso Rautenbach, Dieter Rautenbach
2016 J jnl
On the geodetic iteration number of distance-hereditary graphs.
Discret. Math.
Mitre Costa Dourado, Rodolfo Alves de Oliveira, Fábio Protti, Dieter Rautenbach
2016 J jnl
Slash and burn on graphs - Firefighting with general weights.
Discret. Appl. Math.
Vítor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2016 J jnl
Strong equality of Roman and weak Roman domination in trees.
Discret. Appl. Math.
José D. Alvarado, Simone Dantas, Dieter Rautenbach
2016 J jnl
The Cycle Spectrum of Claw-free Hamiltonian Graphs.
Graphs Comb.
Jonas Eckert, Felix Joos, Dieter Rautenbach
2016 J jnl
Uniquely restricted matchings and edge colorings.
CoRR
Julien Baste, Dieter Rautenbach, Ignasi Sau
2015 J jnl
Asymptotic surviving rate of trees with multiple fire sources.
Discret. Appl. Math.
Vítor Costa, Simone Dantas, Dieter Rautenbach
2015 J jnl
Badly-covered graphs.
Discret. Appl. Math.
Márcia R. Cappelle, Felix Joos, Janina Müttel, Dieter Rautenbach
2015 J jnl
Brush your trees!
Discret. Appl. Math.
Lucia Draque Penso, Dieter Rautenbach, Aline Ribeiro de Almeida
2015 J jnl
Complexity analysis of P
Theor. Comput. Sci.
Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza
2015 C conf
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.
CTW
Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti
2015 J jnl
Cycle Lengths of Hamiltonian P
Graphs Comb.
Dirk Meierling, Dieter Rautenbach
2015 J jnl
Cycles in complementary prisms.
Discret. Appl. Math.
Dirk Meierling, Fábio Protti, Dieter Rautenbach, Aline Ribeiro de Almeida
2015 J jnl
Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs.
Discret. Appl. Math.
José D. Alvarado, Simone Dantas, Dieter Rautenbach
2015 J jnl
Equality of distance packing numbers.
Discret. Math.
Felix Joos, Dieter Rautenbach
2015 J jnl
Factor-critical graphs with the minimum number of near-perfect matchings.
Discret. Math.
Tomislav Doslic, Dieter Rautenbach
2015 J jnl
Feedback vertex sets in cubic multigraphs.
Discret. Math.
Michael Gentner, Dieter Rautenbach
2015 J jnl
Forests and trees among Gallai graphs.
Discret. Math.
Felix Joos, Van Bang Le, Dieter Rautenbach
2015 J jnl
Maximum induced matchings close to maximum matchings.
Theor. Comput. Sci.
Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza
2015 J jnl
New potential functions for greedy independence and coloring.
Discret. Appl. Math.
Piotr Borowiecki, Dieter Rautenbach
2015 J jnl
On Graphs with Induced Matching Number Almost Equal to Matching Number.
Electron. Notes Discret. Math.
Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza
2015 J jnl
Perfectly relating the domination, total domination, and paired domination numbers of a graph.
Discret. Math.
José D. Alvarado, Simone Dantas, Dieter Rautenbach
2015 J jnl
Remarks on dynamic monopolies with given average thresholds.
Discuss. Math. Graph Theory
Carmen C. Centeno, Dieter Rautenbach
2015 J jnl
Robust recoverable perfect matchings.
Networks
Mitre Costa Dourado, Dirk Meierling, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida
2015 J jnl
The Maximum Number of Dominating Induced Matchings.
J. Graph Theory
Min Chih Lin, Veronica A. Moyano, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2015 C conf
The P3-Convexity in the Complementary Prism of a Graph.
CTW
Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza
2015 J jnl
Two greedy consequences for maximum induced matchings.
Theor. Comput. Sci.
Dieter Rautenbach
2014 Misc conf
CLOUDFARM: An Elastic Cloud Platform with Flexible and Adaptive Resource Management.
UCC
Vladimir Nikolov, Steffen Kächele, Franz J. Hauck, Dieter Rautenbach
2014 J jnl
Domination and total domination in cubic graphs of large girth.
Discret. Appl. Math.
Simone Dantas, Felix Joos, Christian Löwenstein, Deiwison S. Machado, Dieter Rautenbach
2014 J jnl
Graphs of interval count two with a given partition.
Inf. Process. Lett.
Felix Joos, Christian Löwenstein, Fabiano de S. Oliveira, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2014 J jnl
Independent domination in subcubic bipartite graphs of girth at least six.
Discret. Appl. Math.
Michael A. Henning, Christian Löwenstein, Dieter Rautenbach
2014 J jnl
Induced Matchings in Subcubic Graphs.
SIAM J. Discret. Math.
Felix Joos, Dieter Rautenbach, Thomas Sasse
2014 J jnl
Induced matchings in subcubic graphs without short cycles.
Discret. Math.
Michael A. Henning, Dieter Rautenbach
2014 J jnl
Irreversible conversion processes with deadlines.
J. Discrete Algorithms
Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer
2014 J jnl
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs.
Discret. Math. Theor. Comput. Sci.
Christian Löwenstein, Dieter Rautenbach, Roman Soták
2014 C conf
On P 3-Convexity of Graphs with Bounded Degree.
AAIM
Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza
2014 J jnl
On defensive alliances and strong global offensive alliances.
Discret. Appl. Math.
Mitre Costa Dourado, Luérbio Faria, Miguel A. Pizaña, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2014 J jnl
Recognizing some complementary products.
Theor. Comput. Sci.
Márcia R. Cappelle, Lucia Draque Penso, Dieter Rautenbach
2014 J jnl
The Carathéodory number of the P
Discret. Appl. Math.
Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2014 J jnl
The Erdős-Pósa Property for Long Circuits.
J. Graph Theory
Dirk Meierling, Dieter Rautenbach, Thomas Sasse
2014 J jnl
The circumference of the square of a connected graph.
Comb.
Stephan Brandt, Janina Müttel, Dieter Rautenbach
2014 J jnl
Transversals of Longest Paths and Cycles.
SIAM J. Discret. Math.
Dieter Rautenbach, Jean-Sébastien Sereni
2013 J jnl
A short proof of the versatile version of Fleischner's theorem.
Discret. Math.
Janina Müttel, Dieter Rautenbach
2013 J jnl
Algorithmic and structural aspects of the P 3-Radon number.
Ann. Oper. Res.
Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman
2013 J jnl
Chiraptophobic Cockroaches evading a Torch Light.
Ars Comb.
Christian Löwenstein, Dieter Rautenbach, Friedrich Regen
2013 J jnl
Cycles in squares of trees without generalized claws.
Discret. Math.
Stephan Brandt, Janina Müttel, Dieter Rautenbach
2013 J jnl
Extending Berge's and Favaron's results about well-covered graphs.
Discret. Math.
Márcia R. Cappelle, Dieter Rautenbach
2013 J jnl
Geodetic Number versus Hull Number in P
SIAM J. Discret. Math.
Carmen C. Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá
2013 J jnl
Integral mixed unit interval graphs.
Discret. Appl. Math.
Van Bang Le, Dieter Rautenbach
2013 J jnl
Matchings in Graphs of Odd Regularity and Girth.
Electron. Notes Discret. Math.
Vítor Costa, Simone Dantas, Dieter Rautenbach
2013 J jnl
Matchings in graphs of odd regularity and girth.
Discret. Math.
Vítor Costa, Simone Dantas, Dieter Rautenbach
2013 J jnl
More fires and more fighters.
Discret. Appl. Math.
Vítor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2013 J jnl
On Minimal and Minimum Hull Sets.
Electron. Notes Discret. Math.
Rommel M. Barbosa, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter
2013 J jnl
On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7.
Discret. Math.
Rommel M. Barbosa, Márcia R. Cappelle, Dieter Rautenbach
2013 J jnl
On the Carathéodory number of interval and graph convexities.
Theor. Comput. Sci.
Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter
2013 J jnl
On the Cycle Spectrum of Cubic Hamiltonian Graphs.
Graphs Comb.
Janina Müttel, Dieter Rautenbach, Friedrich Regen, Thomas Sasse
2013 J jnl
On the geodetic Radon number of grids.
Discret. Math.
Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter
2013 J jnl
Open packing, total domination, and the
Discret. Math.
Michael A. Henning, Dieter Rautenbach, Philipp Matthias Schäfer
2013 J jnl
Polynomial time algorithm for the Radon number of grids in the geodetic convexity.
Electron. Notes Discret. Math.
Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter
2013 J jnl
Ramsey Results for Cycle Spectra.
J. Graph Theory
Stephan Brandt, Felix Joos, Janina Müttel, Dieter Rautenbach
2013 J jnl
Transversals of Longest Paths and Cycles
CoRR
Dieter Rautenbach, Jean-Sébastien Sereni
2013 J jnl
Unit Interval Graphs of Open and Closed Intervals.
J. Graph Theory
Dieter Rautenbach, Jayme Luiz Szwarcfiter
2012 B conf
Account on Intervals.
WG
Dieter Rautenbach
2012 J jnl
An upper bound on the P
Discret. Math.
Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman
2012 J jnl
Characterization and recognition of Radon-independent sets in split graphs.
Inf. Process. Lett.
Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter
2012 J jnl
Cycle spectra of Hamiltonian graphs.
J. Comb. Theory B
Kevin G. Milans, Florian Pfender, Dieter Rautenbach, Friedrich Regen, Douglas B. West
2012 J jnl
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
CoRR
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
2012 B conf
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs.
ISAAC
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
2012 J jnl
Graphs with many Vertex-Disjoint Cycles.
Discret. Math. Theor. Comput. Sci.
Dieter Rautenbach, Friedrich Regen
2012 J jnl
Greedy colorings of words.
Discret. Appl. Math.
Dieter Rautenbach, Zoltán Szigeti
2012 B conf
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity.
WG
Carmen Cecilia Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá
2012 J jnl
Independent sets and matchings in subcubic graphs.
Discret. Math.
Michael A. Henning, Christian Löwenstein, Dieter Rautenbach
2012 Misc conf
Integral Mixed Unit Interval Graphs.
COCOON
Van Bang Le, Dieter Rautenbach
2012 J jnl
Mixed unit interval graphs.
Discret. Math.
Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2012 J jnl
On the Carathéodory Number for the Convexity of Paths of Order Three.
SIAM J. Discret. Math.
Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2012 J jnl
On the Convexity Number of Graphs.
Graphs Comb.
Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2012 B conf
On the Radon Number for P 3-Convexity.
LATIN
Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman
2012 J jnl
Pairs of Disjoint Dominating Sets in Connected Cubic Graphs.
Graphs Comb.
Christian Löwenstein, Dieter Rautenbach
2012 J jnl
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.
J. Discrete Algorithms
Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
2012 J jnl
Reversible iterative graph processes.
Theor. Comput. Sci.
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2012 J jnl
The potential of greed for independence.
J. Graph Theory
Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach
2012 J jnl
Unit and single point interval graphs.
Discret. Appl. Math.
Dieter Rautenbach, Jayme Luiz Szwarcfiter
2011 J jnl
Average distance and domination number revisited.
Discret. Appl. Math.
Dieter Rautenbach
2011 J jnl
Characterization and representation problems for intersection betweennesses.
Discret. Appl. Math.
Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter
2011 — ch.
Combinatorial Optimization in VLSI Design.
Combinatorial Optimization - Methods and Applications
Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen
2011 J jnl
Connectivity and diameter in distance graphs.
Networks
Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2011 J jnl
Dominating sets, packings, and the maximum degree.
Discret. Math.
Michael A. Henning, Christian Löwenstein, Dieter Rautenbach
2011 J jnl
Finite Sholander trees, trees, and their betweenness.
Discret. Math.
Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer
2011 J jnl
Independence in connected graphs.
Discret. Appl. Math.
Jochen Harant, Dieter Rautenbach
2011 J jnl
Independence, odd girth, and average degree.
J. Graph Theory
Christian Löwenstein, Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen
2011 J jnl
Irreversible conversion of graphs.
Theor. Comput. Sci.
Carmen C. Centeno, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2011 J jnl
Lower bounds on the independence number of certain graphs of odd girth at least seven.
Discret. Appl. Math.
Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen
2011 J jnl
On Hamiltonian paths in distance graphs.
Appl. Math. Lett.
Christian Löwenstein, Dieter Rautenbach, Friedrich Regen
2011 J jnl
On finite convexity spaces induced by sets of paths in graphs.
Discret. Math.
Mitre Costa Dourado, Dieter Rautenbach, Philipp Matthias Schäfer
2011 J jnl
On subbetweennesses of trees: Hardness, algorithms, and characterizations.
Comput. Math. Appl.
Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter
2011 J jnl
On the Carathéodory Number for the Convexity of Paths of Order Three.
Electron. Notes Discret. Math.
Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2011 J jnl
Powers of cycles, powers of paths, and distance graphs.
Discret. Appl. Math.
Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2011 J jnl
Recolouring-resistant colourings.
Discret. Appl. Math.
Anders Sune Pedersen, Dieter Rautenbach
2011 J jnl
Strict Betweennesses Induced by Posets as well as by Graphs.
Order
Dieter Rautenbach, Philipp Matthias Schäfer
2011 C conf
The South Zone: Distributed Algorithms for Alliances.
SSS
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2011 J jnl
Unit Interval Graphs: A Story with Open Ends.
Electron. Notes Discret. Math.
Dieter Rautenbach, Jayme Luiz Szwarcfiter
2010 J jnl
An independent dominating set in the complement of a minimum dominating set of a tree.
Appl. Math. Lett.
Michael A. Henning, Christian Löwenstein, Dieter Rautenbach
2010 A conf
Brief Announcement: On Reversible and Irreversible Conversions.
DISC
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2010 J jnl
Convex Partitions of Graphs induced by Paths of Order Three.
Discret. Math. Theor. Comput. Sci.
Carmen C. Centeno, Simone Dantas, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2010 J jnl
Cycle length parities and the chromatic number.
J. Graph Theory
Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer
2010 J jnl
Disjoint dominating and total dominating sets in graphs.
Discret. Appl. Math.
Michael A. Henning, Christian Löwenstein, Dieter Rautenbach, Justin Southey
2010 J jnl
Edge colouring by total labellings.
Discret. Math.
Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz
2010 J jnl
Edge-Injective and Edge-Surjective Vertex Labellings.
SIAM J. Discret. Math.
Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, Friedrich Regen, Imre Z. Ruzsa
2010 J jnl
Exact leaf powers.
Theor. Comput. Sci.
Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
2010 J jnl
Interpolating between bounds on the independence number.
Discret. Math.
Anett Boßecker, Dieter Rautenbach
2010 J jnl
Long cycles and paths in distance graphs.
Discret. Math.
Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2010 J jnl
Minimum degree and density of binary sequences.
Eur. J. Comb.
Stephan Brandt, Janina Müttel, Dieter Rautenbach, Friedrich Regen
2010 J jnl
On the Hull Number of Triangle-Free Graphs.
SIAM J. Discret. Math.
Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2010 J jnl
Packing disjoint cycles over vertex cuts.
Discret. Math.
Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel
2010 J jnl
Packing edge-disjoint cycles in graphs and the cyclomatic number.
Discret. Math.
Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen
2010 J jnl
Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs.
Graphs Comb.
Christian Löwenstein, Dieter Rautenbach
2010 C conf
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes.
IWOCA
Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
2010 J jnl
Partitioning a graph into a dominating set, a total dominating set, and something else.
Discuss. Math. Graph Theory
Michael A. Henning, Christian Löwenstein, Dieter Rautenbach
2010 J jnl
Random Procedures for Dominating Sets in Graphs.
Electron. J. Comb.
Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
2010 J jnl
Some remarks on the geodetic number of a graph.
Discret. Math.
Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2010 J jnl
The repeater tree construction problem.
Inf. Process. Lett.
Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen
2009 J jnl
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers.
Discret. Math.
Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
2009 J jnl
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing.
J. Discrete Algorithms
Sven Peyer, Dieter Rautenbach, Jens Vygen
2009 J jnl
An Omega(nlogn) lower bound for computing the sum of even-ranked elements.
Inf. Process. Lett.
Marc Mörig, Dieter Rautenbach, Michiel H. M. Smid, Jan Tusch
2009 J jnl
Binary trees with choosable edge lengths.
Inf. Process. Lett.
Jens Maßberg, Dieter Rautenbach
2009 B conf
Cycles, Paths, Connectivity and Diameter in Distance Graphs.
WG
Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2009 J jnl
Domination in bipartite graphs.
Discret. Math.
Jochen Harant, Dieter Rautenbach
2009 J jnl
Edge irregular total labellings for graphs of linear size.
Discret. Math.
Stephan Brandt, Jozef Miskuf, Dieter Rautenbach
2009 — conf
Fast buffering for optimizing worst slack and resource consumption in repeater trees.
ISPD
Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
2009 J jnl
On
Discuss. Math. Graph Theory
Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
2009 J jnl
On packing shortest cycles in graphs.
Inf. Process. Lett.
Dieter Rautenbach, Friedrich Regen
2009 J jnl
On spanning tree congestion.
Discret. Math.
Christian Löwenstein, Dieter Rautenbach, Friedrich Regen
2009 J jnl
On the OBDD size for graphs of bounded tree- and clique-width.
Discret. Math.
Klaus Meer, Dieter Rautenbach
2009 J jnl
On the existence of edge cuts leaving several large components.
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2009 J jnl
Remarks about disjoint dominating sets.
Discret. Math.
Michael A. Henning, Christian Löwenstein, Dieter Rautenbach
2008 J jnl
A class of problems for which cyclic relaxation converges linearly.
Comput. Optim. Appl.
Dieter Rautenbach, Christian Szegedy
2008 J jnl
A conjecture of Borodin and a coloring of Grünbaum.
J. Graph Theory
Dieter Rautenbach
2008 J jnl
A note on domination, girth and minimum degree.
Discret. Math.
Dieter Rautenbach
2008 J jnl
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles.
Networks
Dieter Rautenbach, Lutz Volkmann
2008 J jnl
Domination in Graphs of Minimum Degree at least Two and Large Girth.
Graphs Comb.
Christian Löwenstein, Dieter Rautenbach
2008 J jnl
On a conjecture about edge irregular total labelings.
J. Graph Theory
Stephan Brandt, Jozef Miskuf, Dieter Rautenbach
2008 J jnl
On the cost of optimal alphabetic code trees with unequal letter costs.
Eur. J. Comb.
Dieter Rautenbach, Christian Szegedy, Jürgen Werber
2008 J jnl
Some remarks on lambda
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2008 J jnl
The independence number in graphs of maximum degree three.
Discret. Math.
Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer
2008 J jnl
alpha-Domination perfect trees.
Discret. Math.
F. Dahme, Dieter Rautenbach, Lutz Volkmann
2007 J jnl
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip.
Proc. IEEE
Bernhard Korte, Dieter Rautenbach, Jens Vygen
2007 J jnl
Dominating and large induced trees in regular graphs.
Discret. Math.
Dieter Rautenbach
2007 — conf
Domination in Cubic Graphs of Large Girth.
KyotoCGGT
Dieter Rautenbach, Bruce A. Reed
2007 J jnl
New bounds on the
Appl. Math. Lett.
Dieter Rautenbach, Lutz Volkmann
2007 J jnl
On the irregularity of bipartite graphs.
Discret. Math.
Michael A. Henning, Dieter Rautenbach
2007 J jnl
Reconstructing graphs from size and degree properties of their induced k-subgraphs.
Discret. Math.
Yair Caro, Dieter Rautenbach
2007 J jnl
Regular Weighted Graphs Without Positive Cuts.
Ars Comb.
Dieter Rautenbach
2007 J jnl
Small step-dominating sets in trees.
Discret. Math.
Frédéric Maffray, Dieter Rautenbach
2007 J jnl
The delay of circuits whose inputs have specified arrival times.
Discret. Appl. Math.
Dieter Rautenbach, Christian Szegedy, Jürgen Werber
2007 J jnl
The relative clique-width of a graph.
J. Comb. Theory B
Vadim V. Lozin, Dieter Rautenbach
2007 A conf
Timing optimization by restructuring long combinatorial paths.
ICCAD
Jürgen Werber, Dieter Rautenbach, Christian Szegedy
2006 J jnl
A Conjecture of Borodin and a Coloring of Grünbaum.
Electron. Notes Discret. Math.
Dieter Rautenbach
2006 J jnl
A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2.
Discret. Math.
Kefeng Diao, Guizhen Liu, Dieter Rautenbach, Ping Zhao
2006 J jnl
Delay optimization of linear depth boolean circuits with prescribed input arrival times.
J. Discrete Algorithms
Dieter Rautenbach, Christian Szegedy, Jürgen Werber
2006 J jnl
Distance-Hereditary 5-Leaf Powers.
Electron. Notes Discret. Math.
Dieter Rautenbach, Andreas Brandstädt, Van Bang Le
2006 — conf
Efficient generation of short and fast repeater tree topologies.
ISPD
Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
2006 J jnl
Extremal Problems for Imbalanced Edges.
Graphs Comb.
Dieter Rautenbach, Ingo Schiermeyer
2006 — conf
Fundamental Limits on the Anonymity Provided by the MIX Technique.
S&P
Dogan Kesdogan, Dakshi Agrawal, Dang Vinh Pham, Dieter Rautenbach
2006 — conf
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.
IWPEC
Klaus Meer, Dieter Rautenbach
2006 J jnl
Some remarks about leaf roots.
Discret. Math.
Dieter Rautenbach
2006 J jnl
The tree- and clique-width of bipartite graphs in special classes.
Australas. J Comb.
Vadim V. Lozin, Dieter Rautenbach
2006 J jnl
t-partitions and s-complete t-partitions of a graph.
Australas. J Comb.
Odile Favaron, Renu C. Laskar, Dieter Rautenbach
2005 J jnl
A note on the number of matchings and independent sets in trees.
Discret. Appl. Math.
Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach
2005 J jnl
Cuts leaving components of given minimum order.
Discret. Math.
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
2005 J jnl
Extremal Trees with Respect to Dominance Order.
Ars Comb.
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
2005 J jnl
Lower bounds on treespan.
Inf. Process. Lett.
Dieter Rautenbach
2005 J jnl
On the maximum number of cycles in a Hamiltonian graph.
Discret. Math.
Dieter Rautenbach, Irene Stella
2004 J jnl
Chordal bipartite graphs of bounded tree- and clique-width.
Discret. Math.
Vadim V. Lozin, Dieter Rautenbach
2004 J jnl
Competition polysemy.
Discret. Math.
Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach
2004 J jnl
Graphs with small additive stretch number.
Discuss. Math. Graph Theory
Dieter Rautenbach
2004 J jnl
Note on the connectivity of line graphs.
Inf. Process. Lett.
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
2004 J jnl
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree.
SIAM J. Discret. Math.
Vadim V. Lozin, Dieter Rautenbach
2004 J jnl
Propagation of Mean Degrees.
Electron. J. Comb.
Dieter Rautenbach
2004 J jnl
Rectilinear Spanning Trees Versus Bounding Boxes.
Electron. J. Comb.
Dieter Rautenbach
2004 J jnl
Some remarks on alpha-domination.
Discuss. Math. Graph Theory
F. Dahme, Dieter Rautenbach, Lutz Volkmann
2004 J jnl
The Numbers of Shared Upper Bounds Determine a Poset.
Order
Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach
2004 J jnl
The solution of two problems on bound polysemy.
Discret. Math.
Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach
2003 J jnl
A Linear-programming Approach to the Generalized Randic Index.
Discret. Appl. Math.
Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann
2003 J jnl
A note on trees of maximum weight and restricted degrees.
Discret. Math.
Dieter Rautenbach
2003 J jnl
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees.
Discret. Appl. Math.
Charles Delorme, Odile Favaron, Dieter Rautenbach
2003 J jnl
Extremal subgraphs with respect to vertex degree bounds.
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2003 J jnl
Finite sets in Rn given up to translation have reconstruction number three.
Ars Comb.
Dieter Rautenbach
2003 J jnl
Four traps are almost always enough to catch a square-celled animal.
Ars Comb.
Dieter Rautenbach
2003 J jnl
Maximum graphs with a unique minimum dominating set.
Discret. Math.
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
2003 J jnl
On alpha
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2003 J jnl
Remarks on the bondage number of planar graphs.
Discret. Math.
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
2003 J jnl
Some results on graphs without long induced paths.
Inf. Process. Lett.
Vadim V. Lozin, Dieter Rautenbach
2002 J jnl
Extensions of α-polynomial classes.
Australas. J Comb.
Dieter Rautenbach, Igor E. Zverovich, Inessa I. Zverovich
2002 J jnl
How local irregularity gets global in a graph.
J. Graph Theory
Dieter Rautenbach, Lutz Volkmann
2002 J jnl
Independent domination and matchings in graphs.
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2002 J jnl
On Kelly's lemma for infinite sets of integers.
Discret. Math.
Dieter Rautenbach
2002 J jnl
On a Reconstruction Problem of Harary and Manvel.
J. Comb. Theory A
Dieter Rautenbach
2002 J jnl
On the Randic Image index.
Discret. Math.
Charles Delorme, Odile Favaron, Dieter Rautenbach
2002 J jnl
On the reconstruction of the degree sequence.
Discret. Math.
Charles Delorme, Odile Favaron, Dieter Rautenbach
2002 J jnl
Reconstructing Infinite Sets of Integers.
J. Comb. Theory A
Dieter Rautenbach, Eberhard Triesch
2002 J jnl
Reconstructing infinite objects.
Discret. Math.
Dieter Rautenbach
2002 J jnl
Reconstruction up to isometries.
Discret. Math.
Dieter Rautenbach, Eberhard Triesch
2002 J jnl
Weighted domination in triangle-free graphs.
Discret. Math.
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
2002 J jnl
Wiener index versus maximum degree in trees.
Discret. Appl. Math.
Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann
2001 A* conf
Approximately covering by cycles in planar graphs.
SODA
Dieter Rautenbach, Bruce A. Reed
2001 J jnl
On domination and annihilation in graphs with claw-free blocks.
Discret. Math.
Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach
2001 J jnl
On vertex orderings and the stability number in triangle-free graphs.
Discret. Math.
Dieter Rautenbach
2001 J jnl
Perfect graphs of strong domination and independent strong domination.
Discret. Math.
Dieter Rautenbach, Vadim E. Zverovich
2001 J jnl
Reconstructing Finite Sets of Points in
Eur. J. Comb.
Dieter Rautenbach
2001 J jnl
The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs.
Comb.
Dieter Rautenbach, Bruce A. Reed
2001 J jnl
i gamma(1)-perfect graphs.
Discret. Math.
Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann
2000 J jnl
A characterization of rho alpha(
Discret. Math.
Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann
2000 J jnl
Bounds on the strong domination number.
Discret. Math.
Dieter Rautenbach
2000 J jnl
Some results on graph parameters in weighted graphs.
Electron. Notes Discret. Math.
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
1999 J jnl
A linear vizing-like relation between the size and the domination number of a graph.
J. Graph Theory
Dieter Rautenbach
1999 J jnl
On the differences between the upper irredundance, upper domination and independence numbers of a graph.
Discret. Math.
Dieter Rautenbach
1999 J jnl
The influence of special vertices on strong domination.
Discret. Math.
Dieter Rautenbach
1998 J jnl
Bounds on the weak domination number.
Australas. J Comb.
Dieter Rautenbach
1998 J jnl
Some structural results on linear arboricity.
Australas. J Comb.
Dieter Rautenbach, Lutz Volkmann
1998 J jnl
The domatic number of block-cactus graphs.
Discret. Math.
Dieter Rautenbach, Lutz Volkmann