Martin Löbbing

The Number of Knight's Tours Equals 33, 439, 123, 484, 294 - Counting with Binary Decision Diagrams

Ingo Wegener, Martin Löbbing, I. Wegener, 1996, Electron. J. Comb..

On the complexity of the hidden weighted bit function for various BDD models

Beate Bollig, Ingo Wegener, Martin Sauerhoff, 1999, RAIRO Theor. Informatics Appl..

Parity OBDDs Cannot be Handled Efficiently Enough

Ingo Wegener, Detlef Sieling, Martin Löbbing, 1998, Inf. Process. Lett..

On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams

Beate Bollig, Ingo Wegener, Martin Löbbing, 1996, Inf. Process. Lett..

Complexity Theoretical Aspects of OFDDs

Beate Bollig, Ingo Wegener, Martin Sauerhoff, 1996 .