| Publication | Date of Publication | Type |
|---|
Quasi-transitive \(K_{\infty}\)-minor free graphs
European Journal of Combinatorics | 2024-12-27 | Paper |
Minor exclusion in quasi-transitive graphs
Discrete Mathematics | 2023-10-30 | Paper |
The planar Cayley graphs are effectively enumerable. II
European Journal of Combinatorics | 2023-04-27 | Paper |
A Stallings type theorem for quasi-transitive graphs
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
Canonical trees of tree-decompositions
Journal of Combinatorial Theory. Series B | 2021-11-17 | Paper |
Tight security bounds for generic stream cipher constructions
| 2020-07-21 | Paper |
Presentations for Vertex Transitive Graphs
| 2020-07-13 | Paper |
Two characterisations of accessible quasi-transitive graphs
| 2020-03-31 | Paper |
The planar Cayley graphs are effectively enumerable. I: Consistently planar graphs
Combinatorica | 2020-01-17 | Paper |
Asymptotic dimension of multi-ended quasi-transitive graphs
| 2019-12-05 | Paper |
Self-embeddings of trees
Discrete Mathematics | 2019-10-17 | Paper |
Tree amalgamations and hyperbolic boundaries
| 2019-09-30 | Paper |
The planar Cayley graphs are effectively enumerable II
| 2019-01-02 | Paper |
Tree amalgamations and quasi-isometries
| 2018-12-12 | Paper |
Planar transitive graphs
The Electronic Journal of Combinatorics | 2018-10-30 | Paper |
Accessibility in transitive graphs
Combinatorica | 2018-09-24 | Paper |
On the tree-likeness of hyperbolic spaces
Mathematical Proceedings of the Cambridge Philosophical Society | 2018-07-13 | Paper |
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks
Cryptography and Communications | 2018-05-28 | Paper |
Design and analysis of small-state grain-like stream ciphers
Cryptography and Communications | 2018-05-28 | Paper |
The classification of finite and locally finite connected-homogeneous digraphs
Combinatorica | 2018-03-16 | Paper |
Spanning trees in hyperbolic graphs
Combinatorica | 2018-02-22 | Paper |
Group actions on metric spaces: fixed points and free subgroups
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 2018-01-05 | Paper |
Bounding connected tree-width
SIAM Journal on Discrete Mathematics | 2016-07-22 | Paper |
Extending cycles locally to Hamilton cycles
The Electronic Journal of Combinatorics | 2016-05-03 | Paper |
Canonical tree-decompositions of finite graphs. II. Essential parts
Journal of Combinatorial Theory. Series B | 2016-03-14 | Paper |
Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Generating the cycle space of planar graphs
The Electronic Journal of Combinatorics | 2015-06-02 | Paper |
\(k\)-blocks: a connectivity invariant for graphs
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Transitivity conditions in infinite graphs
Combinatorica | 2014-07-21 | Paper |
Homogeneous 2-partite digraphs
Discrete Mathematics | 2014-05-06 | Paper |
Countable connected-homogeneous digraphs
| 2013-11-23 | Paper |
The classification of connected-homogeneous digraphs with more than one end
Transactions of the American Mathematical Society | 2013-04-10 | Paper |
End-transitive graphs
Israel Journal of Mathematics | 2012-11-13 | Paper |
On fixing boundary points of transitive hyperbolic graphs
Archiv der Mathematik | 2012-08-13 | Paper |
The cryptographic power of random selection
Selected Areas in Cryptography | 2012-06-08 | Paper |
Quasi-isometry invariance of hyperbolicity in semimetric spaces, digraphs and semigroups
| N/A | Paper |
A full Halin grid theorem
| N/A | Paper |
A boundary for hyperbolic digraphs and semigroups
| N/A | Paper |
Free submonoids of hyperbolic monoids
| N/A | Paper |
