Publikationen

2008

• Circulations, Fuzzy Relations and Semirings
  R. Glück, B. Möller
  in P. Audebaud and C. Pauline-Mohring (eds.): Mathematics of Program Construction, LNCS 5133.
  pp. 134-152, 2008.
  Springer.

2002

• Declarative Graph Algorithms via Knuth-Bendix Completion
  G. Struth
  Technical Report, Institute of Computer Science, University of Augsburg, May 2002
  2002-10

1998

• Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach
  T. Brunn, B. Möller, M. Russling
  In J. Jeuring (ed.): Mathematics of Program Construction, LNCS 1422.
  pp. 96-121, 1998.
  Springer-Verlag.

1997

• Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach
  T. Brunn, B. Möller, M. Russling
  Technical Report, Institute of Computer Science, University of Augsburg, December 1997
  1997-08

1994

• Shorter paths to graph algorithms
  B. Möller, M. Russling
  In Science of Computer Programming 22.
  pp. 157-180, 1994.

1993

• Derivation of Graph and Pointer Algorithms
  B. Möller
  Institut für Mathematik der Universität Augsburg.
  Report Nr. 280, 1993
• Derivation of graph and pointer algorithms
  B. Möller
  In B. Möller, H.A. Partsch, S.A. Schuman (eds.): Formal program development, LNCS 755.
  pp. 123-160, 1993.
  Springer-Verlag.
• Shorter paths to graph algorithms
  B. Möller, M. Russling
  In R. S. Bird, C. C. Morgan, J. C. P. Woodcock (eds.): Mathematics of program construction, LNCS 669.
  pp. 250-268, 1993.
  Springer-Verlag.
• Algebraic calculation of graph and sorting algorithms
  B. Möller
  In D. Bjorner, M. Broy, I.V. Pottosin (eds.): Formal methods in Programming and their Applications, LNCS 735.
  pp. 394-413, 1993.
  Springer-Verlag.

1992

• Shorter Paths to Graph Algorithms
  B. Möller, M. Russling
  Institut für Mathematik der Universität Augsburg.
  Report Nr. 272, 1992