Search the dblp DataBase

Publications of Author

1. Michael Brinkmeier, Thomas Schank
   Network Statistics. [Citation Graph (0, 0)][DBLP]
   Network Analysis, 2004, pp:293-317 [Conf]
   
2. Michael Brinkmeier
   A Simple and Fast Min-cut Algorithm. [Citation Graph (0, 0)][DBLP]
   FCT, 2005, pp:317-328 [Conf]
   
3. Michael Brinkmeier
   Communities in Graphs. [Citation Graph (0, 0)][DBLP]
   IICS, 2003, pp:20-35 [Conf]
   
4. Michael Brinkmeier
   Distributed Calculation of PageRank Using Strongly Connected Components. [Citation Graph (0, 0)][DBLP]
   IICS, 2005, pp:29-40 [Conf]
   
5. Michael Brinkmeier
   PageRank revisited. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Internet Techn., 2006, v:6, n:3, pp:282-301 [Journal]
   
6. Michael Brinkmeier
   Minimizing Symmetric Set Functions Faster [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
7. Michael Brinkmeier
   Structural Alignments of pseudo-knotted RNA-molecules in polynomial time [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
8. Michael Brinkmeier
   A Simple and Fast Min-Cut Algorithm. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2007, v:41, n:2, pp:369-380 [Journal]
   
9. 
   Communities in graphs and hypergraphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Towards a Denial-of-Service Resilient Design of Complex IPsec Overlays. [Citation Graph (, )][DBLP]
    
    
11. 
    Towards the Design of Unexploitable Construction Mechanisms for Multiple-Tree Based P2P Streaming Systems. [Citation Graph (, )][DBLP]
    
    
12. 
    Minimum Cuts of Simple Graphs in Almost Always Linear Time. [Citation Graph (, )][DBLP]
    
    
13. 
    Increasing the Edge Connectivity by One in O(lambda_G n^2 log* n) Expected Time. [Citation Graph (, )][DBLP]