| 2009 | ||
|---|---|---|
| 12 | Michael Brinkmeier: Increasing the Edge Connectivity by One in O(lambda_G n^2 log* n) Expected Time. CTW 2009: 301-304 | |
| 11 | Michael Brinkmeier: Minimum Cuts of Simple Graphs in Almost Always Linear Time. WALCOM 2009: 226-237 | |
| 10 | Michael Brinkmeier, Günter Schäfer, Thorsten Strufe: Optimally DoS Resistant P2P Topologies for Live Multimedia Streaming. IEEE Trans. Parallel Distrib. Syst. 20(6): 831-844 (2009) | |
| 2007 | ||
| 9 | Michael Brinkmeier, Jeremias Werner, Sven Recknagel: Communities in graphs and hypergraphs. CIKM 2007: 869-872 | |
| 8 | Michael Brinkmeier: A Simple and Fast Min-Cut Algorithm. Theory Comput. Syst. 41(2): 369-380 (2007) | |
| 2006 | ||
| 7 | Michael Brinkmeier: PageRank revisited. ACM Trans. Internet Techn. 6(3): 282-301 (2006) | |
| 6 | Michael Brinkmeier: Minimizing Symmetric Set Functions Faster CoRR abs/cs/0603108: (2006) | |
| 5 | Michael Brinkmeier: Structural Alignments of pseudo-knotted RNA-molecules in polynomial time CoRR abs/cs/0604051: (2006) | |
| 2005 | ||
| 4 | Michael Brinkmeier: A Simple and Fast Min-cut Algorithm. FCT 2005: 317-328 | |
| 3 | Michael Brinkmeier: Distributed Calculation of PageRank Using Strongly Connected Components. IICS 2005: 29-40 | |
| 2004 | ||
| 2 | Michael Brinkmeier, Thomas Schank: Network Statistics. Network Analysis 2004: 293-317 | |
| 2003 | ||
| 1 | Michael Brinkmeier: Communities in Graphs. IICS 2003: 20-35 | |
| 1 | Sven Recknagel | [9] |
| 2 | Günter Schäfer | [10] |
| 3 | Thomas Schank | [2] |
| 4 | Thorsten Strufe | [10] |
| 5 | Jeremias Werner | [9] |