Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| Finding a subdivision of a digraph. | 4 | 0.52 | 2015 |
| DAG-width and circumference of digraphs. | 0 | 0.34 | 2015 |
| Sufficient Conditions for a Digraph to be Supereulerian | 1 | 0.37 | 2015 |
| Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs | 1 | 0.37 | 2014 |
| Arc-Disjoint Paths in Decomposable Digraphs | 3 | 0.41 | 2014 |