Matthias Hamann

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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


Research outcomes over time


This page was built for person: Matthias Hamann