| Solving satisfiability in less than 2n steps B Monien, E Speckenmeyer Discrete Applied Mathematics 10 (3), 287-295, 1985 | 408 | 1985 |
| Dissemination of information in interconnection networks (broadcasting & gossiping) J Hromkovič, R Klasing, B Monien, R Peine Combinatorial network theory, 125-212, 1996 | 330 | 1996 |
| Embedding one interconnection network in another B Monien, H Sudborough Computational graph theory, 257-282, 1990 | 274 | 1990 |
| Ramsey numbers and an approximation algorithm for the vertex cover problem B Monien, E Speckenmeyer Acta Informatica 22 (1), 115-123, 1985 | 230 | 1985 |
| Efficient schemes for nearest neighbor load balancing R Diekmann, A Frommer, B Monien Parallel computing 25 (7), 789-812, 1999 | 229 | 1999 |
| How to find long paths efficiently B Monien North-Holland Mathematics Studies 109, 239-254, 1985 | 225 | 1985 |
| Min cut is NP-complete for edge weighted trees B Monien, IH Sudborough Theoretical Computer Science 58 (1-3), 209-229, 1988 | 201 | 1988 |
| The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete B Monien SIAM Journal on Algebraic Discrete Methods 7 (4), 505-512, 1986 | 184 | 1986 |
| Computing Nash equilibria for scheduling on restricted parallel links M Gairing, T Lücking, M Mavronicolas, B Monien Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 140 | 2004 |
| A new model for selfish routing T Lücking, M Mavronicolas, B Monien, M Rode STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science …, 2004 | 136* | 2004 |
| Nashification and the coordination ratio for a selfish routing game R Feldmann, M Gairing, T Lücking, B Monien, M Rode ICALP 30, 514-526, 2003 | 136 | 2003 |
| A distributed algorithm to evaluate quantified boolean formulae R Feldmann, B Monien, S Schamberger AAAI/IAAI, 285-290, 2000 | 125 | 2000 |
| Diffusion schemes for load balancing on heterogeneous networks R Elsässer, B Monien, R Preis Theory of Computing Systems 35, 305-320, 2002 | 120 | 2002 |
| Using helpful sets to improve graph bisections R Diekmann, B Monien, R Preis Interconnection networks and mapping and scheduling parallel computations 21 …, 1994 | 117 | 1994 |
| Exact price of anarchy for polynomial congestion games S Aland, D Dumrauf, M Gairing, B Monien, F Schoppmann SIAM Journal on Computing 40 (5), 1211-1233, 2011 | 113 | 2011 |
| Exact price of anarchy for polynomial congestion games S Aland, D Dumrauf, M Gairing, B Monien, F Schoppmann STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006 | 111 | 2006 |
| Selfish routing with incomplete information M Gairing, B Monien, K Tiemann Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005 | 106 | 2005 |
| On the number of rounds necessary to disseminate information S Even, B Monien Proceedings of the first annual ACM symposium on Parallel algorithms and …, 1989 | 106 | 1989 |
| Game tree search on massively parallel systems R Feldmann, P Mysliwietz, B Monien Advances in Computer Chess 7, 1993 | 103 | 1993 |
| Quality matching and local improvement for multilevel graph-partitioning B Monien, R Preis, R Diekmann Parallel Computing 26 (12), 1609-1634, 2000 | 101 | 2000 |
