default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDieter Rautenbach
Person information
- affiliation: University of Ulm, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j300]Johannes Rauch
, Dieter Rautenbach, Uéverton S. Souza:
On conflict-free cuts: Algorithms and complexity. Inf. Process. Lett. 187: 106503 (2025)- [j299]Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
Exact and parameterized algorithms for the independent cutset problem. J. Comput. Syst. Sci. 148: 103598 (2025) - 2024
- [j298]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: 80-94 (2024) - [j297]Michael A. Henning, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Mostar index and bounded maximum degree. Discret. Optim. 54: 100861 (2024) - [j296]Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Bounding the Mostar index. Discret. Math. 347(1): 113704 (2024) - [i22]Dieter Rautenbach, Florian Werner:
Largest common subgraph of two forests. CoRR abs/2403.03696 (2024) - [i21]Dieter Rautenbach, Florian Werner:
Induced Subforests and Superforests. CoRR abs/2403.14492 (2024) - [i20]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter, Florian Werner:
Complexity of Deciding the Equality of Matching Numbers. CoRR abs/2409.04855 (2024) - 2023
- [j295]Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach:
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Electron. J. Comb. 30(1) (2023) - [j294]Felix Bock, Rafal Kalinowski, Johannes Pardey, Monika Pilsniak, Dieter Rautenbach, Mariusz Wozniak:
Majority Edge-Colorings of Graphs. Electron. J. Comb. 30(1) (2023) - [j293]Dieter Rautenbach, Florian Werner:
Irregularity of Graphs Respecting Degree Bounds. Electron. J. Comb. 30(4) (2023) - [j292]Johannes Pardey, Dieter Rautenbach:
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation. Discret. Appl. Math. 328: 108-116 (2023) - [j291]Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Maximizing the Mostar index for bipartite graphs and split graphs. Discret. Optim. 48(Part 1): 100768 (2023) - [j290]Vanessa Hiebeler, Johannes Pardey, Dieter Rautenbach:
Diameter, edge-connectivity, and C4-freeness. Discret. Math. 346(5): 113318 (2023) - [j289]Johannes Pardey, Dieter Rautenbach:
Vertex degrees close to the average degree. Discret. Math. 346(12): 113599 (2023) - [j288]Stefan Ehard, Elena Mohr, Dieter Rautenbach:
Biholes in balanced bipartite graphs. Discuss. Math. Graph Theory 43(4): 1203-1213 (2023) - [j287]Johannes Rauch, Dieter Rautenbach:
Efficiently recognizing graphs with equal independence and annihilation numbers. Inf. Process. Lett. 182: 106387 (2023) - [j286]Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach:
A bound on the dissociation number. J. Graph Theory 103(4): 661-673 (2023) - [j285]Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach:
Relating the independence number and the dissociation number. J. Graph Theory 104(2): 320-340 (2023) - [c26]Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
Exact and Parameterized Algorithms for the Independent Cutset Problem. FCT 2023: 378-391 - [i19]Johannes Pardey, Dieter Rautenbach:
Vertex degrees close to the average degree. CoRR abs/2301.07953 (2023) - [i18]Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
Exact and Parameterized Algorithms for the Independent Cutset Problem. CoRR abs/2307.02107 (2023) - [i17]Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
On Conflict-Free Cuts: Algorithms and Complexity. CoRR abs/2311.01077 (2023) - 2022
- [j284]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): 1235-1256 (2022) - [j283]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) - [j282]Stéphane Bessy, Dieter Rautenbach:
Algorithmic aspects of broadcast independence. Discret. Appl. Math. 314: 142-149 (2022) - [j281]Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach:
Relating dissociation, independence, and matchings. Discret. Appl. Math. 322: 160-165 (2022) - [j280]Johannes Pardey, Dieter Rautenbach:
Almost color-balanced perfect matchings in color-balanced complete graphs. Discret. Math. 345(2): 112701 (2022) - [j279]Julien Baste, Maximilian Fürst, Dieter Rautenbach:
Acyclic matchings in graphs of bounded maximum degree. Discret. Math. 345(7): 112885 (2022) - [j278]Elena Mohr, Dieter Rautenbach:
On Hamiltonian cycles in claw-free cubic graphs. Discuss. Math. Graph Theory 42(1): 309-313 (2022) - [j277]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) - [j276]Elena Mohr, Johannes Pardey, Dieter Rautenbach:
Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs. Graphs Comb. 38(5): 132 (2022) - [j275]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The hull number in the convexity of induced paths of order 3. Theor. Comput. Sci. 906: 52-63 (2022) - [j274]Oliver Bendele, Dieter Rautenbach:
Additive tree O(ρlogn)-spanners from tree breadth ρ. Theor. Comput. Sci. 914: 39-46 (2022) - 2021
- [j273]Elena Mohr, Dieter Rautenbach:
Cubic graphs with equal independence number and matching number. Discret. Math. 344(1): 112178 (2021) - [j272]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): 112243 (2021) - [j271]Stéphane Bessy, Johannes Pardey, Dieter Rautenbach:
Exponential independence in subcubic graphs. Discret. Math. 344(8): 112439 (2021) - [j270]Dieter Rautenbach, Johannes Redl:
Reconfiguring Dominating Sets in Minor-Closed Graph Classes. Graphs Comb. 37(6): 2191-2205 (2021) - [j269]Elena Mohr, Dieter Rautenbach:
On the maximum number of maximum independent sets in connected graphs. J. Graph Theory 96(4): 510-521 (2021) - [j268]Maximilian Fürst, Dieter Rautenbach:
Uniquely restricted matchings in subcubic graphs without short cycles. J. Graph Theory 96(4): 578-593 (2021) - [i16]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 abs/2105.01582 (2021) - 2020
- [j267]Kelly Guest, Sarah H. Holliday, Peter D. Johnson Jr., Dieter Rautenbach, Matthew Walsh:
Closed-neighborhood union-closed graphs. Australas. J Comb. 77: 144-156 (2020) - [j266]Stefan Ehard, Elena Mohr, Dieter Rautenbach:
Low Weight Perfect Matchings. Electron. J. Comb. 27(4): 4 (2020) - [j265]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: 61-68 (2020) - [j264]Stefan Ehard, Dieter Rautenbach:
Approximating connected safe sets in weighted trees. Discret. Appl. Math. 281: 216-223 (2020) - [j263]Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach:
Domination versus edge domination. Discret. Appl. Math. 285: 343-349 (2020) - [j262]Mitre Costa Dourado, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Partial immunization of trees. Discret. Optim. 35: 100568 (2020) - [j261]Julien Baste, Maximilian Fürst, Dieter Rautenbach:
Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier. Discret. Optim. 38: 100593 (2020) - [j260]Maximilian Fürst, Dieter Rautenbach:
A short proof for a lower bound on the zero forcing number. Discuss. Math. Graph Theory 40(1): 355-360 (2020) - [j259]Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach:
Equating k maximum degrees in graphs without short cycles. Discuss. Math. Graph Theory 40(3): 841-853 (2020) - [j258]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: 126-138 (2020) - [c25]Julien Baste, Maximilian Fürst, Dieter Rautenbach:
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. COCOON 2020: 542-553 - [i15]Oliver Bendele, Dieter Rautenbach:
Additive Tree O(ρ log n)-Spanners from Tree Breadth ρ. CoRR abs/2002.12103 (2020) - [i14]Julien Baste, Stefan Ehard, Dieter Rautenbach:
Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree. CoRR abs/2007.03959 (2020)
2010 – 2019
- 2019
- [j257]Maximilian Fürst, Dieter Rautenbach:
On some hard and some tractable cases of the maximum acyclic matching problem. Ann. Oper. Res. 279(1-2): 291-300 (2019) - [j256]José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Sandwiches missing two ingredients of order four. Ann. Oper. Res. 280(1-2): 47-63 (2019) - [j255]Dirk Meierling, Dieter Rautenbach:
Forcing brushes. Discret. Appl. Math. 257: 359-360 (2019) - [j254]Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Dynamic monopolies for interval graphs with bounded thresholds. Discret. Appl. Math. 260: 256-261 (2019) - [j253]Maximilian Fürst, Michael A. Henning, Dieter Rautenbach:
Uniquely restricted matchings in subcubic graphs. Discret. Appl. Math. 262: 189-194 (2019) - [j252]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Approximating maximum uniquely restricted matchings in bipartite graphs. Discret. Appl. Math. 267: 30-40 (2019) - [j251]Stefan Ehard, Dieter Rautenbach:
On some tractable and hard instances for partial incentives and target set selection. Discret. Optim. 34 (2019) - [j250]José D. Alvarado, Simone Dantas, Elena Mohr, Dieter Rautenbach:
On the maximum number of minimum dominating sets in forests. Discret. Math. 342(4): 934-942 (2019) - [j249]Felix Bock, Dieter Rautenbach:
On matching numbers of tree and bipartite degree sequences. Discret. Math. 342(6): 1687-1695 (2019) - [j248]Christoph Brause, Stefan Ehard, Dieter Rautenbach:
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives. Discret. Math. 342(7): 2127-2133 (2019) - [j247]Stéphane Bessy, Dieter Rautenbach:
Relating broadcast independence and independence. Discret. Math. 342(12) (2019) - [j246]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) - [j245]Maximilian Fürst, Dieter Rautenbach:
Lower Bounds on the Uniquely Restricted Matching Number. Graphs Comb. 35(1): 353-361 (2019) - [j244]Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
On the Kőnig?Egerváry theorem for k?paths. J. Graph Theory 91(1): 73-87 (2019) - [j243]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Upper bounds on the uniquely restricted chromatic index. J. Graph Theory 91(3): 251-258 (2019) - [j242]Stefan Ehard, Dieter Rautenbach:
Vaccinate your trees! Theor. Comput. Sci. 772: 46-57 (2019) - [c24]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Hull Number in the Convexity of Induced Paths of Order 3. IWOCA 2019: 214-228 - [c23]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: 241-251 - 2018
- [j241]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): 267-286 (2018) - [j240]Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin:
Bounds on the burning number. Discret. Appl. Math. 235: 16-22 (2018) - [j239]Michael Gentner, Dieter Rautenbach:
Some bounds on the zero forcing number of a graph. Discret. Appl. Math. 236: 203-213 (2018) - [j238]Julien Baste, Dieter Rautenbach:
Degenerate matchings and edge colorings. Discret. Appl. Math. 239: 38-44 (2018) - [j237]Michael Gentner, Irene Heinrich, Simon Jäger, Dieter Rautenbach:
Large values of the clustering coefficient. Discret. Math. 341(1): 119-125 (2018) - [j236]Dieter Rautenbach, Moritz Schneider:
The cat and the noisy mouse. Discret. Math. 341(4): 1032-1035 (2018) - [j235]Dennis Dayanikli, Dieter Rautenbach:
Approximately locating an invisible agent in a graph with relative distance queries. Discret. Math. 341(8): 2302-2307 (2018) - [j234]Maximilian Fürst, Dieter Rautenbach:
A lower bound on the acyclic matching number of subcubic graphs. Discret. Math. 341(8): 2353-2358 (2018) - [j233]Michael A. Henning, Simon Jäger, Dieter Rautenbach:
Hereditary equality of domination and exponential domination. Discuss. Math. Graph Theory 38(1): 275-285 (2018) - [j232]Elena Mohr, Dieter Rautenbach:
On the Maximum Number of Maximum Independent Sets. Graphs Comb. 34(6): 1729-1740 (2018) - [j231]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: 22-27 (2018) - [j230]Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach:
On some graphs with a unique perfect matching. Inf. Process. Lett. 139: 60-63 (2018) - [j229]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): 131-145 (2018) - [j228]José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Dominating sets inducing large components in maximal outerplanar graphs. J. Graph Theory 88(2): 356-370 (2018) - [j227]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): 55-63 (2018) - [j226]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): 543-547 (2018) - [j225]Maximilian Fürst, Marilena Leichter, Dieter Rautenbach:
Locally searching for large induced matchings. Theor. Comput. Sci. 720: 64-72 (2018) - [c22]Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Bipartizing with a Matching. COCOA 2018: 198-213 - [i13]Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Dynamic monopolies for interval graphs with bounded thresholds. CoRR abs/1802.03935 (2018) - [i12]Stefan Ehard, Dieter Rautenbach:
On some tractable and hard instances for partial incentives and target set selection. CoRR abs/1805.10086 (2018) - 2017
- [j224]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
Geodetic convexity parameters for (q, q-4)-graphs. Discret. Appl. Math. 223: 64-71 (2017) - [j223]Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin:
Burning a graph is hard. Discret. Appl. Math. 232: 73-87 (2017) - [j222]Michael A. Henning, Simon Jäger, Dieter Rautenbach:
Relating domination, exponential domination, and porous exponential domination. Discret. Optim. 23: 81-92 (2017) - [j221]Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
Bounds on the exponential domination number. Discret. Math. 340(3): 494-503 (2017) - [j220]Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer:
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability. Discret. Math. 340(4): 596-606 (2017) - [j219]Michael Gentner, Dieter Rautenbach:
Some comments on the Slater number. Discret. Math. 340(7): 1497-1502 (2017) - [j218]Simon Jäger, Dieter Rautenbach:
Exponential independence. Discret. Math. 340(11): 2650-2658 (2017) - [j217]José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Relating 2-rainbow domination to Roman domination. Discuss. Math. Graph Theory 37(4): 953-961 (2017) - [j216]Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach:
Intersection Graphs of Orthodox Paths in Trees. Electron. Notes Discret. Math. 62: 99-104 (2017) - [j215]Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. Electron. Notes Discret. Math. 62: 291-296 (2017) - [j214]Oliver Bendele, Dieter Rautenbach:
Optimal Colorings with Rainbow Paths. Graphs Comb. 33(4): 729-734 (2017) - [j213]Stéphane Bessy, Dieter Rautenbach:
Extremal Values of the Chromatic Number for a Given Degree Sequence. Graphs Comb. 33(4): 789-799 (2017) - [j212]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Decycling with a matching. Inf. Process. Lett. 124: 26-29 (2017) - [j211]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): 365-372 (2017) - [j210]Michael Gentner, Dieter Rautenbach:
Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees. Theor. Comput. Sci. 667: 93-100 (2017) - [j209]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Generalized threshold processes on graphs. Theor. Comput. Sci. 689: 27-35 (2017) - [j208]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza:
Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]. Theor. Comput. Sci. 704: 92-93 (2017) - [c21]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Uniquely Restricted Matchings and Edge Colorings. WG 2017: 100-112 - [i11]José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Sandwiches Missing Two Ingredients of Order Four. CoRR abs/1704.01922 (2017) - [i10]Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. CoRR abs/1704.02242 (2017) - [i9]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Eliminating Odd Cycles by Removing a Matching. CoRR abs/1710.07741 (2017) - [i8]Stefan Ehard, Dieter Rautenbach:
Approximating Connected Safe Sets in Weighted Trees. CoRR abs/1711.11412 (2017) - [i7]Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach:
On some Graphs with a Unique Perfect Matching. CoRR abs/1712.04228 (2017) - 2016
- [j207]Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
Exponential Domination in Subcubic Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j206]Michael A. Henning, Felix Joos, Christian Löwenstein, Dieter Rautenbach:
Induced 2-regular subgraphs in k-chordal cubic graphs. Discret. Appl. Math. 205: 73-79 (2016) - [j205]José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Averaging 2-rainbow domination and Roman domination. Discret. Appl. Math. 205: 202-207 (2016) - [j204]Michael Gentner, Michael A. Henning, Dieter Rautenbach:
Largest domination number and smallest independence number of forests with given degree sequence. Discret. Appl. Math. 206: 181-187 (2016) - [j203]José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Strong equality of Roman and weak Roman domination in trees. Discret. Appl. Math. 208: 19-26 (2016) - [j202]Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer:
A lower bound on the independence number of a graph in terms of degrees and local clique sizes. Discret. Appl. Math. 209: 59-67 (2016) - [j201]Vítor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
Slash and burn on graphs - Firefighting with general weights. Discret. Appl. Math. 210: 4-13 (2016) - [j200]Mitre Costa Dourado, Vinícius Gusmão Pereira de Sá, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Near-linear-time algorithm for the geodetic Radon number of grids. Discret. Appl. Math. 210: 277-283 (2016) - [j199]Michael Gentner, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
Extremal values and bounds for the zero forcing number. Discret. Appl. Math. 214: 196-200 (2016) - [j198]Mitre Costa Dourado, Rodolfo Alves de Oliveira, Fábio Protti, Dieter Rautenbach:
On the geodetic iteration number of distance-hereditary graphs. Discret. Math. 339(2): 489-498 (2016) - [j197]Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Forbidden induced subgraphs for bounded p-intersection number. Discret. Math. 339(2): 533-538 (2016) - [j196]Piotr Borowiecki, Michael Gentner, Christian Löwenstein, Dieter Rautenbach:
Independence in uniform linear triangle-free hypergraphs. Discret. Math. 339(7): 1878-1883 (2016) - [j195]José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Dominating sets inducing large components. Discret. Math. 339(11): 2715-2720 (2016) - [j194]Jonas Eckert, Felix Joos, Dieter Rautenbach:
The Cycle Spectrum of Claw-free Hamiltonian Graphs. Graphs Comb. 32(1): 93-101 (2016) - [j193]Dirk Meierling, Janina Müttel, Dieter Rautenbach:
Cycles Avoiding a Color in Colorful Graphs. J. Graph Theory 81(4): 342-350 (2016) - [j192]Mitre Costa Dourado, Lucia Draque Penso Rautenbach, Dieter Rautenbach:
On the geodetic hull number of Pk-free graphs. Theor. Comput. Sci. 640: 52-60 (2016) - [c20]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. FOCS 2016: 695-703 - [c19]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
Geodetic Convexity Parameters for Graphs with Few Short Induced Paths. WG 2016: 25-37 - [i6]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to determine if a random graph with a fixed degree sequence has a giant component. CoRR abs/1601.03714 (2016) - [i5]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Uniquely restricted matchings and edge colorings. CoRR abs/1611.06815 (2016) - 2015
- [j191]Piotr Borowiecki, Dieter Rautenbach:
New potential functions for greedy independence and coloring. Discret. Appl. Math. 182: 61-72 (2015) - [j190]Márcia R. Cappelle, Felix Joos, Janina Müttel, Dieter Rautenbach:
Badly-covered graphs. Discret. Appl. Math. 182: 99-103 (2015) - [j189]Vítor Costa, Simone Dantas, Dieter Rautenbach:
Asymptotic surviving rate of trees with multiple fire sources. Discret. Appl. Math. 184: 14-19 (2015) - [j188]Dirk Meierling, Fábio Protti, Dieter Rautenbach, Aline Ribeiro de Almeida:
Cycles in complementary prisms. Discret. Appl. Math. 193: 180-186 (2015) - [j187]José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs. Discret. Appl. Math. 194: 154-159 (2015) - [j186]Lucia Draque Penso, Dieter Rautenbach, Aline Ribeiro de Almeida:
Brush your trees! Discret. Appl. Math. 194: 167-170 (2015) - [j185]Felix Joos, Van Bang Le, Dieter Rautenbach:
Forests and trees among Gallai graphs. Discret. Math. 338(2): 190-195 (2015) - [j184]José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Perfectly relating the domination, total domination, and paired domination numbers of a graph. Discret. Math. 338(8): 1424-1431 (2015) - [j183]Michael Gentner, Dieter Rautenbach:
Feedback vertex sets in cubic multigraphs. Discret. Math. 338(12): 2179-2185 (2015) - [j182]Tomislav Doslic, Dieter Rautenbach:
Factor-critical graphs with the minimum number of near-perfect matchings. Discret. Math. 338(12): 2318-2319 (2015) - [j181]Felix Joos, Dieter Rautenbach:
Equality of distance packing numbers. Discret. Math. 338(12): 2374-2377 (2015) - [j180]Carmen C. Centeno, Dieter Rautenbach:
Remarks on dynamic monopolies with given average thresholds. Discuss. Math. Graph Theory 35(1): 133-140 (2015) - [j179]Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza:
On Graphs with Induced Matching Number Almost Equal to Matching Number. Electron. Notes Discret. Math. 50: 9-14 (2015) - [j178]Dirk Meierling, Dieter Rautenbach:
Cycle Lengths of Hamiltonian Pℓ-free Graphs. Graphs Comb. 31(6): 2335-2345 (2015) - [j177]Min Chih Lin, Veronica A. Moyano, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The Maximum Number of Dominating Induced Matchings. J. Graph Theory 78(4): 258-268 (2015) - [j176]Mitre Costa Dourado, Dirk Meierling, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida:
Robust recoverable perfect matchings. Networks 66(3): 210-213 (2015) - [j175]Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
Maximum induced matchings close to maximum matchings. Theor. Comput. Sci. 588: 131-137 (2015) - [j174]Dieter Rautenbach:
Two greedy consequences for maximum induced matchings. Theor. Comput. Sci. 602: 32-38 (2015) - [j173]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza:
Complexity analysis of P3-convexity problems on bounded-degree and planar graphs. Theor. Comput. Sci. 607: 83-95 (2015) - [i4]Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti:
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4. CTW 2015: 197-200 - [i3]Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
The P3-Convexity in the Complementary Prism of a Graph. CTW 2015: 225-228 - 2014
- [j172]Stephan Brandt, Janina Müttel, Dieter Rautenbach:
The circumference of the square of a connected graph. Comb. 34(5): 547-559 (2014) - [j171]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Independent domination in subcubic bipartite graphs of girth at least six. Discret. Appl. Math. 162: 399-403 (2014) - [j170]Mitre Costa Dourado, Luérbio Faria, Miguel A. Pizaña, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On defensive alliances and strong global offensive alliances. Discret. Appl. Math. 163: 136-141 (2014) - [j169]Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The Carathéodory number of the P3 convexity of chordal graphs. Discret. Appl. Math. 172: 104-108 (2014) - [j168]Simone Dantas, Felix Joos, Christian Löwenstein, Deiwison S. Machado, Dieter Rautenbach:
Domination and total domination in cubic graphs of large girth. Discret. Appl. Math. 174: 128-132 (2014) - [j167]Michael A. Henning, Dieter Rautenbach:
Induced matchings in subcubic graphs without short cycles. Discret. Math. 315-316: 165-172 (2014) - [j166]Christian Löwenstein, Dieter Rautenbach, Roman Soták:
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs. Discret. Math. Theor. Comput. Sci. 16(1): 7-30 (2014) - [j165]Felix Joos, Christian Löwenstein, Fabiano de S. Oliveira, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Graphs of interval count two with a given partition. Inf. Process. Lett. 114(10): 542-546 (2014) - [j164]Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer:
Irreversible conversion processes with deadlines. J. Discrete Algorithms 26: 69-76 (2014) - [j163]Dirk Meierling, Dieter Rautenbach, Thomas Sasse:
The Erdős-Pósa Property for Long Circuits. J. Graph Theory 77(4): 251-259 (2014) - [j162]Dieter Rautenbach, Jean-Sébastien Sereni:
Transversals of Longest Paths and Cycles. SIAM J. Discret. Math. 28(1): 335-341 (2014) - [j161]Felix Joos, Dieter Rautenbach, Thomas Sasse:
Induced Matchings in Subcubic Graphs. SIAM J. Discret. Math. 28(1): 468-473 (2014) - [j160]Márcia R. Cappelle, Lucia Draque Penso, Dieter Rautenbach:
Recognizing some complementary products. Theor. Comput. Sci. 521: 1-7 (2014) - [c18]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza:
On P 3-Convexity of Graphs with Bounded Degree. AAIM 2014: 263-274 - [c17]Vladimir Nikolov, Steffen Kächele, Franz J. Hauck, Dieter Rautenbach:
CLOUDFARM: An Elastic Cloud Platform with Flexible and Adaptive Resource Management. UCC 2014: 547-553 - 2013
- [j159]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman:
Algorithmic and structural aspects of the P 3-Radon number. Ann. Oper. Res. 206(1): 75-91 (2013) - [j158]Christian Löwenstein, Dieter Rautenbach, Friedrich Regen:
Chiraptophobic Cockroaches evading a Torch Light. Ars Comb. 111: 181-192 (2013) - [j157]Van Bang Le, Dieter Rautenbach:
Integral mixed unit interval graphs. Discret. Appl. Math. 161(7-8): 1028-1036 (2013) - [j156]Vítor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
More fires and more fighters. Discret. Appl. Math. 161(16-17): 2410-2419 (2013) - [j155]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
On the geodetic Radon number of grids. Discret. Math. 313(1): 111-121 (2013) - [j154]Michael A. Henning, Dieter Rautenbach, Philipp Matthias Schäfer:
Open packing, total domination, and the P3-Radon number. Discret. Math. 313(9): 992-998 (2013) - [j153]Rommel M. Barbosa, Márcia R. Cappelle, Dieter Rautenbach:
On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7. Discret. Math. 313(16): 1630-1635 (2013) - [j152]Janina Müttel, Dieter Rautenbach:
A short proof of the versatile version of Fleischner's theorem. Discret. Math. 313(19): 1929-1933 (2013) - [j151]Stephan Brandt, Janina Müttel, Dieter Rautenbach:
Cycles in squares of trees without generalized claws. Discret. Math. 313(19): 1989-1999 (2013) - [j150]Márcia R. Cappelle, Dieter Rautenbach:
Extending Berge's and Favaron's results about well-covered graphs. Discret. Math. 313(23): 2742-2747 (2013) - [j149]Vítor Costa, Simone Dantas, Dieter Rautenbach:
Matchings in graphs of odd regularity and girth. Discret. Math. 313(24): 2895-2902 (2013) - [j148]Vítor Costa, Simone Dantas, Dieter Rautenbach:
Matchings in Graphs of Odd Regularity and Girth. Electron. Notes Discret. Math. 44: 3-8 (2013) - [j147]Rommel M. Barbosa, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
On Minimal and Minimum Hull Sets. Electron. Notes Discret. Math. 44: 207-212 (2013) - [j146]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Polynomial time algorithm for the Radon number of grids in the geodetic convexity. Electron. Notes Discret. Math. 44: 371-376 (2013) - [j145]Janina Müttel, Dieter Rautenbach, Friedrich Regen, Thomas Sasse:
On the Cycle Spectrum of Cubic Hamiltonian Graphs. Graphs Comb. 29(4): 1067-1076 (2013) - [j144]Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit Interval Graphs of Open and Closed Intervals. J. Graph Theory 72(4): 418-429 (2013) - [j143]Stephan Brandt, Felix Joos, Janina Müttel, Dieter Rautenbach:
Ramsey Results for Cycle Spectra. J. Graph Theory 74(2): 210-215 (2013) - [j142]Carmen C. Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá:
Geodetic Number versus Hull Number in P3-Convexity. SIAM J. Discret. Math. 27(2): 717-731 (2013) - [j141]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter:
On the Carathéodory number of interval and graph convexities. Theor. Comput. Sci. 510: 127-135 (2013) - [i2]Dieter Rautenbach, Jean-Sébastien Sereni:
Transversals of Longest Paths and Cycles. CoRR abs/1302.5503 (2013) - 2012
- [j140]Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit and single point interval graphs. Discret. Appl. Math. 160(10-11): 1601-1609 (2012) - [j139]Dieter Rautenbach, Zoltán Szigeti:
Greedy colorings of words. Discret. Appl. Math. 160(12): 1872-1874 (2012) - [j138]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Independent sets and matchings in subcubic graphs. Discret. Math. 312(11): 1900-1910 (2012) - [j137]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman:
An upper bound on the P3-Radon number. Discret. Math. 312(16): 2433-2437 (2012) - [j136]Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Mixed unit interval graphs. Discret. Math. 312(22): 3357-3363 (2012) - [j135]Dieter Rautenbach, Friedrich Regen:
Graphs with many Vertex-Disjoint Cycles. Discret. Math. Theor. Comput. Sci. 14(2): 75-82 (2012) - [j134]Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Convexity Number of Graphs. Graphs Comb. 28(3): 333-345 (2012) - [j133]Christian Löwenstein, Dieter Rautenbach:
Pairs of Disjoint Dominating Sets in Connected Cubic Graphs. Graphs Comb. 28(3): 407-421 (2012) - [j132]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Characterization and recognition of Radon-independent sets in split graphs. Inf. Process. Lett. 112(24): 948-952 (2012) - [j131]Kevin G. Milans, Florian Pfender, Dieter Rautenbach, Friedrich Regen, Douglas B. West:
Cycle spectra of Hamiltonian graphs. J. Comb. Theory B 102(4): 869-874 (2012) - [j130]Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach:
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms 14: 207-213 (2012) - [j129]Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach:
The potential of greed for independence. J. Graph Theory 71(3): 245-259 (2012) - [j128]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. SIAM J. Discret. Math. 26(3): 929-939 (2012) - [j127]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Reversible iterative graph processes. Theor. Comput. Sci. 460: 16-25 (2012) - [c16]Van Bang Le, Dieter Rautenbach:
Integral Mixed Unit Interval Graphs. COCOON 2012: 495-506 - [c15]Andreas Brandstädt, Arne Leitert, Dieter Rautenbach:
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. ISAAC 2012: 267-277 - [c14]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: 267-278 - [c13]Dieter Rautenbach:
Account on Intervals. WG 2012: 1 - [c12]Carmen Cecilia Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá:
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity. WG 2012: 262-273 - [i1]Andreas Brandstädt, Arne Leitert, Dieter Rautenbach:
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. CoRR abs/1207.0953 (2012) - 2011
- [j126]Christian Löwenstein, Dieter Rautenbach, Friedrich Regen:
On Hamiltonian paths in distance graphs. Appl. Math. Lett. 24(7): 1075-1079 (2011) - [j125]Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter:
On subbetweennesses of trees: Hardness, algorithms, and characterizations. Comput. Math. Appl. 62(12): 4674-4681 (2011) - [j124]Jochen Harant, Dieter Rautenbach:
Independence in connected graphs. Discret. Appl. Math. 159(1): 79-86 (2011) - [j123]Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen:
Lower bounds on the independence number of certain graphs of odd girth at least seven. Discret. Appl. Math. 159(2-3): 143-151 (2011) - [j122]Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter:
Characterization and representation problems for intersection betweennesses. Discret. Appl. Math. 159(5): 389-395 (2011) - [j121]Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Powers of cycles, powers of paths, and distance graphs. Discret. Appl. Math. 159(7): 621-627 (2011) - [j120]Anders Sune Pedersen, Dieter Rautenbach:
Recolouring-resistant colourings. Discret. Appl. Math. 159(10): 1013-1021 (2011) - [j119]Dieter Rautenbach:
Average distance and domination number revisited. Discret. Appl. Math. 159(11): 1180-1182 (2011) - [j118]Mitre Costa Dourado, Dieter Rautenbach, Philipp Matthias Schäfer:
On finite convexity spaces induced by sets of paths in graphs. Discret. Math. 311(8-9): 616-619 (2011) - [j117]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Dominating sets, packings, and the maximum degree. Discret. Math. 311(18-19): 2031-2036 (2011) - [j116]Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer:
Finite Sholander trees, trees, and their betweenness. Discret. Math. 311(20): 2143-2147 (2011) - [j115]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. Electron. Notes Discret. Math. 38: 105-110 (2011) - [j114]Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit Interval Graphs: A Story with Open Ends. Electron. Notes Discret. Math. 38: 737-742 (2011) - [j113]Christian Löwenstein, Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen:
Independence, odd girth, and average degree. J. Graph Theory 67(2): 96-111 (2011) - [j112]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Connectivity and diameter in distance graphs. Networks 57(4): 310-315 (2011) - [j111]Dieter Rautenbach, Philipp Matthias Schäfer:
Strict Betweennesses Induced by Posets as well as by Graphs. Order 28(1): 89-97 (2011) - [j110]Carmen C. Centeno, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Irreversible conversion of graphs. Theor. Comput. Sci. 412(29): 3693-3700 (2011) - [c11]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The South Zone: Distributed Algorithms for Alliances. SSS 2011: 178-192 - [p1]Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen:
Combinatorial Optimization in VLSI Design. Combinatorial Optimization - Methods and Applications 2011: 33-96 - 2010
- [j109]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. 23(1): 79-81 (2010) - [j108]Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer:
Random Procedures for Dominating Sets in Graphs. Electron. J. Comb. 17(1) (2010) - [j107]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach, Justin Southey:
Disjoint dominating and total dominating sets in graphs. Discret. Appl. Math. 158(15): 1615-1623 (2010) - [j106]Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz:
Edge colouring by total labellings. Discret. Math. 310(2): 199-205 (2010) - [j105]Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Some remarks on the geodetic number of a graph. Discret. Math. 310(4): 832-837 (2010) - [j104]Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen:
Packing edge-disjoint cycles in graphs and the cyclomatic number. Discret. Math. 310(9): 1456-1462 (2010) - [j103]Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel:
Packing disjoint cycles over vertex cuts. Discret. Math. 310(13-14): 1974-1978 (2010) - [j102]Anett Boßecker, Dieter Rautenbach:
Interpolating between bounds on the independence number. Discret. Math. 310(17-18): 2398-2403 (2010) - [j101]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Long cycles and paths in distance graphs. Discret. Math. 310(23): 3417-3420 (2010) - [j100]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Partitioning a graph into a dominating set, a total dominating set, and something else. Discuss. Math. Graph Theory 30(4): 563-574 (2010) - [j99]Carmen C. Centeno, Simone Dantas, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Convex Partitions of Graphs induced by Paths of Order Three. Discret. Math. Theor. Comput. Sci. 12(5): 175-184 (2010) - [j98]Stephan Brandt, Janina Müttel, Dieter Rautenbach, Friedrich Regen:
Minimum degree and density of binary sequences. Eur. J. Comb. 31(7): 1936-1945 (2010) - [j97]Christian Löwenstein, Dieter Rautenbach:
Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs. Graphs Comb. 26(3): 407-424 (2010) - [j96]Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen:
The repeater tree construction problem. Inf. Process. Lett. 110(24): 1079-1083 (2010) - [j95]Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer:
Cycle length parities and the chromatic number. J. Graph Theory 64(3): 210-218 (2010) - [j94]Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Hull Number of Triangle-Free Graphs. SIAM J. Discret. Math. 23(4): 2163-2172 (2010) - [j93]Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, Friedrich Regen, Imre Z. Ruzsa:
Edge-Injective and Edge-Surjective Vertex Labellings. SIAM J. Discret. Math. 24(2): 666-683 (2010) - [j92]Andreas Brandstädt, Van Bang Le, Dieter Rautenbach:
Exact leaf powers. Theor. Comput. Sci. 411(31-33): 2968-2977 (2010) - [c10]Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach:
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. IWOCA 2010: 1-9 - [c9]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Brief Announcement: On Reversible and Irreversible Conversions. DISC 2010: 395-397
2000 – 2009
- 2009
- [j91]Jochen Harant, Dieter Rautenbach:
Domination in bipartite graphs. Discret. Math. 309(1): 113-122 (2009) - [j90]Klaus Meer, Dieter Rautenbach:
On the OBDD size for graphs of bounded tree- and clique-width. Discret. Math. 309(4): 843-851 (2009) - [j89]Dieter Rautenbach, Lutz Volkmann:
On the existence of edge cuts leaving several large components. Discret. Math. 309(6): 1703-1707 (2009) - [j88]Stephan Brandt, Jozef Miskuf, Dieter Rautenbach:
Edge irregular total labellings for graphs of linear size. Discret. Math. 309(12): 3786-3792 (2009) - [j87]Andreas Brandstädt, Van Bang Le, Dieter Rautenbach:
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discret. Math. 309(12): 3843-3852 (2009) - [j86]Christian Löwenstein, Dieter Rautenbach, Friedrich Regen:
On spanning tree congestion. Discret. Math. 309(13): 4653-4655 (2009) - [j85]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Remarks about disjoint dominating sets. Discret. Math. 309(23-24): 6451-6458 (2009) - [j84]Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer:
On F-independence in graphs. Discuss. Math. Graph Theory 29(2): 377-383 (2009) - [j83]Dieter Rautenbach, Friedrich Regen:
On packing shortest cycles in graphs. Inf. Process. Lett. 109(14): 816-821 (2009) - [j82]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. 109(16): 955-956 (2009) - [j81]Jens Maßberg, Dieter Rautenbach:
Binary trees with choosable edge lengths. Inf. Process. Lett. 109(18): 1087-1092 (2009) - [j80]Sven Peyer, Dieter Rautenbach, Jens Vygen:
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. J. Discrete Algorithms 7(4): 377-390 (2009) - [c8]Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen:
Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD 2009: 43-50 - [c7]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Cycles, Paths, Connectivity and Diameter in Distance Graphs. WG 2009: 320-328 - 2008
- [j79]Dieter Rautenbach, Christian Szegedy:
A class of problems for which cyclic relaxation converges linearly. Comput. Optim. Appl. 41(1): 53-60 (2008) - [j78]Dieter Rautenbach:
A note on domination, girth and minimum degree. Discret. Math. 308(11): 2325-2329 (2008) - [j77]F. Dahme, Dieter Rautenbach, Lutz Volkmann:
alpha-Domination perfect trees. Discret. Math. 308(15): 3187-3198 (2008) - [j76]Dieter Rautenbach, Lutz Volkmann:
Some remarks on lambdap, q-connectedness. Discret. Math. 308(23): 5562-5569 (2008) - [j75]Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer:
The independence number in graphs of maximum degree three. Discret. Math. 308(23): 5829-5833 (2008) - [j74]Dieter Rautenbach, Christian Szegedy, Jürgen Werber:
On the cost of optimal alphabetic code trees with unequal letter costs. Eur. J. Comb. 29(2): 386-394 (2008) - [j73]Christian Löwenstein, Dieter Rautenbach:
Domination in Graphs of Minimum Degree at least Two and Large Girth. Graphs Comb. 24(1): 37-46 (2008) - [j72]Stephan Brandt, Jozef Miskuf, Dieter Rautenbach:
On a conjecture about edge irregular total labelings. J. Graph Theory 57(4): 333-343 (2008) - [j71]Dieter Rautenbach:
A conjecture of Borodin and a coloring of Grünbaum. J. Graph Theory 58(2): 139-147 (2008) - [j70]Dieter Rautenbach, Lutz Volkmann:
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles. Networks 52(4): 252-255 (2008) - 2007
- [j69]Dieter Rautenbach, Lutz Volkmann:
New bounds on the k-domination number and the k-tuple domination number. Appl. Math. Lett. 20(1): 98-102 (2007) - [j68]Dieter Rautenbach:
Regular Weighted Graphs Without Positive Cuts. Ars Comb. 84 (2007) - [j67]Dieter Rautenbach, Christian Szegedy, Jürgen Werber:
The delay of circuits whose inputs have specified arrival times. Discret. Appl. Math. 155(10): 1233-1243 (2007) - [j66]Yair Caro, Dieter Rautenbach:
Reconstructing graphs from size and degree properties of their induced k-subgraphs. Discret. Math. 307(6): 694-703 (2007) - [j65]Frédéric Maffray, Dieter Rautenbach:
Small step-dominating sets in trees. Discret. Math. 307(9-10): 1212-1215 (2007) - [j64]Michael A. Henning, Dieter Rautenbach:
On the irregularity of bipartite graphs. Discret. Math. 307(11-12): 1467-1472 (2007) - [j63]Dieter Rautenbach:
Dominating and large induced trees in regular graphs. Discret. Math. 307(24): 3177-3186 (2007) - [j62]Vadim V. Lozin, Dieter Rautenbach:
The relative clique-width of a graph. J. Comb. Theory B 97(5): 846-858 (2007) - [j61]Bernhard Korte, Dieter Rautenbach, Jens Vygen:
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip. Proc. IEEE 95(3): 555-572 (2007) - [c6]Jürgen Werber, Dieter Rautenbach, Christian Szegedy:
Timing optimization by restructuring long combinatorial paths. ICCAD 2007: 536-543 - [c5]Dieter Rautenbach, Bruce A. Reed:
Domination in Cubic Graphs of Large Girth. KyotoCGGT 2007: 186-190 - 2006
- [j60]Vadim V. Lozin, Dieter Rautenbach:
The tree- and clique-width of bipartite graphs in special classes. Australas. J Comb. 34: 57-68 (2006) - [j59]Odile Favaron, Renu C. Laskar, Dieter Rautenbach:
t-partitions and s-complete t-partitions of a graph. Australas. J Comb. 36: 295-302 (2006) - [j58]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. Discret. Math. 306(7): 670-672 (2006) - [j57]Dieter Rautenbach:
Some remarks about leaf roots. Discret. Math. 306(13): 1456-1461 (2006) - [j56]Dieter Rautenbach:
A Conjecture of Borodin and a Coloring of Grünbaum. Electron. Notes Discret. Math. 24: 187-194 (2006) - [j55]Dieter Rautenbach, Andreas Brandstädt, Van Bang Le:
Distance-Hereditary 5-Leaf Powers. Electron. Notes Discret. Math. 27: 85-86 (2006) - [j54]Dieter Rautenbach, Ingo Schiermeyer:
Extremal Problems for Imbalanced Edges. Graphs Comb. 22(1): 103-111 (2006) - [j53]Dieter Rautenbach, Christian Szegedy, Jürgen Werber:
Delay optimization of linear depth boolean circuits with prescribed input arrival times. J. Discrete Algorithms 4(4): 526-537 (2006) - [c4]Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen:
Efficient generation of short and fast repeater tree topologies. ISPD 2006: 120-127 - [c3]Klaus Meer, Dieter Rautenbach:
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. IWPEC 2006: 72-83 - [c2]Dogan Kesdogan, Dakshi Agrawal, Dang Vinh Pham, Dieter Rautenbach:
Fundamental Limits on the Anonymity Provided by the MIX Technique. S&P 2006: 86-99 - 2005
- [j52]Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann:
Extremal Trees with Respect to Dominance Order. Ars Comb. 76 (2005) - [j51]Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach:
A note on the number of matchings and independent sets in trees. Discret. Appl. Math. 145(3): 483-489 (2005) - [j50]Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann:
Cuts leaving components of given minimum order. Discret. Math. 292(1-3): 55-65 (2005) - [j49]Dieter Rautenbach, Irene Stella:
On the maximum number of cycles in a Hamiltonian graph. Discret. Math. 304(1-3): 101-107 (2005) - [j48]Dieter Rautenbach:
Lower bounds on treespan. Inf. Process. Lett. 96(2): 67-70 (2005) - 2004
- [j47]Dieter Rautenbach:
Propagation of Mean Degrees. Electron. J. Comb. 11(1) (2004) - [j46]Dieter Rautenbach:
Rectilinear Spanning Trees Versus Bounding Boxes. Electron. J. Comb. 11(1) (2004) - [j45]Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach:
Competition polysemy. Discret. Math. 282(1-3): 251-255 (2004) - [j44]Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach:
The solution of two problems on bound polysemy. Discret. Math. 282(1-3): 257-261 (2004) - [j43]Vadim V. Lozin, Dieter Rautenbach:
Chordal bipartite graphs of bounded tree- and clique-width. Discret. Math. 283(1-3): 151-158 (2004) - [j42]Dieter Rautenbach:
Graphs with small additive stretch number. Discuss. Math. Graph Theory 24(2): 291-301 (2004) - [j41]F. Dahme, Dieter Rautenbach, Lutz Volkmann:
Some remarks on alpha-domination. Discuss. Math. Graph Theory 24(3): 423-430 (2004) - [j40]Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann:
Note on the connectivity of line graphs. Inf. Process. Lett. 91(1): 7-10 (2004) - [j39]Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach:
The Numbers of Shared Upper Bounds Determine a Poset. Order 21(2): 131-135 (2004) - [j38]Vadim V. Lozin, Dieter Rautenbach:
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. SIAM J. Discret. Math. 18(1): 195-206 (2004) - 2003
- [j37]Dieter Rautenbach:
Four traps are almost always enough to catch a square-celled animal. Ars Comb. 66 (2003) - [j36]Dieter Rautenbach:
Finite sets in Rn given up to translation have reconstruction number three. Ars Comb. 68 (2003) - [j35]Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann:
A Linear-programming Approach to the Generalized Randic Index. Discret. Appl. Math. 128(2-3): 375-385 (2003) - [j34]Charles Delorme, Odile Favaron, Dieter Rautenbach:
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. Discret. Appl. Math. 130(3): 503-512 (2003) - [j33]Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann:
Remarks on the bondage number of planar graphs. Discret. Math. 260(1-3): 57-67 (2003) - [j32]Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann:
Maximum graphs with a unique minimum dominating set. Discret. Math. 260(1-3): 197-203 (2003) - [j31]Dieter Rautenbach, Lutz Volkmann:
Extremal subgraphs with respect to vertex degree bounds. Discret. Math. 263(1-3): 297-303 (2003) - [j30]Dieter Rautenbach, Lutz Volkmann:
On alphargammas(k)-perfect graphs. Discret. Math. 270(1-3): 240-249 (2003) - [j29]Dieter Rautenbach:
A note on trees of maximum weight and restricted degrees. Discret. Math. 271(1-3): 335-342 (2003) - [j28]Vadim V. Lozin, Dieter Rautenbach:
Some results on graphs without long induced paths. Inf. Process. Lett. 88(4): 167-171 (2003) - 2002
- [j27]Dieter Rautenbach, Igor E. Zverovich, Inessa I. Zverovich:
Extensions of α-polynomial classes. Australas. J Comb. 26: 265-272 (2002) - [j26]Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann:
Wiener index versus maximum degree in trees. Discret. Appl. Math. 122(1-3): 127-137 (2002) - [j25]Dieter Rautenbach:
On Kelly's lemma for infinite sets of integers. Discret. Math. 245(1-3): 279-282 (2002) - [j24]Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann:
Weighted domination in triangle-free graphs. Discret. Math. 250(1-3): 233-239 (2002) - [j23]Dieter Rautenbach:
Reconstructing infinite objects. Discret. Math. 250(1-3): 273-279 (2002) - [j22]Charles Delorme, Odile Favaron, Dieter Rautenbach:
On the Randic Image index. Discret. Math. 257(1): 29-38 (2002) - [j21]Charles Delorme, Odile Favaron, Dieter Rautenbach:
On the reconstruction of the degree sequence. Discret. Math. 259(1-3): 293-300 (2002) - [j20]Dieter Rautenbach, Lutz Volkmann:
Independent domination and matchings in graphs. Discret. Math. 259(1-3): 325-330 (2002) - [j19]Dieter Rautenbach, Eberhard Triesch:
Reconstruction up to isometries. Discret. Math. 259(1-3): 331-336 (2002) - [j18]Dieter Rautenbach:
On a Reconstruction Problem of Harary and Manvel. J. Comb. Theory A 99(1): 32-39 (2002) - [j17]Dieter Rautenbach, Eberhard Triesch:
Reconstructing Infinite Sets of Integers. J. Comb. Theory A 99(2): 297-306 (2002) - [j16]Dieter Rautenbach, Lutz Volkmann:
How local irregularity gets global in a graph. J. Graph Theory 41(1): 18-23 (2002) - 2001
- [j15]Dieter Rautenbach, Bruce A. Reed:
The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. Comb. 21(2): 267-278 (2001) - [j14]Dieter Rautenbach, Vadim E. Zverovich:
Perfect graphs of strong domination and independent strong domination. Discret. Math. 226(1-3): 297-311 (2001) - [j13]Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach:
On domination and annihilation in graphs with claw-free blocks. Discret. Math. 231(1-3): 143-151 (2001) - [j12]Dieter Rautenbach:
On vertex orderings and the stability number in triangle-free graphs. Discret. Math. 231(1-3): 411-420 (2001) - [j11]Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann:
i gamma(1)-perfect graphs. Discret. Math. 234(1-3): 133-138 (2001) - [j10]Dieter Rautenbach:
Reconstructing Finite Sets of Points in Rnup to Groups of Isometries. Eur. J. Comb. 22(8): 1139-1147 (2001) - [c1]Dieter Rautenbach, Bruce A. Reed:
Approximately covering by cycles in planar graphs. SODA 2001: 402-406 - 2000
- [j9]Dieter Rautenbach:
Bounds on the strong domination number. Discret. Math. 215: 201-212 (2000) - [j8]Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann:
A characterization of rho alpha(k)-perfect graphs. Discret. Math. 224(1-3): 265-271 (2000) - [j7]Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann:
Some results on graph parameters in weighted graphs. Electron. Notes Discret. Math. 5: 85-88 (2000)
1990 – 1999
- 1999
- [j6]Dieter Rautenbach:
The influence of special vertices on strong domination. Discret. Math. 197-198: 683-690 (1999) - [j5]Dieter Rautenbach:
On the differences between the upper irredundance, upper domination and independence numbers of a graph. Discret. Math. 203(1-3): 239-252 (1999) - [j4]Dieter Rautenbach:
A linear vizing-like relation between the size and the domination number of a graph. J. Graph Theory 31(4): 297-302 (1999) - 1998
- [j3]Dieter Rautenbach, Lutz Volkmann:
Some structural results on linear arboricity. Australas. J Comb. 17: 267-274 (1998) - [j2]Dieter Rautenbach:
Bounds on the weak domination number. Australas. J Comb. 18: 245-252 (1998) - [j1]Dieter Rautenbach, Lutz Volkmann:
The domatic number of block-cactus graphs. Discret. Math. 187(1-3): 185-193 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
