95-183 K.NAGEL: High-speed microsimulations of traffic flow
95-185 M.NESCHEN: Vector quantization classifiers for handwritten character recognition
95-186 M.NESCHEN: Hierarchical binary vector quantization classifiers for
handwritten character recognition
95-187 B.STECKEMETZ: Quality control of ready-made food
95-188 W.HOCHSTäTTLER, H.SCHINDLER: Recognizing -extendible graphs in linear time
95-190 G.WAMBACH, H.WETTIG: Block sieving algorithms
95-192 C.MOLL: Das inverse Kürzeste-Wege-Problem
95-193 J.-T.PFENNING, R.MINNICH, A.BACHEM: Virtual shared memory programming on workstation clusters
95-195 W.HOCHSTäTTLER, S.KROMBERG: A pseudoconfiguration of points without an adjoint
95-196 A.BACHEM, R.HEESEN: Ein sicheres Zahlungssystem für offene Computernetze
95-198 J.SCHEPERS, M.WOTTAWA: Warehouse optimization: packing algorithms for goods with complex geometries
95-199 A.HAMACHER, C.MOLL: The Euclidean traveling salesman selection problem
95-200 W.HOCHSTäTTLER: Oriented matroids from wild spheres
95-202 W.HOCHSTäTTLER, M.LOEBL: On bases of circuit lattices
95-204 S.FEKETE, M.KLEMMSTEIN: Worst-case ratios for bounded-degree trees
95-205 P.BOSE, H.EVERETT, S.FEKETE, A.LUBIW, H.MEIJER, K.ROMANIK, T.SHERMER, S.WHITESIDES: On a visibility representation of graphs in 3D
95-206 S.FEKETE: Finding all anchored squares in a convex polygon in subquadratic time
95-207 S.FEKETE, M.HOULE,S.WHITESIDES: New results on a visibility representation of graphs in 3D
95-208 S.FEKETE, S.KHULLER, M.KLEMMSTEIN, B.RAGHAVACHARI, N.YOUNG: A network flow technique for finding low-weight bounded-degree trees
95-209 W.HOCHST¨ATTLER, J.NE\VSET\VRIL: Linear programming duality and morphisms
95-210 M.NESCHEN, F.NüBEL: COGNITUS - fast and reliable recognition of handwritten
forms based on vector quantisation
95-211 S.KROMBERG: Adjoints, Schiefkörper und algebraische Matroide
95-212 A.SRIVASTAV, P.STANGIER: Tight approximation for resource-constrained scheduling and bin packing
95-213 M.RICKERT, K.NAGEL, M.SCHRECKENBERG, A.LATOUR: Two-lane traffic simulations using cellular automata
95-214 P.WAGNER: Traffic simulations using cellular automata: comparison with reality
96-216 M.WOTTAWA: PACKLIB: Ein ASCII-Datenformat für Packungsprobleme
96-220 A.BACHEM, A.HAMACHER, C.MOLL, G.RASPEL: Optimale Linienführung und Routenplanung in Verkehrssystemen
96-222 U.BLASUM, W.HOCHSTäTTLER, C.MOLL, H.RIEGER: Using network-flow techniques to solve an optimization problem from surface-physics
96-223 W.HOCHST¨ATTLER: Semidefinite Programmierung
96-224 S.FEKETE, H.MEIJER: Rectangle and box visibility graphs in 3D
96-225 S.FEKETE, G.WOEGINGER: Angle-restricted tours in the plane
96-226 S.FEKETE, W.HOCHSTäTTLER, S.KROMBERG, C.MOLL: The complexity of an inverse shortest path problem
96-231 H.RIEGER, L.SANTEN, U.BLASUM, M.DIEHL, M.JüNGER, G.RINALDI: The critical exponents of the two-dimensional Ising spin glass
revisited: exact ground state calculations and Monte Carlo
simulations
96-232 U.BLASUM, M.BUSSIEK, W.HOCHSTäTTLER, C.MOLL, H.SCHEEL, T.WINTER: Scheduling trams in the morning is hard
96-233 E.KNILL, A.SCHLIEP, D.TORNEY: Interpretation of pooling experiments using the Markov chain Monte Carlo method
96-234 A.BACHEM, B.MONIEN, H.J.PRöMEL, R.SCHRADER, B.VOIGT: Verbundproject PARALOR: Parallele Algorithmen für Routingprobleme im
Flug- und Straßenverkehr
96-236 M.STRIETZEL: Parallel turbulence simulation based on MPI
96-237 I.VANNAHME: Clusteralgorithmen zur mathematischen Simulation von Bausparkollektiven
96-238 P.WAGNER, K.NAGEL, D.E.WOLF: Realistic multi-lane traffic rules for cellular automata
96-239 A.HAMACHER, C.MOLL: A new heuristic for vehicle routing with narrow time windows
96-240 F.DAMM, F.-P.HEIDER: Amplifying the security of one-way functions
96-246 J.GEELEN: Lectures on jump systems
96-247 O.BASTERT, S.FEKETE: Geometrische Verdrahtungsprobleme
96-248 R.SCHRADER, G.WAMBACH: The setup polyhedron of N-sparse posets
96-249 W.HOCHSTäTTLER, M.LAURENT, M.LOEBL: Cycle bases for lattices of matroids with no Fano
dual minor and their one-element extensions
96-251 W.HOCHSTäTTLER, J.NE\VSET\VRIL: Farkas' Lemma and Morphism Duality