#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2003

2018

- This year (1)
- Last 5 years (6)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark
- J. Comb. Theory, Ser. B
- 2016

In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish lowerâ€¦ (More)

- J. P. Kuhtz-Buschbeck, R. Gilster, C. van der Horst, M. Hamann, Stephan Wolff, Olav Jansen
- NeuroImage
- 2009

When the bladder is fairly full, the desire to void can be suppressed, but it can also be called forth deliberately. We studied brain activity during such intentional modulations of bladder sensationâ€¦ (More)

- Ralf Hund, M. Hamann, Thorsten Holz
- 2008 European Conference on Computer Networkâ€¦
- 2008

In this paper, we introduce the design of an advanced bot called Rambot that is based on the weaknesses we found when tracking a diverse set of botnets over a period of several months. The mainâ€¦ (More)

- Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark
- SIAM J. Discrete Math.
- 2014

A k-block in a graph G is a maximal set of at least k vertices no two of which can be separated in G by fewer than k other vertices. The block number (G) of G is the largest integer k such that G hasâ€¦ (More)

- R. Biczok, Peter Bozsoky, +7 authors A. Stamatakis
- Bioinformatics
- 2018

Motivation
The presence of terraces in phylogenetic tree space, i.e. a potentially large number of distinct tree topologies that have exactly the same analytical likelihood score, was first describedâ€¦ (More)

- Sven Anders, M. Hamann
- Archiv fur Kriminologie
- 2003

Authors report the case of a 55-year-old man with a nearly normal capacity to act for appr. 48 hours following epidural hematoma due to a blunt trauma of the head with skull fracture. The man wasâ€¦ (More)

- M. Hamann
- 2011

We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.

- Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark
- J. Comb. Theory, Ser. B
- 2016

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions,â€¦ (More)

We investigate what conditions on the minimum or average degree of a graph ensure that it contains a k-block , a (maximal) set of at least k vertices no two of which can be separated by fewer than kâ€¦ (More)

We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentationsâ€¦ (More)

- â€¹
- 1
- â€º