default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Hamann
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j23]Matthias Hamann:
Quasi-transitive K∞-minor free graphs. Eur. J. Comb. 124: 104056 (2025)- 2024
- [j22]Matthias Hamann
:
Minor exclusion in quasi-transitive graphs. Discret. Math. 347(1): 113738 (2024) - [c7]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:
UNCOVER: Data-Driven Design Support through Continuous Monitoring of Security Incidents. DATE 2024: 1-6 - 2023
- [j21]Agelos Georgakopoulos, Matthias Hamann:
The planar Cayley graphs are effectively enumerable II. Eur. J. Comb. 110: 103668 (2023) - [c6]Matthias Stammler, Matthias Hamann, Tanja Harbaum, Jürgen Becker:
Mitigating Masking in Automotive Communication Systems: Modeling and Hardware Generation. DSD 2023: 561-568 - [c5]Matthias Stammler, Matthias Hamann, Jürgen Becker:
Multilevel Security Model for Secure Information Flow Inside Software Components Employing Automated Code Generation. MECO 2023: 1-6 - 2022
- [j20]Johannes Carmesin, Matthias Hamann, Babak Miraftab:
Canonical trees of tree-decompositions. J. Comb. Theory B 152: 1-26 (2022) - [j19]Matthias Hamann, Florian Lehner, Babak Miraftab, Tim Rühmann:
A Stallings type theorem for quasi-transitive graphs. J. Comb. Theory B 157: 40-69 (2022) - [j18]Matthias Hamann, Alexander Moch, Matthias Krause, Vasily Mikhalev:
The DRACO Stream Cipher A Power-efficient Small-state Stream Cipher with Full Provable Security against TMDTO Attacks. IACR Trans. Symmetric Cryptol. 2022(2): 1-42 (2022)
2010 – 2019
- 2019
- [j17]Agelos Georgakopoulos, Matthias Hamann:
The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs. Comb. 39(5): 993-1019 (2019) - [j16]Matthias Hamann:
Self-embeddings of trees. Discret. Math. 342(12) (2019) - [c4]Matthias Hamann, Matthias Krause, Alexander Moch:
Tight Security Bounds for Generic Stream Cipher Constructions. SAC 2019: 335-364 - [i7]Matthias Hamann, Matthias Krause:
Tight Security Bounds for Generic Stream Cipher Constructions. IACR Cryptol. ePrint Arch. 2019: 7 (2019) - 2018
- [b1]Matthias Hamann:
Lightweight Cryptography on Ultra-Constrained RFID Devices. University of Mannheim, Germany, 2018 - [j15]Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang:
Design and analysis of small-state grain-like stream ciphers. Cryptogr. Commun. 10(5): 803-834 (2018) - [j14]Matthias Hamann, Matthias Krause:
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Cryptogr. Commun. 10(5): 959-1012 (2018) - [j13]Matthias Hamann:
Accessibility in Transitive Graphs. Comb. 38(4): 847-859 (2018) - [j12]Matthias Hamann:
Planar Transitive Graphs. Electron. J. Comb. 25(4): 4 (2018) - 2017
- [j11]Matthias Hamann:
The classification of finite and locally finite connected-homogeneous digraphs. Comb. 37(2): 183-222 (2017) - [j10]Matthias Hamann, Matthias Krause, Willi Meier:
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. IACR Trans. Symmetric Cryptol. 2017(1): 45-79 (2017) - [i6]Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang:
Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers. IACR Cryptol. ePrint Arch. 2017: 384 (2017) - [i5]Matthias Hamann, Matthias Krause, Willi Meier:
A Note on Stream Ciphers that Continuously Use the IV. IACR Cryptol. ePrint Arch. 2017: 1172 (2017) - 2016
- [j9]Matthias Hamann:
Spanning trees in hyperbolic graphs. Comb. 36(3): 313-332 (2016) - [j8]Matthias Hamann, Florian Lehner, Julian Pott:
Extending Cycles Locally to Hamilton Cycles. Electron. J. Comb. 23(1): 1 (2016) - [j7]Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark:
Canonical tree-decompositions of finite graphs I. Existence and algorithms. J. Comb. Theory B 116: 1-24 (2016) - [j6]Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark:
Canonical tree-decompositions of finite graphs II. Essential parts. J. Comb. Theory B 118: 268-283 (2016) - [j5]Matthias Hamann, Daniel Weißauer:
Bounding Connected Tree-Width. SIAM J. Discret. Math. 30(3): 1391-1400 (2016) - [i4]Matthias Hamann, Matthias Krause, Willi Meier:
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. IACR Cryptol. ePrint Arch. 2016: 926 (2016) - 2015
- [j4]Matthias Hamann:
Generating the Cycle Space of Planar Graphs. Electron. J. Comb. 22(2): 2 (2015) - [i3]Matthias Hamann, Daniel Weißauer:
Bounding connected tree-width. CoRR abs/1503.01592 (2015) - [i2]Matthias Hamann, Matthias Krause:
Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks. IACR Cryptol. ePrint Arch. 2015: 757 (2015) - 2014
- [j3]Matthias Hamann:
Homogeneous 2-partite digraphs. Discret. Math. 327: 36-39 (2014) - [j2]Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark:
k-Blocks: A Connectivity Invariant for Graphs. SIAM J. Discret. Math. 28(4): 1876-1891 (2014) - [c3]Frederik Armknecht, Matthias Hamann, Vasily Mikhalev:
Lightweight Authentication Protocols on Ultra-Constrained RFIDs - Myths and Facts. RFIDSec 2014: 1-18 - [c2]Frederik Armknecht, Matthias Hamann, Matthias Krause:
Hardware Efficient Authentication based on Random Selection. Sicherheit 2014: 169-185 - 2012
- [j1]Matthias Hamann, Julian Pott:
Transitivity conditions in infinite graphs. Comb. 32(6): 649-688 (2012) - 2011
- [c1]Matthias Krause, Matthias Hamann:
The Cryptographic Power of Random Selection. Selected Areas in Cryptography 2011: 134-150 - [i1]Matthias Krause, Matthias Hamann:
The Cryptographic Power of Random Selection. IACR Cryptol. ePrint Arch. 2011: 511 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
