Matthias Hamann

42 papers A 1B 1C 1Misc 1Journal 34Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Asymptotic half-grid and full-grid minors.
J. Comb. Theory B
Sandra Albrechtsen, Matthias Hamann
2026 J jnl
Infinite grids in digraphs.
Eur. J. Comb.
Matthias Hamann, Karl Heuer
2026 J jnl
Periodic colorings and orientations in infinite graphs.
Comb. Theory
Tara Abrishami, Louis Esperet, Ugo Giocanti, Matthias Hamann, Paul Knappe, Rögnvaldur G. Möller
2025 J jnl
Quasi-transitive K∞-minor free graphs.
Eur. J. Comb.
Matthias Hamann
2025 J jnl
Tree amalgamations and quasi-isometries.
J. Comb. Theory B
Matthias Hamann
2024 J jnl
Minor exclusion in quasi-transitive graphs.
Discret. Math.
Matthias Hamann
2024 A conf
UNCOVER: Data-Driven Design Support through Continuous Monitoring of Security Incidents.
DATE
Matthias Stammler, Julian Lorenz, Eric Sax, Jürgen Becker, Matthias Hamann, Patrick Bidinger, Andreas Dewald, Paraskevi Georgouti, Alexios Camarinopoulos, Günter Becker, Klaus Finsterbusch, Maximilian Kirschner, Laurenz Adolph, Carl Philipp Hohl, Maria Rill, Daniel Vonderau, Victor Pazmino Betancourt
2023 C conf
Mitigating Masking in Automotive Communication Systems: Modeling and Hardware Generation.
DSD
Matthias Stammler, Matthias Hamann, Tanja Harbaum, Jürgen Becker
2023 — conf
Multilevel Security Model for Secure Information Flow Inside Software Components Employing Automated Code Generation.
MECO
Matthias Stammler, Matthias Hamann, Jürgen Becker
2023 J jnl
The planar Cayley graphs are effectively enumerable II.
Eur. J. Comb.
Agelos Georgakopoulos, Matthias Hamann
2022 J jnl
A Stallings type theorem for quasi-transitive graphs.
J. Comb. Theory B
Matthias Hamann, Florian Lehner, Babak Miraftab, Tim Rühmann
2022 J jnl
Canonical trees of tree-decompositions.
J. Comb. Theory B
Johannes Carmesin, Matthias Hamann, Babak Miraftab
2022 J jnl
The DRACO Stream Cipher A Power-efficient Small-state Stream Cipher with Full Provable Security against TMDTO Attacks.
IACR Trans. Symmetric Cryptol.
Matthias Hamann, Alexander Moch, Matthias Krause, Vasily Mikhalev
2019 J jnl
Self-embeddings of trees.
Discret. Math.
Matthias Hamann
2019 J jnl
The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs.
Comb.
Agelos Georgakopoulos, Matthias Hamann
2019 Misc conf
Tight Security Bounds for Generic Stream Cipher Constructions.
SAC
Matthias Hamann, Matthias Krause, Alexander Moch
2019 J jnl
Tight Security Bounds for Generic Stream Cipher Constructions.
IACR Cryptol. ePrint Arch.
Matthias Hamann, Matthias Krause
2018 J jnl
Accessibility in Transitive Graphs.
Comb.
Matthias Hamann
2018 J jnl
Design and analysis of small-state grain-like stream ciphers.
Cryptogr. Commun.
Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang
2018 — —
Lightweight Cryptography on Ultra-Constrained RFID Devices.
Matthias Hamann
2018 J jnl
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks.
Cryptogr. Commun.
Matthias Hamann, Matthias Krause
2018 J jnl
Planar Transitive Graphs.
Electron. J. Comb.
Matthias Hamann
2017 J jnl
A Note on Stream Ciphers that Continuously Use the IV.
IACR Cryptol. ePrint Arch.
Matthias Hamann, Matthias Krause, Willi Meier
2017 J jnl
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices.
IACR Trans. Symmetric Cryptol.
Matthias Hamann, Matthias Krause, Willi Meier
2017 J jnl
The classification of finite and locally finite connected-homogeneous digraphs.
Comb.
Matthias Hamann
2017 J jnl
Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers.
IACR Cryptol. ePrint Arch.
Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang
2016 J jnl
Bounding Connected Tree-Width.
SIAM J. Discret. Math.
Matthias Hamann, Daniel Weißauer
2016 J jnl
Canonical tree-decompositions of finite graphs I. Existence and algorithms.
J. Comb. Theory B
Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark
2016 J jnl
Canonical tree-decompositions of finite graphs II. Essential parts.
J. Comb. Theory B
Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark
2016 J jnl
Extending Cycles Locally to Hamilton Cycles.
Electron. J. Comb.
Matthias Hamann, Florian Lehner, Julian Pott
2016 J jnl
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices.
IACR Cryptol. ePrint Arch.
Matthias Hamann, Matthias Krause, Willi Meier
2016 J jnl
Spanning trees in hyperbolic graphs.
Comb.
Matthias Hamann
2015 J jnl
Bounding connected tree-width.
CoRR
Matthias Hamann, Daniel Weißauer
2015 J jnl
Generating the Cycle Space of Planar Graphs.
Electron. J. Comb.
Matthias Hamann
2015 J jnl
Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks.
IACR Cryptol. ePrint Arch.
Matthias Hamann, Matthias Krause
2014 — conf
Hardware Efficient Authentication based on Random Selection.
Sicherheit
Frederik Armknecht, Matthias Hamann, Matthias Krause
2014 J jnl
Homogeneous 2-partite digraphs.
Discret. Math.
Matthias Hamann
2014 — conf
Lightweight Authentication Protocols on Ultra-Constrained RFIDs - Myths and Facts.
RFIDSec
Frederik Armknecht, Matthias Hamann, Vasily Mikhalev
2014 J jnl
k-Blocks: A Connectivity Invariant for Graphs.
SIAM J. Discret. Math.
Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark
2012 J jnl
Transitivity conditions in infinite graphs.
Comb.
Matthias Hamann, Julian Pott
2011 B conf
The Cryptographic Power of Random Selection.
Selected Areas in Cryptography
Matthias Krause, Matthias Hamann
2011 J jnl
The Cryptographic Power of Random Selection.
IACR Cryptol. ePrint Arch.
Matthias Krause, Matthias Hamann