Dieter Rautenbach

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 131

Top Venues

Publications

Dieter Rautenbach, Florian Werner
Induced Subforests and Superforests. CoRR (2024)
Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner
Bounding the Mostar index. Discret. Math. 347 (1) (2024)
Dieter Rautenbach, Florian Werner
Largest common subgraph of two forests. CoRR (2024)
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. 346 (2024)
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
On Conflict-Free Cuts: Algorithms and Complexity. CoRR (2023)
Johannes Pardey, Dieter Rautenbach
Vertex degrees close to the average degree. CoRR (2023)
Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach
A bound on the dissociation number. J. Graph Theory 103 (4) (2023)
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Electron. J. Comb. 30 (1) (2023)
Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner
Maximizing the Mostar index for bipartite graphs and split graphs. Discret. Optim. 48 (Part 1) (2023)
Dieter Rautenbach, Florian Werner
Irregularity of Graphs Respecting Degree Bounds. Electron. J. Comb. 30 (4) (2023)
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
Exact and Parameterized Algorithms for the Independent Cutset Problem. CoRR (2023)
Johannes Pardey, Dieter Rautenbach
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation. Discret. Appl. Math. 328 (2023)
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
Exact and Parameterized Algorithms for the Independent Cutset Problem. FCT (2023)
Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach
Relating the independence number and the dissociation number. J. Graph Theory 104 (2) (2023)
Johannes Rauch, Dieter Rautenbach
Efficiently recognizing graphs with equal independence and annihilation numbers. Inf. Process. Lett. 182 (2023)
Felix Bock, Rafal Kalinowski, Johannes Pardey, Monika Pilsniak, Dieter Rautenbach, Mariusz Wozniak
Majority Edge-Colorings of Graphs. Electron. J. Comb. 30 (1) (2023)
Vanessa Hiebeler, Johannes Pardey, Dieter Rautenbach
-freeness. Discret. Math. 346 (5) (2023)
Johannes Pardey, Dieter Rautenbach
Vertex degrees close to the average degree. Discret. Math. 346 (12) (2023)
Stefan Ehard, Elena Mohr, Dieter Rautenbach
Biholes in balanced bipartite graphs. Discuss. Math. Graph Theory 43 (4) (2023)
Julien Baste, Maximilian Fürst, Dieter Rautenbach
Acyclic matchings in graphs of bounded maximum degree. Discret. Math. 345 (7) (2022)
Oliver Bendele, Dieter Rautenbach
. Theor. Comput. Sci. 914 (2022)
Elena Mohr, Johannes Pardey, Dieter Rautenbach
Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs. Graphs Comb. 38 (5) (2022)
Stéphane Bessy, Dieter Rautenbach
Algorithmic aspects of broadcast independence. Discret. Appl. Math. 314 (2022)
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
The hull number in the convexity of induced paths of order 3. Theor. Comput. Sci. 906 (2022)
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach
Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound. Electron. J. Comb. 29 (2) (2022)
Julien Baste, Stefan Ehard, Dieter Rautenbach
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Elena Mohr, Dieter Rautenbach
On Hamiltonian cycles in claw-free cubic graphs. Discuss. Math. Graph Theory 42 (1) (2022)
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
On the computational complexity of the bipartizing matching problem. Ann. Oper. Res. 316 (2) (2022)
Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach
Relating dissociation, independence, and matchings. Discret. Appl. Math. 322 (2022)
Johannes Pardey, Dieter Rautenbach
Almost color-balanced perfect matchings in color-balanced complete graphs. Discret. Math. 345 (2) (2022)
Dieter Rautenbach, Johannes Redl
Reconfiguring Dominating Sets in Minor-Closed Graph Classes. Graphs Comb. 37 (6) (2021)
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
Bounding and approximating minimum maximal matchings in regular graphs. Discret. Math. 344 (3) (2021)
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR (2021)
Elena Mohr, Dieter Rautenbach
Cubic graphs with equal independence number and matching number. Discret. Math. 344 (1) (2021)
Stéphane Bessy, Johannes Pardey, Dieter Rautenbach
Exponential independence in subcubic graphs. Discret. Math. 344 (8) (2021)
Maximilian Fürst, Dieter Rautenbach
Uniquely restricted matchings in subcubic graphs without short cycles. J. Graph Theory 96 (4) (2021)
Elena Mohr, Dieter Rautenbach
On the maximum number of maximum independent sets in connected graphs. J. Graph Theory 96 (4) (2021)
Kelly Guest, Sarah Holliday, Peter D. Johnson Jr., Dieter Rautenbach, Matthew Walsh
Closed-neighborhood union-closed graphs. Australas. J Comb. 77 (2020)
Stefan Ehard, Elena Mohr, Dieter Rautenbach
Low Weight Perfect Matchings. Electron. J. Comb. 27 (4) (2020)
Oliver Bendele, Dieter Rautenbach
Additive Tree O(ρ log n)-Spanners from Tree Breadth ρ. CoRR (2020)
Maximilian Fürst, Dieter Rautenbach
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs. Theor. Comput. Sci. 804 (2020)
Julien Baste, Stefan Ehard, Dieter Rautenbach
Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree. CoRR (2020)
Julien Baste, Maximilian Fürst, Dieter Rautenbach
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. COCOON (2020)
Maximilian Fürst, Dieter Rautenbach
A short proof for a lower bound on the zero forcing number. Discuss. Math. Graph Theory 40 (1) (2020)
Mitre Costa Dourado, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
Partial immunization of trees. Discret. Optim. 35 (2020)
Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter
Constant threshold intersection graphs of orthodox paths in trees. Discret. Appl. Math. 281 (2020)
Stefan Ehard, Dieter Rautenbach
Approximating connected safe sets in weighted trees. Discret. Appl. Math. 281 (2020)
Julien Baste, Maximilian Fürst, Dieter Rautenbach
Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier. Discret. Optim. 38 (2020)
Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach
maximum degrees in graphs without short cycles. Discuss. Math. Graph Theory 40 (3) (2020)
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
Domination versus edge domination. Discret. Appl. Math. 285 (2020)
José D. Alvarado, Simone Dantas, Elena Mohr, Dieter Rautenbach
On the maximum number of minimum dominating sets in forests. Discret. Math. 342 (4) (2019)
Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
Dynamic monopolies for interval graphs with bounded thresholds. Discret. Appl. Math. 260 (2019)
Julien Baste, Dieter Rautenbach, Ignasi Sau
Approximating maximum uniquely restricted matchings in bipartite graphs. Discret. Appl. Math. 267 (2019)
Michael A. Henning, Elena Mohr, Dieter Rautenbach
On the maximum number of minimum total dominating sets in forests. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Stefan Ehard, Dieter Rautenbach
Vaccinate your trees! Theor. Comput. Sci. 772 (2019)
José D. Alvarado, Simone Dantas, Dieter Rautenbach
Sandwiches missing two ingredients of order four. Ann. Oper. Res. 280 (1-2) (2019)
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
On the Kőnig?Egerváry theorem for k?paths. J. Graph Theory 91 (1) (2019)
Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Lucia Draque Penso, Dieter Rautenbach
Identifying Codes in the Complementary Prism of Cycles. LAGOS (2019)
Maximilian Fürst, Dieter Rautenbach
On some hard and some tractable cases of the maximum acyclic matching problem. Ann. Oper. Res. 279 (1-2) (2019)
Christoph Brause, Stefan Ehard, Dieter Rautenbach
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives. Discret. Math. 342 (7) (2019)
Maximilian Fürst, Michael A. Henning, Dieter Rautenbach
Uniquely restricted matchings in subcubic graphs. Discret. Appl. Math. 262 (2019)
Julien Baste, Dieter Rautenbach, Ignasi Sau
Upper bounds on the uniquely restricted chromatic index. J. Graph Theory 91 (3) (2019)
Dirk Meierling, Dieter Rautenbach
Forcing brushes. Discret. Appl. Math. 257 (2019)
Felix Bock, Dieter Rautenbach
On matching numbers of tree and bipartite degree sequences. Discret. Math. 342 (6) (2019)
Maximilian Fürst, Dieter Rautenbach
Lower Bounds on the Uniquely Restricted Matching Number. Graphs Comb. 35 (1) (2019)
Stéphane Bessy, Dieter Rautenbach
Relating broadcast independence and independence. Discret. Math. 342 (12) (2019)
Stefan Ehard, Dieter Rautenbach
On some tractable and hard instances for partial incentives and target set selection. Discret. Optim. 34 (2019)
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
The Hull Number in the Convexity of Induced Paths of Order 3. IWOCA (2019)
Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin
Bounds on the burning number. Discret. Appl. Math. 235 (2018)
Michael A. Henning, Simon Jäger, Dieter Rautenbach
Hereditary equality of domination and exponential domination. Discuss. Math. Graph Theory 38 (1) (2018)
Michael Gentner, Irene Heinrich, Simon Jäger, Dieter Rautenbach
Large values of the clustering coefficient. Discret. Math. 341 (1) (2018)
Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza
Graphs in which some and every maximum matching is uniquely restricted. J. Graph Theory 89 (1) (2018)
Julien Baste, Dieter Rautenbach
Degenerate matchings and edge colorings. Discret. Appl. Math. 239 (2018)
Letícia Rodrigues Bueno, Lucia Draque Penso, Fábio Protti, Victor R. Ramos, Dieter Rautenbach, Uéverton S. Souza
On the hardness of finding the geodetic number of a subcubic graph. Inf. Process. Lett. 135 (2018)
Elena Mohr, Dieter Rautenbach
On the Maximum Number of Maximum Independent Sets. Graphs Comb. 34 (6) (2018)
Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
Dynamic monopolies for interval graphs with bounded thresholds. CoRR (2018)
Dennis Dayanikli, Dieter Rautenbach
Approximately locating an invisible agent in a graph with relative distance queries. Discret. Math. 341 (8) (2018)
Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
The Geodetic Hull Number is Hard for Chordal Graphs. SIAM J. Discret. Math. 32 (1) (2018)
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Bipartizing with a Matching. COCOA (2018)
Dieter Rautenbach, Moritz Schneider
The cat and the noisy mouse. Discret. Math. 341 (4) (2018)
Michael Gentner, Michael A. Henning, Dieter Rautenbach
Smallest domination number and largest independence number of graphs and forests with given degree sequence. J. Graph Theory 88 (1) (2018)
Stefan Ehard, Dieter Rautenbach
On some tractable and hard instances for partial incentives and target set selection. CoRR (2018)
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
On some graphs with a unique perfect matching. Inf. Process. Lett. 139 (2018)
Michael Gentner, Dieter Rautenbach
Some bounds on the zero forcing number of a graph. Discret. Appl. Math. 236 (2018)
Maximilian Fürst, Marilena Leichter, Dieter Rautenbach
Locally searching for large induced matchings. Theor. Comput. Sci. 720 (2018)
José D. Alvarado, Simone Dantas, Dieter Rautenbach
Dominating sets inducing large components in maximal outerplanar graphs. J. Graph Theory 88 (2) (2018)
Maximilian Fürst, Dieter Rautenbach
A lower bound on the acyclic matching number of subcubic graphs. Discret. Math. 341 (8) (2018)
Carlos Vinícius G. C. Lima, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
And/or-convexity: a graph convexity based on processes and deadlock models. Ann. Oper. Res. 264 (1-2) (2018)
Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza
Complexity properties of complementary prisms. J. Comb. Optim. 33 (2) (2017)
Michael Gentner, Dieter Rautenbach
Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees. Theor. Comput. Sci. 667 (2017)
Stéphane Bessy, Dieter Rautenbach
Extremal Values of the Chromatic Number for a Given Degree Sequence. Graphs Comb. 33 (4) (2017)
Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability. Discret. Math. 340 (4) (2017)
Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
The Geodetic Hull Number is Hard for Chordal Graphs. CoRR (2017)
Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza
-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]. Theor. Comput. Sci. 704 (2017)
Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter
Eliminating Odd Cycles by Removing a Matching. CoRR (2017)
Oliver Bendele, Dieter Rautenbach
Optimal Colorings with Rainbow Paths. Graphs Comb. 33 (4) (2017)
Simon Jäger, Dieter Rautenbach
Exponential independence. Discret. Math. 340 (11) (2017)
Michael A. Henning, Simon Jäger, Dieter Rautenbach
Relating domination, exponential domination, and porous exponential domination. Discret. Optim. 23 (2017)
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
On some Graphs with a Unique Perfect Matching. CoRR (2017)
Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
Geodetic convexity parameters for (q, q-4)-graphs. Discret. Appl. Math. 223 (2017)

Dieter Rautenbach.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dieter Rautenbach