![]() | ![]() |
2009 | ||
---|---|---|
10 | EE | Michael Brinkmeier: Minimum Cuts of Simple Graphs in Almost Always Linear Time. WALCOM 2009: 226-237 |
2007 | ||
9 | EE | Michael Brinkmeier, Jeremias Werner, Sven Recknagel: Communities in graphs and hypergraphs. CIKM 2007: 869-872 |
8 | EE | Michael Brinkmeier: A Simple and Fast Min-Cut Algorithm. Theory Comput. Syst. 41(2): 369-380 (2007) |
2006 | ||
7 | EE | Michael Brinkmeier: PageRank revisited. ACM Trans. Internet Techn. 6(3): 282-301 (2006) |
6 | EE | Michael Brinkmeier: Minimizing Symmetric Set Functions Faster CoRR abs/cs/0603108: (2006) |
5 | EE | Michael Brinkmeier: Structural Alignments of pseudo-knotted RNA-molecules in polynomial time CoRR abs/cs/0604051: (2006) |
2005 | ||
4 | EE | Michael Brinkmeier: A Simple and Fast Min-cut Algorithm. FCT 2005: 317-328 |
3 | EE | Michael Brinkmeier: Distributed Calculation of PageRank Using Strongly Connected Components. IICS 2005: 29-40 |
2004 | ||
2 | EE | Michael Brinkmeier, Thomas Schank: Network Statistics. Network Analysis 2004: 293-317 |
2003 | ||
1 | EE | Michael Brinkmeier: Communities in Graphs. IICS 2003: 20-35 |
1 | Sven Recknagel | [9] |
2 | Thomas Schank | [2] |
3 | Jeremias Werner | [9] |