 | 2011 |
| 8 |  | Michael Behrisch,
Amin Coja-Oghlan,
Peter Liske:
Eulerian Circuits.
Algorithms Unplugged 2011: 277-283 |
| 2010 |
| 7 |  | Michael Behrisch,
Amin Coja-Oghlan,
Mihyun Kang:
The order of the giant component of random hypergraphs.
Random Struct. Algorithms 36(2): 149-184 (2010) |
| 2009 |
| 6 |  | Michael Behrisch,
Anusch Taraz,
Michael Ueckerdt:
Coloring Random Intersection Graphs and Complex Networks.
SIAM J. Discrete Math. 23(1): 288-299 (2009) |
| 2008 |
| 5 |  | Michael Behrisch,
Amin Coja-Oghlan,
Peter Liske:
Die Eulertour.
Taschenbuch der Algorithmen 2008: 295-301 |
| 2007 |
| 4 |  | Michael Behrisch,
Amin Coja-Oghlan,
Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs.
APPROX-RANDOM 2007: 341-352 |
| 3 |  | Michael Behrisch:
Component Evolution in Random Intersection Graphs.
Electr. J. Comb. 14(1): (2007) |
| 2 |  | Michael Behrisch:
Stochastical models for networks in the life sciences.
Humboldt University of Berlin 2007: 1-159 |
| 2006 |
| 1 |  | Michael Behrisch,
Anusch Taraz:
Efficiently covering complex networks with cliques of similar vertices.
Theor. Comput. Sci. 355(1): 37-47 (2006) |