Technical Reports 1998

  • Shiva Chaudhuri, K.V. Subrahamanyam, Frank Wagner, Christos D. Zaroliagis:
    • On Mimicking Networks (B 98-01)
  • Peter Braß:
    • On the Diameter of Sets with Maximum Number of Unit Distances (B 98-02)
  • Matthias Eichhoff, Gerald Weber
    • Must all Mathematicians be Platonists? A case of Penrose's use of Gödel (B 98-03)
  • Bernd Gärtner, Sven Schönherr
    • Smallest Enclosing Circles - An Exact and Generic Implementation in C++ (B 98-04)
  • Bernd Gärtner, Sven Schönherr
    • Smallest Enclosing Ellipses - An Exact and Generic Implementation in C++ (B 98-05)
  • Stefan Felsner, Helmut Weil
    • Sweeps, Arrangements and Signotopes (B 98-06)
  • Stefan Felsner, Jens Gustedt, Michel Morvan
    • Interval Reductions and Extensions of Orders: Bijections to Chains in Lattices (B 98-07)
  • Daniel Faensen, Annika Hinze, Heinz Schweppe
    • Alerting in a Digital Library Environment Do Channels meet the requirements? (B 98-08)
  • Boris Bokowski, André Spiegel:
    • Barat - A Front-End for Java (B 98-09)
  • Stefan Felsner, G. Agnarsson, W.T. Trotter
    • The Maximum Number of Edges in a Graph of Bounded Dimension, with Applications to Ring Theory (B 98-10)
  • Stefan Felsner, W.T. Trotter
    • Posets and Planar Graphs (B 98-11)
  • Stefan Felsner, W.T. Trotter
    • Dimension, Graph and Hypergraph Coloring (B 98-12)
  • André Spiegel:
    • Objects by Value: Evaluating the Trade-Off (B 98-13)
  • Boris Bokowski:
    • CoffeeStrainer - Statically Checking Structural Constraints on Java Programs (B 98-14)
  • Dirk Pape
    • Higher Order Demand Propagation (B 98-15)
  • Dirk Pape
    • The Safety of Higher Order Demand Propagation (B 98-16)
  • Markus Dahm
    • Byte Code Engineering with the JavaClass API (B 98-17)