Jonathan Rollin
Karlsruhe Institute of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Jonathan Rollin.
European Journal of Combinatorics | 2018
Maria Axenovich; Daniel Gonçalves; Jonathan Rollin; Torsten Ueckerdt
The induced arboricity of a graph
international symposium on algorithms and computation | 2012
Tanja Hartmann; Jonathan Rollin; Ignaz Rutter
G
Discussiones Mathematicae Graph Theory | 2018
Anton Bernshteyn; Omid Khormali; Ryan R. Martin; Jonathan Rollin; Danny Rorabaugh; Songlin Shan; Andrew J. Uzzell
is the smallest number of induced forests covering the edges of
Combinatorica | 2017
Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt
G
Discrete Mathematics | 2015
Daniel Hoske; Jonathan Rollin; Torsten Ueckerdt; Stefan Walzer
. This is a well-defined parameter bounded from above by the number of edges of
Journal of Graph Theory | 2017
Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt
G
Archive | 2017
Jonathan Rollin
when each forest in a cover consists of exactly one edge. Not all edges of a graph necessarily belong to induced forests with larger components. For
Discrete Mathematics | 2015
Maria Axenovich; Jonathan Rollin
k\geq 1
Algorithmica | 2015
Tanja Hartmann; Jonathan Rollin; Ignaz Rutter
, we call an edge
arXiv: Combinatorics | 2018
Maria Axenovich; Philip Dörr; Jonathan Rollin; Torsten Ueckerdt
k
Collaboration
Dive into the Jonathan Rollin's collaboration.
