Matthias Hamann

From MaRDI portal
Revision as of 22:39, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Matthias Hamann to Matthias Hamann: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:444119

Available identifiers

zbMath Open hamann.matthiasMaRDI QIDQ444119

List of research outcomes

PublicationDate of PublicationType
Minor exclusion in quasi-transitive graphs2023-10-30Paper
The planar Cayley graphs are effectively enumerable. II2023-04-27Paper
A Stallings type theorem for quasi-transitive graphs2022-09-23Paper
Canonical trees of tree-decompositions2021-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 graphs2020-01-17Paper
Asymptotic dimension of multi-ended quasi-transitive graphs2019-12-05Paper
Self-embeddings of trees2019-10-17Paper
Tree amalgamations and hyperbolic boundaries2019-09-30Paper
The planar Cayley graphs are effectively enumerable II2019-01-02Paper
Tree amalgamations and quasi-isometries2018-12-12Paper
Planar transitive graphs2018-10-30Paper
Accessibility in transitive graphs2018-09-24Paper
On the tree-likeness of hyperbolic spaces2018-07-13Paper
Design and analysis of small-state grain-like stream ciphers2018-05-28Paper
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks2018-05-28Paper
The classification of finite and locally finite connected-homogeneous digraphs2018-03-16Paper
Spanning trees in hyperbolic graphs2018-02-22Paper
Group actions on metric spaces: fixed points and free subgroups2018-01-05Paper
Bounding Connected Tree-Width2016-07-22Paper
Extending cycles locally to Hamilton cycles2016-05-03Paper
Canonical tree-decompositions of finite graphs. II. Essential parts2016-03-14Paper
Canonical tree-decompositions of finite graphs. I: Existence and algorithms.2015-12-11Paper
Generating the cycle space of planar graphs2015-06-02Paper
$k$-Blocks: A Connectivity Invariant for Graphs2015-04-17Paper
Transitivity conditions in infinite graphs2014-07-21Paper
Homogeneous 2-partite digraphs2014-05-06Paper
Countable connected-homogeneous digraphs2013-11-23Paper
The classification of connected-homogeneous digraphs with more than one end2013-04-10Paper
End-transitive graphs2012-11-13Paper
On fixing boundary points of transitive hyperbolic graphs2012-08-13Paper
The Cryptographic Power of Random Selection2012-06-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Matthias Hamann