Search

Your search keyword '"Rautenbach, Dieter"' showing total 695 results

Search Constraints

Start Over You searched for: Author "Rautenbach, Dieter" Remove constraint Author: "Rautenbach, Dieter" Search Limiters Available in Library Collection Remove constraint Search Limiters: Available in Library Collection
695 results on '"Rautenbach, Dieter"'

Search Results

1. Cutwidth and Crossings

2. An Optimization Approach to Degree Deviation and Spectral Radius

Catalog

Books, media, physical & digital resources

3. Revisiting Extremal Graphs Having No Stable Cutsets

4. Forest Cuts in Sparse Graphs

5. Degree Deviation and Spectral Radius

6. Complexity of Deciding the Equality of Matching Numbers

7. Induced Subforests and Superforests

8. Largest common subgraph of two forests

9. On Conflict-Free Cuts: Algorithms and Complexity

10. Exact and Parameterized Algorithms for the Independent Cutset Problem

11. Mostar index and bounded maximum degree

12. Sparse vertex cutsets and the maximum degree

13. Irregularity of Graphs respecting Degree Bounds

14. Vertex degrees close to the average degree

15. Bounding the Mostar index

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

18. Majority Edge-Colorings of Graphs

19. Relating the independence number and the dissociation number

20. Efficiently recognizing graphs with equal independence and annihilation numbers

21. A bound on the dissociation number

22. Relating dissociation, independence, and matchings

23. Diameter, edge-connectivity, and $C_4$-freeness

25. Factorially many maximum matchings close to the Erd\H{o}s-Gallai bound

26. Unbalanced spanning subgraphs in edge labeled complete graphs

27. Almost color-balanced perfect matchings in color-balanced complete graphs

28. FPT algorithms for packing $k$-safe spanning rooted sub(di)graphs

29. Maximally distance-unbalanced trees

30. Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation

31. Zero-sum copies of spanning forests in zero-sum complete graphs

32. Minimum distance-unbalancedness of trees

33. Low Weight Perfect Matchings

34. Exponential Independence in Subcubic Graphs

35. Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree

36. Reconfiguring dominating sets in minor-closed graph classes

37. Biholes in balanced bipartite graphs

38. Additive Tree $O(\rho\log n)$-Spanners from Tree Breadth $\rho$

39. Acyclic matchings in graphs of bounded maximum degree

40. Cubic graphs with equal independence number and matching number

41. Domination versus edge domination

42. Bounding and approximating minimum maximal matchings in regular graphs

45. Linear programming based approximation for unweighted induced matchings --- breaking the $\Delta$ barrier

46. Uniquely restricted matchings in subcubic graphs without short cycles

47. Girth, minimum degree, independence, and broadcast independence

48. Relating broadcast independence and independence

49. Algorithmic aspects of broadcast independence

50. On some tractable and hard instances for partial incentives and target set selection