Dieter Rautenbach

Universität Ulm — Germany

Computer Science · Physical Sciences

29h-index3.6kcitations470works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(361), Limits and Structures in Graph Theory(172), Complexity and Algorithms in Graphs(135), Graph Labeling and Dimension Problems(132), Graph theory and applications(116)

Publications470 total

An optimization approach to degree deviation and spectral radius
Discrete Optimization·2026Open Access
Complexity of deciding the equality of matching numbers
Journal of Computer and System Sciences·2026Open Access
Degenerate Vertex Cuts in Sparse Graphs
ArXiv.org·2025Open Access
Degenerate Vertex Cuts in Sparse Graphs
arXiv (Cornell University)·2025Open Access
On the number of maximal independent sets and maximal induced bipartite subgraphs in $K_4$-free graphs
arXiv (Cornell University)·2025Open Access
On the number of maximal independent sets and maximal induced bipartite subgraphs in $K_4$-free graphs
ArXiv.org·2025Open Access
Maximum common induced subforests and minimum common induced superforests of a set of forests
Discussiones Mathematicae Graph Theory·2025Open Access
Revisiting Extremal Graphs Having No Stable Cutsets
The Electronic Journal of Combinatorics·2025Open Access
A faster algorithm for independent cut
Theoretical Computer Science·2025Open Access
Degree Deviation and Spectral Radius
The Electronic Journal of Combinatorics·2025Open Access
Forest cuts in sparse graphs
Discrete Mathematics·2025· 2 citedOpen Access
Sparse Vertex Cutsets and the Maximum Degree
The Electronic Journal of Combinatorics·2025Open Access
A Faster Algorithm for Independent Cut
arXiv (Cornell University)·2025Open Access
Coloring by Pushing Vertices
arXiv (Cornell University)·2025Open Access
Cutwidth and Crossings
arXiv (Cornell University)·2025Open Access
An Optimization Approach to Degree Deviation and Spectral Radius
arXiv (Cornell University)·2024Open Access
Revisiting Extremal Graphs Having No Stable Cutsets
arXiv (Cornell University)·2024· 1 citedOpen Access
Exact and parameterized algorithms for the independent cutset problem
Journal of Computer and System Sciences·2024· 3 citedOpen Access
Exact and parameterized algorithms for the independent cutset problem
Universität Ulm, Kommunikations- und Informationszentrum (kiz)·2024Open Access
Forest Cuts in Sparse Graphs
arXiv (Cornell University)·2024Open Access
page 1 of 24Next →

Frequent Co-authors

Mitre C. Dourado(9), Jayme L. Szwarcfiter(8), Lutz Volkmann(6), Lúcia Draque Penso(6), Vadim Lozin(6), Miranca Fischermann(5), Michael A. Henning(5), Christian Löwenstein(5), Arne Hoffmann(4), Carmen C. Centeno(3), Jens Vygen(3), Fábio Protti(3), Simone Dantas(3), Uéverton S. Souza(2), İvan Gutman(2), Jean‐Sébastien Sereni(2), Jochen Harant(2), Łászló A. Székely(1), Sven Peyer(1), Charles Delorme(1)