Burkhard Monien
Burkhard Monien
Professor für Informatik
Verified email at
Cited by
Cited by
Solving satisfiability in less than 2n steps
B Monien, E Speckenmeyer
Discrete Applied Mathematics 10 (3), 287-295, 1985
Dissemination of information in interconnection networks (broadcasting & gossiping)
J Hromkovic, R Klasing, B Monien, R Peine
Combinatorial network theory 1, 125-212, 1996
Embedding one interconnection network in another
B Monien, H Sudborough
Computational graph theory, 257-282, 1990
Min cut is NP-complete for edge weighted trees
B Monien, IH Sudborough
Theoretical Computer Science 58 (1-3), 209-229, 1988
Efficient schemes for nearest neighbor load balancing
R Diekmann, A Frommer, B Monien
Parallel computing 25 (7), 789-812, 1999
How to find long paths efficiently
B Monien
North-Holland Mathematics Studies 109, 239-254, 1985
Ramsey numbers and an approximation algorithm for the vertex cover problem
B Monien, E Speckenmeyer
Acta Informatica 22 (1), 115-123, 1985
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
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
Nashification and the coordination ratio for a selfish routing game
R Feldmann, M Gairing, T Lücking, B Monien, M Rode
International Colloquium on Automata, Languages, and Programming, 514-526, 2003
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
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
A distributed algorithm to evaluate quantified boolean formulae
R Feldmann, B Monien, S Schamberger
AAAI/IAAI, 285-290, 2000
Diffusion schemes for load balancing on heterogeneous networks
R Elsässer, B Monien, R Preis
Theory of Computing Systems 35, 305-320, 2002
Using helpful sets to improve graph bisections
R Diekmann, B Monien, R Preis
Interconnection networks and mapping and scheduling parallel computations 21 …, 1994
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
Selfish routing with incomplete information
M Gairing, B Monien, K Tiemann
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 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
Two-way multihead automata over a one-letter alphabet
B Monien
RAIRO. Informatique théorique 14 (1), 67-82, 1980
Quality matching and local improvement for multilevel graph-partitioning
B Monien, R Preis, R Diekmann
Parallel Computing 26 (12), 1609-1634, 2000
The system can't perform the operation now. Try again later.
Articles 1–20