In this work I present recent scientific papers related to the concept of tree-depth: different characterizations, a game theoretic approach to it and recently discovered applications. The focus in this work is presenting all the ideas in a self-contained way, such that they can be easily understood with little previous knowledge. Apart from that all the ideas are presented in a homogeneous way with clear examples and all the lemmas, some of which didn’t have proofs in the papers, are presented with rigorous proofs
AbstractWe introduce two new notions for hypergraphs, hypertree-depth and minors in hypergraphs. We ...
AbstractA depth first search algorithm is used to establish the connection between labeled connected...
Shrub-depth is a graph invariant often considered as an extension of tree-depth to dense graphs. We ...
© 2020 The Author(s). We present a concept called the branch-depth of a connectivity function, that ...
This report is an introduction to the concept of treewidth, a property of graphs that has important ...
The recent increase of interest in the graph invariant called tree-depth andin its applications in a...
Shrub-depth is a width measure of graphs which, roughly speaking, corresponds to the smallest depth ...
We discuss some results on the complexity of games and puzzles. In particular, we focus on the relat...
The tree-width and branch-width of a graph are two well-studied examples of parameters that measure ...
Information visualization produces (interactive) visual representations of abstract data to reinforc...
English: This project proposes a system to relate the objects in an image using occlusion cues and a...
Context-free tree languages play an important role in algebraic semantics and are applied in mathema...
AbstractThe performance of several tree traversal algorithms may be described in terms of various no...
Graph decompositions are a powerful tool aimed to divide a graph into several parts, called bags, co...
Abstract. A connected graph has tree-depth at most k if it is a sub-graph of the closure of a rooted...
AbstractWe introduce two new notions for hypergraphs, hypertree-depth and minors in hypergraphs. We ...
AbstractA depth first search algorithm is used to establish the connection between labeled connected...
Shrub-depth is a graph invariant often considered as an extension of tree-depth to dense graphs. We ...
© 2020 The Author(s). We present a concept called the branch-depth of a connectivity function, that ...
This report is an introduction to the concept of treewidth, a property of graphs that has important ...
The recent increase of interest in the graph invariant called tree-depth andin its applications in a...
Shrub-depth is a width measure of graphs which, roughly speaking, corresponds to the smallest depth ...
We discuss some results on the complexity of games and puzzles. In particular, we focus on the relat...
The tree-width and branch-width of a graph are two well-studied examples of parameters that measure ...
Information visualization produces (interactive) visual representations of abstract data to reinforc...
English: This project proposes a system to relate the objects in an image using occlusion cues and a...
Context-free tree languages play an important role in algebraic semantics and are applied in mathema...
AbstractThe performance of several tree traversal algorithms may be described in terms of various no...
Graph decompositions are a powerful tool aimed to divide a graph into several parts, called bags, co...
Abstract. A connected graph has tree-depth at most k if it is a sub-graph of the closure of a rooted...
AbstractWe introduce two new notions for hypergraphs, hypertree-depth and minors in hypergraphs. We ...
AbstractA depth first search algorithm is used to establish the connection between labeled connected...
Shrub-depth is a graph invariant often considered as an extension of tree-depth to dense graphs. We ...