LIZARD – A Lightweight Stream Cipher for Power-constrained Devices von Matthias Hamann, Matthias Krause, Willi Meier

Volltext

Minor exclusion in quasi-transitive graphs von Hamann, Matthias

Volltext

Quasi-transitive K∞-minor free graphs von Hamann, Matthias

Volltext

Self-embeddings of trees von Hamann, Matthias

Volltext

On the tree-likeness of hyperbolic spaces von HAMANN, MATTHIAS

Volltext

A Full Halin Grid Theorem von Georgakopoulos, Agelos, Hamann, Matthias

Volltext

The classification of connected-homogeneous digraphs with more than one end von HAMANN, MATTHIAS, HUNDERTMARK, FABIAN

Volltext

Accessibility in Transitive Graphs von Hamann, Matthias

Volltext

Planar Transitive Graphs von Hamann, Matthias

Volltext

The planar Cayley graphs are effectively enumerable II von Georgakopoulos, Agelos, Hamann, Matthias

Volltext

Group actions on metric spaces: fixed points and free subgroups von Hamann, Matthias

Volltext

LIZARD – A Lightweight Stream Cipher for Power-constrained Devices von Hamann, Matthias, Krause, Matthias, Meier, Willi

Volltext

The classification of finite and locally finite connected-homogeneous digraphs von Hamann, Matthias

Volltext

On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks von Hamann, Matthias, Krause, Matthias

Volltext

The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs von Georgakopoulos, Agelos, Hamann, Matthias

Volltext

Canonical trees of tree-decompositions von Carmesin, Johannes, Hamann, Matthias, Miraftab, Babak

Volltext

Spanning trees in hyperbolic graphs von Hamann, Matthias

Volltext

Generating the Cycle Space of Planar Graphs von Hamann, Matthias

Volltext

Homogeneous 2-partite digraphs von Hamann, Matthias

Volltext

A Stallings type theorem for quasi-transitive graphs von Hamann, Matthias, Lehner, Florian, Miraftab, Babak, Rühmann, Tim

Volltext