E-LIB Suche - Ergebnisse für: Rautenbach, Dieter

1

On conflict-free cuts: Algorithms and complexity:

Rauch, Johannes ; Rautenbach, Dieter ; Souza, Uéverton S.
Information Processing Letters. 187 (2025) - p. 106503 , 2025

Link: https://doi.org/10.1016/..

2

FPT algorithms for packing k-safe spanning rooted sub(di)gr..:

Bessy, Stéphane ; Hörsch, Florian ; Maia, Ana Karolinna..
Discrete Applied Mathematics. 346 (2024) - p. 80-94 , 2024

Link: https://doi.org/10.1016/..

3

Bounding the Mostar index:

Miklavič, Štefko ; Pardey, Johannes ; Rautenbach, Dieter.
Discrete Mathematics. 347 (2024) 1 - p. 113704 , 2024

Link: https://doi.org/10.1016/..

4

A bound on the dissociation number:

Bock, Felix ; Pardey, Johannes ; Penso, Lucia D..
Journal of Graph Theory. 103 (2023) 4 - p. 661-673 , 2023

Link: https://doi.org/10.1002/..

5

Exact and Parameterized Algorithms for the Independent Cuts..:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,

Rauch, Johannes ; Rautenbach, Dieter ; Souza, Uéverton S. - p. 378-391 , 2023

Link: https://doi.org/10.1007/..

6

Diameter, edge-connectivity, and C4-freeness:

Hiebeler, Vanessa ; Pardey, Johannes ; Rautenbach, Dieter
Discrete Mathematics. 346 (2023) 5 - p. 113318 , 2023

Link: https://doi.org/10.1016/..

7

Maximizing the Mostar index for bipartite graphs and split ..:

Miklavič, Štefko ; Pardey, Johannes ; Rautenbach, Dieter.
Discrete Optimization. 48 (2023) - p. 100768 , 2023

Link: https://doi.org/10.1016/..

8

Vertex degrees close to the average degree:

Pardey, Johannes ; Rautenbach, Dieter
Discrete Mathematics. 346 (2023) 12 - p. 113599 , 2023

Link: https://doi.org/10.1016/..

9

Efficiently finding low-sum copies of spanning forests in z..:

Pardey, Johannes ; Rautenbach, Dieter
Discrete Applied Mathematics. 328 (2023) - p. 108-116 , 2023

Link: https://doi.org/10.1016/..

10

Relating the independence number and the dissociation numbe:

Bock, Felix ; Pardey, Johannes ; Penso, Lucia D..
Journal of Graph Theory. 104 (2023) 2 - p. 320-340 , 2023

Link: https://doi.org/10.1002/..

11

Efficiently recognizing graphs with equal independence and ..:

Rauch, Johannes ; Rautenbach, Dieter
Information Processing Letters. 182 (2023) - p. 106387 , 2023

Link: https://doi.org/10.1016/..

12

Relating dissociation, independence, and matchings:

Bock, Felix ; Pardey, Johannes ; Penso, Lucia D..
Discrete Applied Mathematics. 322 (2022) - p. 160-165 , 2022

Link: https://doi.org/10.1016/..

13

Almost color-balanced perfect matchings in color-balanced c..:

Pardey, Johannes ; Rautenbach, Dieter
Discrete Mathematics. 345 (2022) 2 - p. 112701 , 2022

Link: https://doi.org/10.1016/..

14

Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Gr..:

Mohr, Elena ; Pardey, Johannes ; Rautenbach, Dieter
Graphs and Combinatorics. 38 (2022) 5 - p. , 2022

Link: https://doi.org/10.1007/..

15

Additive tree O(ρlog⁡n)-spanners from tree breadth ρ:

Bendele, Oliver ; Rautenbach, Dieter
Theoretical Computer Science. 914 (2022) - p. 39-46 , 2022

Link: https://doi.org/10.1016/..