Browse

ftp://ftp.mi.uni-koeln.de (288)

	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-112.ps.gz, 19931022 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.112 Generating Convex Polyominoes at Random by Winfried Hochst attler, K oln Martin Loebl, Praha Christoph Moll, K oln K oln, 1992 Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{5000 K oln 41 (Lindenthal) Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-120.ps.gz, 19931022 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.120 Lattice Games with Strategic Takeover by Barry Feldman Kai Nagel 1992 To be published in: 1992 Lectures in Complex Systems. New York: Addison-Wesley, 1993. Lattice Games with Strategic Takeover Barry Feldman Department of
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr91-104.ps.gz, 19931022 Symmetric Matroids and Connectivity Properties of Graphs Matthias Middendorf
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-110.ps.gz, 19931022 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.110 A Note on the Weak Zone Theorem by Winfried Hochst attler , K oln 1992 Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{5000 K oln 41 (Lindenthal) Germany Telefon (0221) 470{3937 Telex 8882291 unik d Telefax
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-106.ps.gz, 19931022 Report Nr. 92.106 Transputer und ihre Architektur { Eine Ubersicht { von Martin Malich, K oln Januar 1992 Mathematisches Institut Universit at zu K oln Weyertal 86{90 D-5000 K oln 41 Telefon (0221)470{2210 Telex 8882291 unik d Electronic Mail MM@MI.UNI-KOELN.DE Transputer und ihre Architektur { Eine
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr89-65.ps.gz, 19931022 On the Complexity of the Farkas{Property of Oriented Matroids Achim Bachem and Andrea Reinhold, Cologne February 1989
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-116.ps.gz, 19931022 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.116 Sensitivity Analysis for General Equilibrium Problems by Achim Bachem , K oln Winfried Hochst attler , K oln Walter Wenzel , K oln 1992 Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{5000 K oln 41 (Lindenthal)
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-118.ps.gz, 19931022 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.118 Nested cones and onion skins (to appear in AML1290) by Winfried Hochst attler K oln, 1992 Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{5000 K oln 41 (Lindenthal) Germany Telefon (0221) 470{3937 Telex 8882291
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-131.ps.gz, 19931022 Programming, Porting and Performance Tests on a 1024-processor Transputercluster Achim Bachem, Theodor Meis, Kai Nagel, Marisa Riemeyer, Michael Wottawa Mathematisches Institut, Universit t zu K ln, Weyertal 80, 50923 K ln e-mail: wottawa@MI.Uni-Koeln.DE
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-146.ps.gz, 19931118 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 93.146 Integer Multicommodity Flows with Reduced Demands by Anand Srivastav Peter Stangier K oln, 1993 Institut f ur Informatik Universit at zu K oln Pohligstrasse 1 50969 K oln Germany Telephone (0221) 470 53 12 Integer
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-119.ps.gz, 19931215 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.119 Parallelisierung von Heuristiken f ur grosse Traveling-Salesman-Probleme by A. Bachem M. Wottawa K oln, 1992 Mathematisches Institut Universit at zu K oln Weyertal 80 D{50931 K oln (Lindenthal) Germany Telephone (0221) 470{4339
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-153.ps.gz, 19940302 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.153 The Circuit Polytope: Facets by Petra Bauer March 1994 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln Address of the author: Petra Bauer Institut f ur Informatik Universit at zu K oln Pohligstrasse
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-107.ps.gz, 19940321 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.107 A fast linear time embedding algorithm based on the Hopcroft-Tarjan planarity test by Petra Mutzel 1992 Das Titelbild zeigt eine Skizze der altesten bekannten mechanischen Rechenmaschine f ur Addition, Subtraktion,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-108.ps.gz, 19940321 GAMM-Mitteilungen 19.., Heft ., ..{.. Schnittebenenverfahren in der Kombinatorischen Optimierung Michael J unger und Gerhard Reinelt
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-114.ps.gz, 19940321 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.114 Provably good solutions for the traveling salesman problem by Michael J unger Gerhard Reinelt Stefan Thienel 1992 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-5000 K oln 51 Addresses of the authors: Michael
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-128.ps.gz, 19940321 Solving the Maximum Weight Planar Subgraph Problem by Branch and Cut by Michael J unger and Petra Mutzel Institut f ur Informatik, Universit at zu K oln Pohligstrasse 1, 5000 K oln 51, Germany mjuenger@informatik.uni-koeln.de mutzel@informatik.uni-koeln.de In this paper we investigate the problem of
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-156.ps.gz, 19940323 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.156 Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization by Michael J unger Gerhard Reinelt Stefan Thienel March 1994 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr92-106.ps, 19940324 Report Nr. 92.106 Transputer und ihre Architektur { Eine Ubersicht { von Martin Malich, K oln Januar 1992 Mathematisches Institut Universit at zu K oln Weyertal 86{90 D-5000 K oln 41 Telefon (0221)470{2210 Telex 8882291 unik d Electronic Mail MM@MI.UNI-KOELN.DE Transputer und ihre Architektur { Eine
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr93-132.ps, 19940324 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 93.132 Microscopic Traffic Modeling on Parallel High Performance Computers by K. Nagel A. Schleicher 1993 Microscopic Traffic Modeling on Parallel High Performance Computers K. Nagel, A. Schleicher, Mathematisches Institut und Zentrum
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr92-114.ps, 19940324 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.114 Provably good solutions for the traveling salesman problem by Michael J unger Gerhard Reinelt Stefan Thienel 1992 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-5000 K oln 51 Addresses of the authors: Michael
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr92-109.ps, 19940324 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 92.109 On Pseudomodular Matroids and Adjoints by Marion Alfter, Troisdorf Winfried Hochst attler , K oln 1992 Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{5000 K oln 41 (Lindenthal) Germany Telefon (0221) 470{3937
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-151.ps, 19940324 Report No. 94.151 Optimized Communication Patterns on Workstation Clusters by J org-Thomas Pfenning Christoph Moll 1994 submitted for publication Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 50931 K oln Optimized Communication Patterns on Workstation Clusters J org-Thomas Pfenning
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr93-129.ps, 19940324 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 93.129 Einbettung der parallelen Grundsoftware CARO in die Primal{Duale Barrierfunktionsmethode by A. Bachem, M. Strietzel K oln, 1993 Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{50923 K oln (Lindenthal) Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-152.ps, 19940324 Report No. 94.152 Experiences with the Mether-NFS Virtual Shared Memory System by Thomas Pfenning 1994 Proc. of the HPCN Europe 1994, M unchen Thomas Pfenning Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 86{90 50931 K oln Experiences with the Mether-NFS Virtual Shared Memory System J
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-156.ps, 19940324 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.156 Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization by Michael J unger Gerhard Reinelt Stefan Thienel March 1994 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr89-80.ps, 19940324 Shellability of Oriented Matroids Winfried Hochst attler, Cologne
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr91-101.ps, 19940324 On Induced Graph-Minors Mike Fellows Jan Kratochv il Matthias Middendorf Frank Pfeiffer
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-155.ps, 19940324 Factoring Integers Above 100 Digits Using Hypercube MPQS F. Damm, F.-P. Heider, G. Wambach University of Cologne March 3, 1994
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr92-121.ps, 19940324 Eine parallele Implementierung des Karmarkar{Verfahrens Achim Bachem und Martin Strietzel Mathematisches Institut der Universit at zu K oln Weyertal 80, 5000 K oln 41 Zusammenfassung: Es wird eine parallele Version des Karamarkar Verfahrens zur Linearen Programmierung dargestellt, die auf einem
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr93-133.ps, 19940324 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 93.133 Deterministic models for traffic jams by Kai Nagel Hans J. Herrmann 1993 Accepted for publication in Physica A HLRZ preprint 46/93 Univ. Cologne Appl. Math. WP 93.133 Deterministic models for traffic jams Kai Nagel+ , Hans J.
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr93-140.ps, 19940407 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 93.140 FAST LOW FIDELITY MICROSIMULATION OF VEHICLE TRAFFIC ON SUPERCOMPUTERS by Kai Nagel 1993 Preprint 94 09 01, Transportation Research Board Meeting, January 1994, Washington D.C. Fast low fidelity microsimulation of vehicle
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr92-117.ps, 19940407 Seitenfl achenverb ande orientierter Matroide Inaugural-Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakult at der Universit at zu K oln vorgelegt von Winfried Hochst attler aus K oln K oln 1992 Berichterstatter: Prof. Dr. Achim Bachem Prof. Dr. Manfred Armbrust
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr93.139.ps, 19940509 Report No. 93.139 The Simulated Trading Heuristic for Solving Vehicle Routing Problems by A. Bachem, W. Hochst attler, M. Malich 1993 Mathematisches Institut Universit at zu K oln Weyertal 80 50931 K oln, Germany The Simulated Trading Heuristic for Solving Vehicle Routing Problems A. Bachem, W. Hochst
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/mi.ps, 19940517 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.157 TRAFFIC AT THE EDGE OF CHAOS by Kai Nagel and Steen Rasmussen 1994 To be published in: Proceedings of the Alife IV conference Traffic at the edge of chaos Kai Nagela;c;d and Steen Rasmussena;b;c aTSA-DO/SA, MS-M997 and bCNLS,
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-159.ps, 19940601 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.159 A Fast Parallel SAT{Solver \| Efficient Workload Balancing by Max B ohm, Ewald Speckenmeyer 1994 to appear in: Annals of Mathematics and Artificial Intelligence Institut f ur Informatik Universit at zu K oln Pohligstr. 1 D{50969
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-158.ps.gz, 19940607 A Practical Method for Computing Delaunay triangulations in the Euclidean metric Michael J unger Volker Kaibel Stefan Thienel Institut f ur Informatik Universit at zu K oln June 7, 1994
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr93-135.ps, 19940712 Report No. 93.135 Simulated Trading Eine kurze Einf uhrung by A. Bachem, W. Hochst attler, M. Malich 1993 published in: PASA Mitteilungen 11(1993) Mathematisches Institut Universit at zu K oln Weyertal 80 50931 K oln, Germany Simulated Trading Eine kurze Einf uhrung A. Bachem, W. Hochst attler, M.
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-125.ps.gz, 19940712 Report No. 92.125 Simulated Trading A New Parallel Approach for Solving Vehicle Routing Problems by A. Bachem, W. Hochst attler, M. Malich 1992 published in: Parallel Computing: Trends and Applications (1994) Proceedings of the International Conference ParCo93 Mathematisches Institut Universit at zu K
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-135.ps.gz, 19940712 Report No. 93.135 Simulated Trading Eine kurze Einf uhrung by A. Bachem, W. Hochst attler, M. Malich 1993 published in: PASA Mitteilungen 11(1993) Mathematisches Institut Universit at zu K oln Weyertal 80 50931 K oln, Germany Simulated Trading Eine kurze Einf uhrung A. Bachem, W. Hochst attler, M.
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr93-137.ps, 19940914 On approximately fair cost allocation in Euclidean TSP games Ulrich Faigle University of Twente Twente, Netherlands S andor P. Fekete Mathematisches Institut Universit at zu K oln 50923 K oln, Germany Winfried Hochst attler y Mathematisches Institut Universit at zu K oln 50923 K oln, Germany Walter Kern
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-164.ps, 19940914 Report No. 94.164 Netzinstallation von Solaris 2.3 uber Subnetzgrenzen hinweg by H. Mika, T. Pfenning, E. Schmoetten 1994 Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 50931 K oln, Germany INHALTSVERZEICHNIS 1 Inhaltsverzeichnis I Die automatische Installation via Netz 3 1 Zum Verst
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-136.ps.gz, 19940929 Report No. 93.136 Hamiltonicity in graphs with few P4s by W. Hochst attler, G. Tinhofer version of September 29, 1994 to appear in: Computing Winfried Hochst attler Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{3937 e{Mail WH@MI.UNI-KOELN.DE G.
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr93-136.ps, 19940929 Report No. 93.136 Hamiltonicity in graphs with few P4s by W. Hochst attler, G. Tinhofer version of September 29, 1994 to appear in: Computing Winfried Hochst attler Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{3937 e{Mail WH@MI.UNI-KOELN.DE G.
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-157.ps.gz, 19941013 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.157 TRAFFIC AT THE EDGE OF CHAOS by Kai Nagel and Steen Rasmussen 1994 To be published in: Proceedings of the Alife IV conference Traffic at the edge of chaos Kai Nagela;c;d and Steen Rasmussena;b;c aTSA-DO/SA, MS-M997 and bCNLS,
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-166.ps, 19941115 Report No. 94.166 On the Complexity of Testing Membership in the Core of Min-cost Spanning Tree Games by U. Faigle, S. Fekete, W. Hochst attler, W. Kern 1994 Ulrich Faigle Walter Kern Department of Applied Mathematics University of Twente P.O.Box 217 NL-7500 AE Enschede The Netherlands S andor P. Fekete
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-170.ps.gz, 19941124 Simulated-Trading Ein paralleles Verfahren zur L osung von kombinatorischen Optimierungsproblemen Inaugural{Dissertation zur Erlangung des Doktorgrades der Mathematisch{Naturwissenschaftlichen Fakult at der Universit at zu K oln vorgelegt von Martin Malich aus Solingen 1994 Berichterstatter: Prof. Dr.
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-175.ps, 19941206 Report No. 94-175 Large Eddy Simulation turbulenter Str omungen auf MIMD-Systemen by T. Gerz, U. Schumann und M. Strietzel 1994 Erschienen in: Parallele Datenverarbeitung aktuell - TAT'94 R. Flieger, R. Grebe (Hrsg.) Dipl.- Math. Martin Strietzel Universit at zu K oln Zentrum f ur Paralleles Rechnen
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-178.ps, 19941215 Report No. 94.178 The Nukleon of Cooperative Games and an Algorithm for Matching Games by U. Faigle, S. Fekete, W. Hochst attler, W. Kern 1994 Ulrich Faigle Walter Kern Department of Applied Mathematics University of Twente P.O.Box 217 NL-7500 AE Enschede The Netherlands S andor P. Fekete Winfried
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-171.ps, 19941219 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.171 EMERGENT TRAFFIC JAMS by Kai Nagel and Maya Paczuski December 16, 1994 Emergent Traffic Jams Kai Nagela;b and Maya Paczuskia a Brookhaven National Laboratory b Center for Parallel Computing ZPR, University of Cologne, 50923 K
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-171.ps.gz, 19941219 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.171 EMERGENT TRAFFIC JAMS by Kai Nagel and Maya Paczuski December 16, 1994 Emergent Traffic Jams Kai Nagela;b and Maya Paczuskia a Brookhaven National Laboratory b Center for Parallel Computing ZPR, University of Cologne, 50923 K
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-149.ps, 19941220 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.149 MIMD{Factorisation on Hypercubes by Frank Damm, Franz-Peter Heider, Georg Wambach K oln, 1994 Institut f ur Informatik Universit at zu K oln Pohligstrasse 1 D{50969 K oln (Zollstock) Germany Telephone +49 221 470{5311 Telefax
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr93-144.ps, 19941220 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 93.144 The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255 by Georg Wambach K oln, 1993 Institut f ur Informatik Universit at zu K oln Pohligstrasse 1 D{50969 K oln (Zollstock) Germany Telephone (0221) 470{5308
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-172.ps.gz, 19941220 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.172 DISCRETE STOCHASTIC MODELS FOR TRAFFIC FLOW by Michael Schreckenberg, Andreas Schadschneider, Kai Nagel, and Nobuyasu Ito 1994 Discrete stochastic models for traffic flow M. Schreckenberg1, A. Schadschneider1, K. Nagel2, and N.
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-180.ps.gz, 19941223 Report No. 94.180 Shared Memory Programming on the Meiko CS-2 by Thomas Pfenning 1994 Submitted to HPCN Europe 1995, Mailand Thomas Pfenning Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 86{90 50931 K oln Shared Memory Programming on the Meiko CS-2 J org-Thomas Pfenning1 and Duncan
	ftp://ftp.mi.uni-koeln.de/pub/paper/titles/zpr94-163.title.ps.gz, 19950109 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.163 An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm by Kurt Mehlhorn Petra Mutzel Stefan N aher 1994 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln Address of the
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-174.ps, 19950109 Computing Delaunay Triangulations in Manhattan and Maximum Metric Michael J unger Volker Kaibel Stefan Thienel Institut f ur Informatik Universit at zu K oln January 9, 1995
	ftp://ftp.mi.uni-koeln.de/pub/paper/titles/zpr94-162.title.ps.gz, 19950109 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.162 On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm by Kurt Mehlhorn Petra Mutzel 1994 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln Address of the authors: Kurt Mehlhorn
	ftp://ftp.mi.uni-koeln.de/pub/paper/titles/zpr94-174.title.ps.gz, 19950109 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.174 Computing Delaunay Triangulations in Manhattan and Maximum Metric by Michael J unger Volker Kaibel Stefan Thienel November 1994 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-163.ps.gz, 19950111 An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm Kurt Mehlhorn Max-Planck-Institut f ur Informatik, 66123 Saarbr ucken, Germany Petra Mutzel Institut f ur Informatik, Universit at zu K oln, 50969 K oln, Germany Stefan N aher Max-Planck-Institut f ur Informatik, 66123
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-173.ps.gz, 19950116 ULTRASCHNELLE MIKROSKOPISCHE VERKEHRSSIMULATIONEN1 Achim Bachema;b, Kai Nagela;c;d, Marcus Rickerta;c aZentrum f ur Paralleles Rechnen ZPR und bMathematisches Institut, Universit at zu K oln, 50923 K oln, Germany. cTSA-DO/SA, MS-M997, Los Alamos National Laboratory, Los Alamos, NM 87545, U.S.A. dSanta
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr89-79.ps.gz, 19950124 Gitterstrukturen bei Matroidproblemen Inaugural-Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakult at der Universit at zu K oln vorgelegt von Hans{J org Rieder aus Stuttgart K oln 1990 Berichterstatter: Prof. Dr. Achim Bachem Prof. Dr. Rainer Schrader Tag der m
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-184.ps.gz, 19950201 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 95.184 Exact ground states of Ising spin glasses: New experimental results with a branch and cut algorithm by C. De Simone, M. Diehl, M. J unger P. Mutzel, G. Reinelt, G. Rinaldi 1995 Research supported in part by EEC Contract
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-183.ps, 19950202 High-speed microsimulations of traffic flow Inaugural-Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakult at der Universit at zu K oln vorgelegt von Kai Nagel aus K oln 1994 Berichterstatter: Prof. Dr. A. Bachem Priv.-Doz. Dr. M. Schreckenberg 3 Contents 1
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-162.ps, 19950313 On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm Kurt Mehlhorn and Petra Mutzel y
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-165.ps.gz, 19950314 The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems Michael J unger and Petra Mutzel Universit at zu K oln, Pohligstrasse 1, 50969 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-145.ps.gz, 19950314 Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools Michael J unger and Petra Mutzel Institut f ur Informatik, Universit at zu K oln, Pohligstrasse 1, D-50969 K oln, Germany mjuenger@informatik.uni-koeln.de Max-Planck-Institut f ur Informatik, Im Stadtwald, D-66123 Saarbr ucken, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-165.ps, 19950314 The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems Michael J unger and Petra Mutzel Universit at zu K oln, Pohligstrasse 1, 50969 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/titles/zpr94-165.title.ps.gz, 19950316 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 94.165 The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems by Michael J unger Petra Mutzel 1994 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln Address of the
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-177.ps, 19950320 A parallel Newton multigrid method for high order finite elements and its application on numerical existence proofs for elliptic boundary value equations Christian Wieners Mathematisches Institut der Universit at K oln, Weyertal 86-90, 50923 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-177.ps.gz, 19950320 A parallel Newton multigrid method for high order finite elements and its application on numerical existence proofs for elliptic boundary value equations Christian Wieners Mathematisches Institut der Universit at K oln, Weyertal 86-90, 50923 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-185.ps, 19950327 Report No. 95-185 Vector Quantisation Classifiers for Handwritten Character Recognition by M. Neschen 1995 Proceedings of the ZEUS-95 Workshop, Linkoping, Sweden, May 1995 IOS Press, Netherlands Martin Neschen Zentrum f ur Paralleles Rechnen (ZPR) Universit at zu K oln Weyertal 80, D-50931 K oln,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-187.ps.gz, 19950328 Report No. 95.187 Quality Control of Ready-made Food by B. Steckemetz 1995 Zentrum f ur Paralleles Rechnen (ZPR), Universit at zu K oln Weyertal 80, D-50931 K oln, Germany Quality Control of Ready-made Food B. Steckemetz Zentrum f ur Paralleles Rechnen (ZPR), Universit at zu K oln Weyertal 80, D-50931 K
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-186.ps, 19950403 Report No. 95-186 Hierarchical Binary Vector Quantisation Classifiers for Handwritten Character Recognition by M. Neschen 1995 submitted to the 17th DAGM Symposion on Pattern Recognition Bielefeld, September 13-15, 1995 Martin Neschen Zentrum f ur Paralleles Rechnen (ZPR) Universit at zu K oln Weyertal
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-189.ps, 19950508 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 95{189 The Complexity of the Falsifiability Problem for Pure Implicational Formulas by P. Heusch 1995 Accepted for MFCS'95 Institut f ur Informatik Universit at zu K oln Pohligstr. 1 D{50969 K oln The Complexity of the Falsifiability
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-176.ps.gz, 19950609 SIMULATION OF OSTWALD RIPENING IN TWO DIMENSIONS: SPATIAL AND NEAREST NEIGHBOR CORRELATIONS Norbert Masbaum Mathematisches Institut, Universit at zu K oln, D-50931 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-169.ps.gz, 19950612 Report No. 94-169 Von Hamstern und anderen Tieren by Marc G urtler und Rainer Heesen 1994 to appear in "Optionsschein Magazin Dipl.-Math. Marc G urtler Dipl.-Volksw. Rainer Heesen Colonia-Nordstern Zentrum f ur Paralleles Rechnen Lebensversicherungs-Management AG Universit at zu K oln Gereonstr. 43-65
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-191.ps.gz, 19950620 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 95.191 Solving large-scale traveling salesman problems with parallel Branch-and-Cut by Michael J unger Peter St ormer 1995 ZENTRUM F UR PARALLELES RECHNEN (ZPR) Institut f ur Informatik Universit at zu K oln Pohligstrasse 1 D-50969 K
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-192.ps.gz, 19950628 Report No. 95-192 Das inverse K urzeste-Wege-Problem by Christoph Moll1 1995 Christoph Moll ZPR Weyertal 80 50969 K oln 1supported by: German Reseach Association (DFG) Das inverse K urzeste-Wege-Problem Inaugural-Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakult
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-193.ps, 19950718 Report No. 95.193 Virtual Shared Memory Programming on Workstation Clusters by Thomas Pfenning Ronald Minnich Achim Bachem 1994 Future Generation Computer Systems, Elsevier Science B.V. (1995) Thomas Pfenning Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 86{90 50931 K oln Virtual Shared
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-193.ps.gz, 19950718 Report No. 95.193 Virtual Shared Memory Programming on Workstation Clusters by Thomas Pfenning Ronald Minnich Achim Bachem 1994 Future Generation Computer Systems, Elsevier Science B.V. (1995) Thomas Pfenning Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 86{90 50931 K oln Virtual Shared
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-197.ps, 19950816 Benchmarking und Leistungsvergleich in Filialnetzen grosser Unternehmen Von Achim Bachem, Brita Hecht, Rainer Heesen und Winfried Hochst attler Stand: 15. August 1995 Uberblick ffl In diesem Beitrag werden Leistungsvergleiche in Unternehmen mit grossem Filialnetz aus dem Dienstleistungsbereich
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-196.ps.gz, 19950816 Zentrum f ur Paralleles Rechnen Universit at zu K oln Zentrum f r Paralleles RechnenRUniversit t zu K lnP Ein sicheres Zahlungssystem f ur offene Computernetze Achim Bachem / Rainer Heesen Durch den fortschreitenden Anschluss von Computern an ein weltweites Netzwerk entstehen neue M arkte, auf denen
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-196.ps, 19950816 Zentrum f ur Paralleles Rechnen Universit at zu K oln Zentrum f r Paralleles RechnenRUniversit t zu K lnP Ein sicheres Zahlungssystem f ur offene Computernetze Achim Bachem / Rainer Heesen Durch den fortschreitenden Anschluss von Computern an ein weltweites Netzwerk entstehen neue M arkte, auf denen
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-198.ps, 19950901 Report No. 95{198 Warehouse Optimization: Packing{algorithms for goods with complex geometries by J org Schepers, Michael Wottawa1 1995 Submitted to SOR '95 Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 D{50931 K oln e-mail: fschepers,wottawag@zpr.Uni-Koeln.DE WWW:
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-150.ps.gz, 19950921 Report No. 94{150 An efficient parallel cluster{heuristic for large Traveling Salesman Problems by Achim Bachem, Barthel Steckemetz, Michael Wottawa 1994 Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 D{50931 K oln e-mail: wottawa@zpr.Uni-Koeln.DE WWW:
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-201.ps, 19951006 The Thickness of a Minor-Excluded Class of Graphs Michael J unger y Petra Mutzel z Thomas Odenthal y Mark Scharbrodt y
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-203.ps, 19951024 ae Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization Michael J unger1* and Petra Mutzel2* 1 Institut f ur Informatik, Universit at zu K oln, Pohligstr. 1, D-50969 K oln, Germany 2 Max-Planck-Institut f ur Informatik, Im Stadtwald, D-66123 Saarbr ucken, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-202.ps, 19951025 Report No. 95.202 On Bases of Circuit Lattices by W. Hochst attler, M. Loebl 1995 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@MI.UNI-KOELN.DE M.Loebl Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-195.ps.gz, 19951025 Report No. 95.195 A Pseudoconfiguration of Points without Adjoint by W. Hochst attler, S. Kromberg 1995 W. Hochst attler, S. Kromberg Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 (6037) e{Mail WH@MI.UNI-KOELN.DE SK@MI.UNI-KOELN.DE 1991 Mathematics Subject
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-154.ps, 19951025 Report No. 94.154 Adjoints and Duals of Matroids Linearly Representable over a Skewfield by W. Hochst attler, S. Kromberg 1994 W. Hochst attler, S. Kromberg Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 (6023) e{Mail WH@MI.UNI-KOELN.DE SK@MI.UNI-KOELN.DE 1991
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-188.ps.gz, 19951025 Report No. 95.188 Recognizing P4-extendible graphs in linear time by W. Hochst attler and H. Schindler 1995 Winfried Hochst attler Heike Schindler ZPR, Zentrum f ur paralleles Rechnen Universit at zu K oln Albertus-Magnus-Platz D-50923 K oln Germany Telefon (0221) 470{6024 (6023) e{Mail
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-139.ps.gz, 19951030 Report No. 93.139 The Simulated Trading Heuristic for Solving Vehicle Routing Problems by A. Bachem, W. Hochst attler, M. Malich 1993 Mathematisches Institut Universit at zu K oln Weyertal 80 50931 K oln, Germany 1991 Mathematics Subject Classification: 90B05, 90C27 Keywords: vehicle routing problem,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-134.ps.gz, 19951030 Report No. 93.134 Computational Experience with General Equilibrium Problems by A. Bachem, W. Hochst attler, B. Steckemetz, A. Volmer to appear in: Computational Optimization and Applications 1993 A. Bachem, W. Hochst attler, B. Steckemetz, A. Volmer Mathematisches Institut Universit at zu K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-204.ps, 19951030 Report No. 95.204 A Network Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees by S andor P. Fekete Monika Klemmstein 1995 A previous version appeared in: Proceedings of the 4th Biennial Twente Workshop on Graphs and Optimization S andor P. Fekete Monika Klemmstein Center for Parallel
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-206.ps.gz, 19951030 Report No. 95.206 Finding All Anchored Squares in a Convex Polygon in Subquadratic Time by S andor P. Fekete 1995 A previous version appeared in: Proceedings of the 4th Canadian Conference on Computational Geometry, 1992 S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-208.ps, 19951030 Report No. 95.208 A Network Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees by S andor P. Fekete Samir Khuller Monika Klemmstein Balaji Raghavachari Neal Young 1995 Submitted to: Journal of Algorithms S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-207.ps, 19951030 Report No. 95.207 New Results on a Visibility Representation of Graphs in 3D by S andor P. Fekete Michael E. Houle Sue Whitesides 1995 To appear in: Graph Drawing 95, Springer Lecture Notes in Computer Science, 1996 S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-204.ps.gz, 19951030 Report No. 95.204 A Network Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees by S andor P. Fekete Monika Klemmstein 1995 A previous version appeared in: Proceedings of the 4th Biennial Twente Workshop on Graphs and Optimization S andor P. Fekete Monika Klemmstein Center for Parallel
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-160.ps.gz, 19951103 Report No. 94.160 A new Linear Time Algorithm for Computing the Convex Hull of a Simple Polygon in the Plane by W. Hochst attler, S. Kromberg, C. Moll 1994 W. Hochst attler, S. Kromberg, C. Moll Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 (6023) e{Mail
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-127.ps.gz, 19951108 Report No. 92.127 A Simple Proof of the Blossom Expansion Lemma by Winfried Hochst attler Stephan Kromberg Christoph Moll 1992 Winfried Hochst attler Stephan Kromberg Christoph Moll Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{5000 K oln 41 (Lindenthal) Germany Telephone (0221)
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-199.ps, 19951109 Report No. 95-199 The Euclidian Traveling Salesman Selection Problem by Anja Hamacher and Christoph Moll 1995 in Proceedings of the SOR '95" Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 D-50931 K oln E{Mail:fhamacher,mollg@zpr.uni-koeln.de 1991 Mathematics Subject Classification:
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-210.ps, 19951113 Report No. 95-210 COGNITUS { Fast and Reliable Recognition of Handwritten Forms based on Vector Quantisation by M. Neschen, F. N ubel 1995 Submitted to the International Conference on High-Performance Computing and Networking", HPCN Europe 1996, Bruxelles, April 16-18, 1996 Martin Neschen, Frank N ubel
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-168.ps.gz, 19951114 The Thickness of Graphs without K5 - Minors Michael J unger y Petra Mutzel z Thomas Odenthal y Mark Scharbrodt y
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-138.ps.gz, 19951123 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 93.138 Onion Skins in Oriented Matroids by B. Gerards, W. Hochst attler 1993 Winfried Hochst attler Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{3937 e{Mail WH@MI.UNI-KOELN.DE
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-200.ps.gz, 19951123 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.200 Oriented Matroids from Wild Spheres by W. Hochst attler 1995 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@MI.UNI-KOELN.DE 1991 Mathematics Subject Classification:
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr90-95.ps, 19951123 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 90.95 A Lattice-theoretical Characterization of Oriented Matroids by W. Hochst attler Version of November 21, 1995 to appear in European Journal of Combinatorics Winfried Hochst attler Zentrum f ur Paralleles Rechnen Universit at zu K
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-126.ps.gz, 19951123 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 92.126 A non-visiting path, nested cones and onion skins by W. Hochst attler 1992 Winfried Hochst attler Mathematisches Institut Universit at zu K oln Weyertal 86-90 D{5000 K oln 41 (Lindenthal) Germany Telephone (0221) 470{6012
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-200.ps, 19951123 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.200 Oriented Matroids from Wild Spheres by W. Hochst attler 1995 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@MI.UNI-KOELN.DE 1991 Mathematics Subject Classification:
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-211.ps, 19951220 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.211 Adjoints, Schiefk orper und algebraische Matroide by S. Kromberg 1995 S. Kromberg Universit at zu K oln Zentrum f ur Paralleles Rechnen Weyertal 80 D{50931 K oln Germany 1991 Mathematics Subject Classification: 05B35, 06C10,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-211.ps.gz, 19951221 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.211 Adjoints, Schiefk orper und algebraische Matroide by S. Kromberg 1995 S. Kromberg Universit at zu K oln Zentrum f ur Paralleles Rechnen Weyertal 80 D{50931 K oln Germany 1991 Mathematics Subject Classification: 05B35, 06C10,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-123.ps.gz, 19951221 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 92.123 Weighted Fractional and Integral k Matching in Hypergraphs by Anand Srivastav1 , Peter Stangier 1994 Discrete Applied Maths, February 1995 Anand Srivastav Institut f ur Informatik \| Lehrstuhl Algorithmen und Komplexit at
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-147.ps.gz, 19951221 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 93.147 Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming by Anand Srivastav1 , Peter Stangier 1995 Random Structures and Algorithms January 1996 and Proceedings of the 5th International Annual Conference on Algorithms
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-212.ps, 19951221 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.212 Tight Approximations for Resource Constrained Scheduling and Bin Packing by Anand Srivastav, Peter Stangier 1995 Parts of this paper appeared as extended abstract in: J. van Leeuwen (ed.), Proceedings of the Second Annual
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-213.ps.gz, 19960102 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.213 Two Lane Traffic Simulations using Cellular Automata by M. Rickerta;b;e, K. Nagelb;e, M. Schreckenbergc , A. Latourd 1995 To be published in Physica A a Center for Parallel Computing, Universit at zu K oln, 50923 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr92-122.ps, 19960102 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 92.122 On Derandomized Approximation Algorithms by Anand Srivastav1 , Peter Stangier 1992 Anand Srivastav Peter Stangier Institut f ur Informatik Institut f ur Informatik Lehrstuhl Algorithmen und Komplexit at Humboldt Universit at zu
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-214.ps, 19960103 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.214 TRAFFIC SIMULATIONS USING CELLULAR AUTOMATA: COMPARISON WITH REALITY by P. WAGNER 1995 Traffic and Granular Flow 1995, Conference Proceedings Center for Parallel Computing, University of Cologne, Weyertal 80 D-50931 K oln,
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-215.ps, 19960115 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.215 A Basic Study of the QAP-Polytope by Michael J unger and Volker Kaibel 1996 Institut f ur Informatik Universit at zu K oln Pohligstr. 1 50969 K oln 1991 Mathematics Subject Classification: 90C09, 90C10, 90C27 Keywords:
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-190.ps.gz, 19960117 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 95.190 Block Sieving Algorithms by Georg Wambach and Hannes Wettig May 1995 Institut f ur Informatik Universit at zu K oln Pohligstrasse 1 D-50969 K oln e-mail: gw @ informatik.uni-koeln.de Block Sieving Algorithms Georg Wambach and
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-217.ps, 19960122 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 96.217 Exact Ground States of Two-Dimensional J Ising Spin Glasses by C. de Simone, M. Diehl, M. J unger P. Mutzel, G. Reinelt, G. Rinaldi 1996 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln Addresses of
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-218.ps, 19960124 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.218 Optimal Oblivious Permutation Routing in Small Hypercubes by Thomas Seifert1, Ewald Speckenmeyer 1996 Universit at zu K oln Institut f ur Informatik / Lehrstuhl III Pohligstr. 1 D-50969 K oln 1This research was supported by the
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-218.ps.gz, 19960124 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.218 Optimal Oblivious Permutation Routing in Small Hypercubes by Thomas Seifert1, Ewald Speckenmeyer 1996 Universit at zu K oln Institut f ur Informatik / Lehrstuhl III Pohligstr. 1 D-50969 K oln 1This research was supported by the
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr95-205.ps, 19960221 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.205 On a Visibility Representation for Graphs in Three Dimensions by Prosenjit Bose Hazel Everett S andor P. Fekete Anna Lubiw Henk Meijer Kathleen Romanik Tom Shermer Sue Whitesides 1995 Submitted to: Journal of Graph Algorithms
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-219.ps.gz, 19960221 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.219 Precomputation based Load Balancing by Max B ohm, Ewald Speckenmeyer 1996 submitted for publication Universit at zu K oln Institut f ur Informatik Pohligstr. 1 D-50969 K oln 1991 Mathematics Subject Classification: 68Q22,
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-221.ps, 19960307 Universit at zu K oln Institut f ur Informatik Prof. Dr. Ewald Speckenmeyer Pohligstr. 1 D{50969 K oln Tel.: +49 221 470-5378 Fax: +49 221 470-5387 e{mail: theotag@informatik.uni{koeln.de Programm des 28. Theorietages K oln, 27. Febr. 1996 H orsaal 301, Pohligstr. 1 9.25 Uhr Begr ussung 9.30 { 9.55 Uhr
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-222.ps.gz, 19960307 Using network-flow techniques to solve an optimization problem from surface-physics U. Blasum a W. Hochst attler a C. Moll a H. Rieger b a Center for Parallel Computing, Cologne b Kernforschungsanlage J ulich The solid-on-solid model provides a commonly used framework for the description of surfaces. In
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-194.ps.gz, 19960319 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95-194 Digitales Geld f ur das Internet by Achim Bachem, Rainer Heesen und J org-Thomas Pfenning 1996 to appear in "Zeitschrift f ur Betriebswirtschaft Zentrum f ur Paralleles Rechnen Universit at zu K oln Albertus-Magnus-Platz 50923
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-229.ps, 19960410 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 96.229 On the Two-Connected Planar Spanning Subgraph Polytope by C. De Simone and M. J unger 1996 Research supported in part by DFG-Grant JU204/7-1 "Effiziente Algorithmen f ur diskrete Probleme und ihre Anwendungen Institut f ur
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-216.ps.gz, 19960410 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96{216 PACKLIB: Ein ASCII{Datenformat f ur Packungsprobleme by Michael Wottawa1 1996 Michael Wottawa Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 D{50931 K oln e-mail: wottawa@zpr.Uni-Koeln.DE WWW:
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-228.ps, 19960410 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96-228 Konzepte f ur Zahlungen im Internet by Rainer Heesen 1996 to appear in "Offene Systeme Zentrum f ur Paralleles Rechnen Universit at zu K oln Albertus-Magnus-Platz 50923 K oln eMail: heesen@zpr.uni-koeln.de 1 Einleitung F ur
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-222.ps, 19960419 Using network-flow techniques to solve an optimization problem from surface-physics U. Blasum, W. Hochst attler, C. Moll, H. Rieger February 20, 1996
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-226.ps.gz, 19960509 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.226 The Complexity of an Inverse Shortest Paths Problem by S andor P. Fekete Stephan Kromberg Christoph Moll Winfried Hochst attler 1996 Submitted to: SIAM Journal of Discrete Mathematics S andor P. Fekete Stephan Kromberg
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-234.ps, 19960513 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96-234 Verbundprojekt PARALOR: Parallele Algorithmen f ur Routing-Probleme im Flug{ und Strassenverkehr by A. Bachem, B. Monien, H. J. Pr omel, R. Schrader, B. Voigt 1996 Beitrag zur Statustagung des BMBF HPSC 95 " Stand und
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-225.ps.gz, 19960517 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.225 Angle-Restricted Tours in the Plane by S andor P. Fekete Gerhard J. Woeginger 1996 To appear in: Computational Geometry { Theory and Applications, 1996 S andor P. Fekete Center for Parallel Computing Universit at zu K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-235.ps, 19960531 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.235 On the Imbalance of Distributions of Solutions of CNF{Formulas and its Impact on Satisfiability Solvers by Ewald Speckenmeyer, Max B ohm, Peter Heusch 1996 submitted to AMS/DIMACS series Universit at zu K oln Institut f ur
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-224.ps, 19960531 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.224 Rectangle and Box Visibility Graphs in 3D by S andor P. Fekete Henk Meijer 1996 Submitted to : Graph Drawing '96 S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY Henk Meijer Department
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-233.ps.gz, 19960610 Interpretation of Pooling Experiments Using the Markov Chain Monte Carlo Method LANL report LAUR-95-2402 E. Knill, A. Schliep, D. Torney 15 February, 1996
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-236.ps, 19960617 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96-236 Parallel Turbulence Simulation based on MPI by Martin Strietzel 1996 Published in: Lecture Notes in Computer Science: High Performance Computing and Networking International Conference and Exhibition, Brussels, Belgium, April
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-220.ps, 19960628 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96-220 Optimale Linienf uhrung und Routenplanung in Verkehrssystemen by Achim Bachema, Anja Hamachera, Christoph Molla, Guido Raspelb 1996 To be published in Proceedings zum BMBF-Statusseminar der anwendungsorientierten
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-237.ps.gz, 19960708 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.237 Clusteralgorithmen zur mathematischen Simulation von Bausparkollektiven by Imke Vannahme 1996 Imke Vannahme Universit at zu K oln Zentrum f ur Paralleles Rechnen Weyertal 80 50931 K oln 1991 Mathematics Subject Classification:
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-231.ps, 19960715 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 96.231 The critical exponents of the two-dimensional Ising spin glass revisited: Exact Ground State Calculations and Monte Carlo Simulations by H. Rieger, L. Santen, U. Blasum M. Diehl, M. J unger, G. Rinaldi 1996 Institut f ur
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-223.ps.gz, 19960719 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 96.223 Semidefinite Programmierung by W. Hochst attler 1996 W. Hochst attler Universit at zu K oln Weyertal 86-90 D 50931 K oln Germany Telefon (0221) 470 6012 e Mail WH@ZPR.UNI-KOELN.DE 1991 Mathematics SubjectClassification: 90C10,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-238.ps.gz, 19960806 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.238 Realistic Multi{Lane Traffic Rules for Cellular Automata by Peter Wagner1, Kai Nagel & Dietrich E. Wolf 1996 Submitted to Physica A 1supported by the NRW Ministry of Science Keywords: traffic simulation, cellular automata, lane
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-240.ps, 19960909 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 96.240 Amplifying the Security of One-Way Functions A Proof of Yao's XOR-Lemma by Frank Damm Franz-Peter Heider September 1996 Frank Damm Institut f ur Informatik Universit at zu K oln Pohligstrasse 1 D-50969 K oln e-mail: fdamm @
	ftp://ftp.mi.uni-koeln.de/pub/paper/PAPER.ps, 19960909 Universit t zu K lnZentrum f r Paralleles RechnenRP Paper and Technical Reports Last Update: September 9, 1996 The Zentrum f ur Paralleles Rechnen" has made their publications available. You can order the printed reports using the enclosed form or by sending a mail to the following address: Zentrum f
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-215.ps.gz, 19961009 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.215 A Basic Study of the QAP-Polytope by Michael J unger and Volker Kaibel 1996 Institut f ur Informatik Universit at zu K oln Pohligstr. 1 50969 K oln 1991 Mathematics Subject Classification: 90C09, 90C10, 90C27 Keywords:
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-239.ps.gz, 19961009 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96-239 A New Heuristic for Vehicle Routing with Narrow Time Windows by Anja Hamacher and Christoph Moll 1995 to appear in Proceedings of the SOR '96" Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 D-50931 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr93-137.ps.gz, 19961009 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 93.137 On approximately fair cost allocation in Euclidean TSP games by U. Faigle, S. Fekete, W. Hochst attler, W. Kern 1996 to appear in: Spektrum of OR Ulrich Faigle Walter Kern Department of Applied Mathematics University of Twente
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-241.ps.gz, 19961009 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.241 On the SQAP-Polytope by Michael J unger and Volker Kaibel 1996 Institut f ur Informatik Universit at zu K oln Pohligstr. 1 50969 K oln 1991 Mathematics Subject Classification: 90C09, 90C10, 90C27 Keywords: Symmetric Quadratic
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-243.ps.gz, 19961010 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms* Michael J unger1 and Petra Mutzel2 1 Institut f ur Informatik, Universit at zu K oln, Pohligstrasse 1, D-50969 K oln, Germany 2 Max-Planck-Institut f ur Informatik, Im Stadtwald, D-66123 Saarbr ucken, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-242.ps.gz, 19961010 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.242 The Tree Interface { Version 1.0 User Manual by Sebastian Leipert 1996 Partially supported by DFG-Grant Ju204/7-2, Forschungsschwer- punkt Effiziente Algorithmen f ur diskrete Probleme und ihre An- wendungen" and ESPRIT Long
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-229.ps.gz, 19961011 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 96.229 On the Two-Connected Planar Spanning Subgraph Polytope by C. De Simone and M. J unger 1996 Research supported in part by DFG-Grant JU204/7-1 "Effiziente Algorithmen f ur diskrete Probleme und ihre Anwendungen and by ESPRIT
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-217.ps.gz, 19961011 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 96.217 Exact Ground States of Two-Dimensional J Ising Spin Glasses by C. De Simone, M. Diehl, M. J unger P. Mutzel, G. Reinelt, G. Rinaldi 1996 Partially supported by ESPRIT Long Term Research Project Nr. 20244 (ALCOM-IT) Institut f
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-245.ps, 19961024 x1 TSP 1.0 TSP 1 1. TSP. This program implements a branch-and-cut algorithm for the symmetric traveling salesman (TSP) problem based on the branch-and-cut framework ABACUS. It does neither provide a practically efficient algorithm for the traveling salesman problem nor it is a state-of-the-art
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-246.ps, 19961111 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.246 Lectures on Jump Systems by J.F. Geelen 1996 James F. Geelen Zentrum f ur Paralleleles Rechnen Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany e{Mail geelen@zpr.uni-koeln.de 1991 Mathematics Subject Classification:
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-245.ps.gz, 19961111 x1 TSP 1.0 TSP 1 1. TSP. This program implements a branch-and-cut algorithm for the symmetric traveling salesman (TSP) problem based on the branch-and-cut framework ABACUS. It does neither provide a practically efficient algorithm for the traveling salesman problem nor it is a state-of-the-art
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-246.ps.gz, 19961111 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.246 Lectures on Jump Systems by J.F. Geelen 1996 James F. Geelen Zentrum f ur Paralleleles Rechnen Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany e{Mail geelen@zpr.uni-koeln.de 1991 Mathematics Subject Classification:
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-244.ps.gz, 19961118 ABACUS A Branch-And-CUt System Version 1.2 User's Guide and Reference Manual Stefan Thienel August 1996 ii Stefan Thienel Institut f ur Informatik Universit at zu K oln Pohligstrasse 1 50969 K oln Germany E-mail: thienel@informatik.uni-koeln.de Copyright c 1996 by Stefan Thienel Writing this manual has
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-249.ps.gz, 19961118 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.249 Cycle bases for lattices of matroids with no Fano dual minor and their one-element extensions by W. Hochst attler, M. Laurent, M. Loebl 1996 Winfried Hochst attler Monique Laurent1 Zentrum f ur Paralleles Rechnen LIENS - Ecole
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-249.ps, 19961118 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.249 Cycle bases for lattices of matroids with no Fano dual minor and their one-element extensions by W. Hochst attler, M. Laurent, M. Loebl 1996 Winfried Hochst attler Monique Laurent1 Zentrum f ur Paralleles Rechnen LIENS - Ecole
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-250.ps, 19961210 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.250 A branch-and-cut approach to physical mapping with end-probes by Thomas Christof, Michael J unger, John Kececioglu, Petra Mutzel, Gerhard Reinelt 1996 Institut f ur Informatik Universit at zu K oln Pohligstr. 1 50969 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-250.ps.gz, 19961210 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.250 A branch-and-cut approach to physical mapping with end-probes by Thomas Christof, Michael J unger, John Kececioglu, Petra Mutzel, Gerhard Reinelt 1996 Institut f ur Informatik Universit at zu K oln Pohligstr. 1 50969 K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-247.ps, 19961211 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.247 Geometrische Verdrahtungsprobleme by Oliver Bastert S andor P. Fekete 1996 Oliver Bastert Mathematisches Institut Technische Universit at M unchen D{80290 M unchen GERMANY S andor P. Fekete Zentrum f ur Paralleles Rechnen
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-247.ps.gz, 19961211 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.247 Geometrische Verdrahtungsprobleme by Oliver Bastert S andor P. Fekete 1996 Oliver Bastert Mathematisches Institut Technische Universit at M unchen D{80290 M unchen GERMANY S andor P. Fekete Zentrum f ur Paralleles Rechnen
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-209.ps.gz, 19961211 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.209 Linear Programming Duality and Morphisms by W. Hochst attler, J. Ne<=set<=ril 1995 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@MI.UNI-KOELN.DE J. Ne<=set<=ril
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/19-scel.ps, 19970106 Programme Monday, 29.04.96 09.45 { 10.00 Opening Address 10.00 { 10.45 Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: On Satisfiability of Partially Defined Double and Bidual Horn Functions 10.45 { 11.15 Coffee Break 11.15 { 12.00 Paul Purdom: Probe Order Backtracking 12.00 { 12.45 David A. Plaisted,
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/01-deckblatt.ps, 19970106 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96-230 Workshop on the Satisfiability Problem Technical Report Siena, April 29 - May 3, 1996 by John Franco Giorgio Gallo Hans Kleine B uning Ewald Speckenmeyer Cosimo Spera (eds.) Universit at zu K oln Institut f ur Informatik
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/20-repadressen.ps, 19970106 Participants of the SAT{Workshop, Siena Battiti Roberto Dipartimento di Matematica University of Trento Via Sommarive 14 I{38050 Povo (Trento) e{mail: battiti@science.unitn.it Boros Endre Rutgers University Computer Science Department New Brunswick NJ 08903 USA e{mail: boros@rutcor.rutgers.edu Eiter
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/16-schiermeyer.ps, 19970106 PURE LITERAL LOOK AHEAD: AN O(1; 497n) 3-SATISFIABILITY ALGORITHM (extended abstract) Ingo Schiermeyer Lehrstuhl f ur Diskrete Mathematik und Grundlagen der Informatik Technische Universit at Cottbus D-03013 Cottbus, Germany E-mail: schierme@math.tu-cottbus.de February 27, 1996
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/13-mitchell.ps, 19970106 Toward an adequate SAT algorithm David Mitchell and Hector Levesque Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 3G4 CANADA December 10, 1996
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/02-battiti.ps, 19970106 Reactive Search: a history-based heuristic for MAX-SAT Roberto Battiti Dipartimento di Matematica, Univ. of Trento Via Sommarive 14, 38050 Povo (Trento) - Italy battiti@science.unitn.it Marco Protasi Dipartimento di Matematica, Univ. di Roma Tor Vergata" Via della ricerca scientifica, 00133 Roma -
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/09-kleine-buening1.ps, 19970106 Closure under replacements versus run time of Davis{Putnam algorithms and distribution of satisfiable formulas Hans Kleine B uning and Theo Lettmann FB 17 { Mathematik/Informatik Universit at { GH { Paderborn 33095 Paderborn (Germany) E{mail: kbcsl@uni-paderborn.de , lettmann@uni-paderborn.de
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/14-nobili.ps, 19970106 Strengthening Lagrangian Bounds for the MAX-SAT Problem (Extended Abstract) Paolo Nobili1, Antonio Sassano2 1Istituto di Analisi dei Sistemi ed Informatica, CNR-Roma, ITALY. Email: nobili@iasi.rm.cnr.it 2Dipartimento di Informatica e Sistemistica, Universit a di Roma La Sapienza", ITALY. Email:
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/05-gallo.ps, 19970106 Max Horn SAT and Directed Hypergraphs: algorithmic enhancements and easy cases G. Gallo C. Gentile D. Pretolani Extended Abstract \| March 1996 1 Introduction The Maximum Satisfiability Problem for Horn clauses (Max Horn SAT) can be formulated as the problem of finding a minimum cardinality cut in a
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/08-heusch.ps, 19970106 Complexity Results of Subclasses of the Pure Implicational Calculus Peter Heusch Marc-Andr e Lemburg Ewald Speckenmeyer Universit at zu K oln Institut f ur Informatik
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/06-gelder.ps, 19970106 Lemma and Cut Strategies for Two-Sided Propositional Resolution (extended abstract) Allen Van Gelder Fumiaki Kamiya Computer Science Dept., 225 AS University of California Santa Cruz, CA 95064 U.S.A. E-mail avg@cs.ucsc.edu, kamiya@cs.ucsc.edu. April 7, 1996
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/12-maaren.ps, 19970106 Elliptic Approximations of Propositional Formulae Hans van Maaren
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/15-purdom.ps, 19970106 Probe Order Backtracking Paul Purdom Computer Science Dept. Indiana University 101, Lindley Hall Bloomington Indiana 47405-4101 USA e-mail: pwp@cs.indiana.edu
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/10-kleine-buening2.ps, 19970106 Resolution remains hard under equivalence Hans Kleine B uning and Theodor Lettmann FB 17 >= Mathematik/Informatik Universit at >= GH >= Paderborn 33095 Paderborn (Germany) E>=mail: kbcsl@uni-paderborn.de lettmann@uni-paderborn.de
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/07-goerdt.ps, 19970106 Probability of satisfiability of random 2-SAT instances with quantification 1 Andreas Goerdt University of Technology Chemnitz-Zwickau Dept. of Computer Science Theoretical Computer Science Strasse der Nationen 09111 Chemnitz
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/18-wang.ps, 19970106 Back-Positioning in SAT Searching Jinchang Wang Department of Business and Economics Missouri Western State College St. Joseph, MO 64507-2294 May 1996
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/11-kullmann.ps, 19970106 A note on a generalization of Extended Resolution O. Kullmann Johann Wolfgang Goethe-Universit at, Fachbereich Mathematik 60054 Frankfurt, Germany e-mail: kullmann@mi.informatik.uni-frankfurt.de June 13, 1996
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/03-eiter.ps, 19970106 On Satisfiability of Partially Defined Double and Bidual Horn Functions (extended abstract) Thomas Eitery Toshihide Ibarakiz Kazuhisa Makinoz 1 Introduction A partially defined Boolean function (pdBF) is a natural generalization of the familiar concept of Boolean function, by allowing that the function
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/17-urquhart.ps, 19970106 The Symmetry Rule in Propositional Logic Extended Abstract Alasdair Urquhart May 10, 1996 1 Introduction The symmetry rule arises naturally in proofs of combinatorial principles; in many cases it allows significant shortening of proofs. We discuss the efficiency of the rule and some of its variants in
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/04-franco.ps, 19970106 An Algorithm for the Class of Pure Implicational Formulas John Franco , Judy Goldsmith y, John Schlipf z, Ewald Speckenmeyer x, and R. P. Swaminathan {
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-230/21-verzeich.ps, 19970106 Contents Page: Title: Authors: 3 Reactive Search: A History{Based Heuristic for MAX{SAT Roberto Battiti, Marco Protasi, Trento, Roma 5 { 14 On Satisfiability of Partially Defined Double and Bidual Horn Functions Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino, Wien, Kyoto 15 An Algorithm for the Class
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-251.ps.gz, 19970123 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.251 Farkas' Lemma and Morphism Duality by W. Hochst attler, J. Ne<=set<=ril 1996 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@MI.UNI-KOELN.DE J. Ne<=set<=ril
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-251.ps, 19970123 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.251 Farkas' Lemma and Morphism Duality by W. Hochst attler, J. Ne<=set<=ril 1996 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@MI.UNI-KOELN.DE J. Ne<=set<=ril
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-257.ps, 19970127 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.257 Analyse gro er Datenmengen und Clusteralgorithmen im Bausparwesen by A. Bachem, S. Fekete, B. Knab, R. Schrader, I. Vannahme, I. Weber, R. Wegener, K. Weinbrecht, B. Wichern 1997 to appear in: C. Hipp: Geld, Finanzwirtschaft,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-258.ps.gz, 19970203 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-258 An exact algorithm for general orthogonal n-dimensional knapsack problems by J org Schepers 1 1996 Proceedings of Operations Research 1996 Center for Parallel Computing University of Cologne D{50931 K oln Weyertal 80 E{Mail
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-258.ps, 19970203 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-258 An exact algorithm for general orthogonal n-dimensional knapsack problems by J org Schepers 1 1996 Proceedings of Operations Research 1996 Center for Parallel Computing University of Cologne D{50931 K oln Weyertal 80 E{Mail
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-260.ps.gz, 19970207 The Design of the Branch-and-Cut System ABACUS Michael J unger and Stefan Thienel January 1997
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-260.ps, 19970207 The Design of the Branch-and-Cut System ABACUS Michael J unger and Stefan Thienel January 1997
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-259.ps.gz, 19970211 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.259 PQ-Trees An Implementation as Template Class in C++ by Sebastian Leipert 1997 Partially supported by DFG-Grant Ju204/7-2, Forschungsschwer- punkt Effiziente Algorithmen f ur diskrete Probleme und ihre An- wendungen" and ESPRIT
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-259.ps, 19970211 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.259 PQ-Trees An Implementation as Template Class in C++ by Sebastian Leipert 1997 Partially supported by DFG-Grant Ju204/7-2, Forschungsschwer- punkt Effiziente Algorithmen f ur diskrete Probleme und ihre An- wendungen" and ESPRIT
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-263.ps, 19970214 Introduction to ABACUS\|A Branch-And-CUt System Michael J unger and Stefan Thienel February 1997
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-263.ps.gz, 19970214 Introduction to ABACUS\|A Branch-And-CUt System Michael J unger and Stefan Thienel February 1997
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-254.ps.gz, 19970511 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.254 Traveling the Boundary of Minkowski Sums by S andor P. Fekete William R. Pulleyblank 1997 Submitted to: Information Processing Letters S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-271.ps, 19970511 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.271 Practical Performance of Efficient Minimum Cut Algorithms by Michael J unger Giovanni Rinaldi Stefan Thienel 1997 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln Addresses of the authors: Michael J
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-254.ps, 19970511 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.254 Traveling the Boundary of Minkowski Sums by S andor P. Fekete William R. Pulleyblank 1997 Submitted to: Information Processing Letters S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-271.ps.gz, 19970511 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.271 Practical Performance of Efficient Minimum Cut Algorithms by Michael J unger Giovanni Rinaldi Stefan Thienel 1997 Institut f ur Informatik UNIVERSIT AT ZU K OLN Pohligstrasse 1 D-50969 K oln Addresses of the authors: Michael J
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-272.ps.gz, 19970519 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.272 About the Tic-Tac-Toe Matroid by W. Hochst attler 1997 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@ZPR.UNI-KOELN.DE 1991 Mathematics Subject Classification:
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-272.ps, 19970519 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.272 About the Tic-Tac-Toe Matroid by W. Hochst attler 1997 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@ZPR.UNI-KOELN.DE 1991 Mathematics Subject Classification:
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr94-178.ps.gz, 19970612 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 94.178 The Nukleon of Cooperative Games and an Algorithm for Matching Games by U. Faigle, S. Fekete, W. Hochst attler, W. Kern revised 5/97 to appear: Mathematical Programming Ulrich Faigle Walter Kern Department of Applied
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-267.ps.gz, 19970612 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.267 A new exact algorithm for general orthogonal d-dimensional knapsack problems by S andor P. Fekete J org Schepers 1997 To appear in: ESA97 S andor P. Fekete J org Schepers Center for Parallel Computing Universit at zu K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-275.ps, 19970617 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.275 Adaptive Skelettierung handgeschriebener Zeichen by B. Steckemetz 1997 Tagungsband Mustererkennung, DAGM 1997, Springer Verlag Zentrum f ur Paralleles Rechnen (ZPR), Universit at zu K oln Weyertal 80, D-50931 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-275.ps.gz, 19970617 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.275 Adaptive Skelettierung handgeschriebener Zeichen by B. Steckemetz 1997 Tagungsband Mustererkennung, DAGM 1997, Springer Verlag Zentrum f ur Paralleles Rechnen (ZPR), Universit at zu K oln Weyertal 80, D-50931 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-274.ps, 19970617 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.274 Neighbor Features for fast Teach-In of Color Image Sequences by B. Steckemetz 1997 Zentrum f ur Paralleles Rechnen (ZPR), Universit at zu K oln Weyertal 80, D-50931 K oln, Germany Neighbor Features for fast Teach-In of Color
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-274.ps.gz, 19970617 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.274 Neighbor Features for fast Teach-In of Color Image Sequences by B. Steckemetz 1997 Zentrum f ur Paralleles Rechnen (ZPR), Universit at zu K oln Weyertal 80, D-50931 K oln, Germany Neighbor Features for fast Teach-In of Color
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr96-227.ps, 19970623 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.227 On Computing a Maximal Planar Subgraph using PQ-Trees by Michael J unger, Sebastian Leipert and Petra Mutzel 1996 Partially supported by DFG-Grant Ju204/7-2, Forschungsschwerpunkt Effiziente Algorithmen f ur diskrete Probleme
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-227.ps.gz, 19970623 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.227 On Computing a Maximal Planar Subgraph using PQ-Trees by Michael J unger, Sebastian Leipert and Petra Mutzel 1996 Partially supported by DFG-Grant Ju204/7-2, Forschungsschwerpunkt Effiziente Algorithmen f ur diskrete Probleme
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-208.ps.gz, 19970625 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 95.208 A Network Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees by S andor P. Fekete Samir Khuller Monika Klemmstein Balaji Raghavachari Neal Young Revised 1997 To appear in: Journal of Algorithms S andor P.
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-256.ps, 19970626 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.256 Optimizing the Area of Simple Polygons by S andor P. Fekete 1997 Submitted to: Discrete and Computational Geometry S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY 1991 Mathematics
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-256.ps.gz, 19970626 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.256 Optimizing the Area of Simple Polygons by S andor P. Fekete 1997 Submitted to: Discrete and Computational Geometry S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY 1991 Mathematics
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-266.ps.gz, 19970704 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.266 Traveling Salesmen in the Age of Competition by S andor P. Fekete Matthias Schmitt 1997 Submitted to: 5th Biennial Twente Workshop on Graphs and Optimization S andor P. Fekete Matthias Schmitt Center for Parallel Computing
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-277.ps.gz, 19970711 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.277 On the scheduling of one-dimensional transport systems by U. Heinrichs, C. Moll 1997 Christoph Moll ZPR University of Cologne D-50923 K oln Germany email: moll@zpr.uni-koeln.de Udo Heinrichs ZPR University of Cologne D-50923 K
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-277.ps, 19970711 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.277 On the scheduling of one-dimensional transport systems by U. Heinrichs, C. Moll 1997 Christoph Moll ZPR University of Cologne D-50923 K oln Germany email: moll@zpr.uni-koeln.de Udo Heinrichs ZPR University of Cologne D-50923 K
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-280.ps.gz, 19970806 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.280 Histogram decomposition and stereolithography by S andor P. Fekete Joseph S. B. Mitchell 1997 Submitted for publication S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY Joseph S. B.
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-280.ps, 19970808 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.280 Histogram decomposition and stereolithography by S andor P. Fekete Joseph S. B. Mitchell 1997 Submitted for publication S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY Joseph S. B.
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-276.ps, 19970815 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.276 Asymmetric Rendezvous on the Plane by Edward J. Anderson S andor P. Fekete 1997 Submitted to: SIAM Journal on Control and Optimization Edward J. Anderson Australian Graduate School of Management University of New South Wales
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-273.ps, 19970819 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.273 The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems by S andor P. Fekete Michael E. Houle Sue Whitesides 1997 A condensed version of this paper is to appear in: Graph Drawing 97 S
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-276.ps.gz, 19970819 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.276 Asymmetric Rendezvous on the Plane by Edward J. Anderson S andor P. Fekete 1997 Submitted to: SIAM Journal on Control and Optimization Edward J. Anderson Australian Graduate School of Management University of New South Wales
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-282.ps.gz, 19970911 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.282 Large Circuits in Binary Matroids of Large Cogirth: II by W. Hochst attler, B. Jackson 1997 Winfried Hochst attler Zentrum f ur Paralleles Rechnen Universit at zu K oln, Weyertal 80 D-50931 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-281.ps.gz, 19970912 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.281 Large Circuits in Binary Matroids of Large Cogirth: I by W. Hochst attler, B. Jackson 1997 Winfried Hochst attler Zentrum f ur Paralleles Rechnen Universit at zu K oln, Weyertal 80 D-50931 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-282.ps, 19970912 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.282 Large Circuits in Binary Matroids of Large Cogirth: II by W. Hochst attler, B. Jackson 1997 Winfried Hochst attler Zentrum f ur Paralleles Rechnen Universit at zu K oln, Weyertal 80 D-50931 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-281.ps, 19970912 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.281 Large Circuits in Binary Matroids of Large Cogirth: I by W. Hochst attler, B. Jackson 1997 Winfried Hochst attler Zentrum f ur Paralleles Rechnen Universit at zu K oln, Weyertal 80 D-50931 K oln, Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-273.ps.gz, 19970926 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.273 The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems by S andor P. Fekete Michael E. Houle Sue Whitesides 1997 A condensed version of this paper is to appear in: Graph Drawing 97 S
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-286.ps, 19971007 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.286 Menger's Theorem As Morphism Duality by W. Hochst attler, J. Ne<=set<=ril 1996 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@MI.UNI-KOELN.DE J. Ne<=set<=ril
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-278.ps, 19971007 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.278 Pitfalls of using PQ-Trees in Automatic Graph Drawing by Michael J unger, Sebastian Leipert and Petra Mutzel 1997 Partially supported by DFG-Grant Ju204/7-2, Forschungsschwerpunkt Effiziente Algorithmen f ur diskrete Probleme
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-278.ps.gz, 19971007 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.278 Pitfalls of using PQ-Trees in Automatic Graph Drawing by Michael J unger, Sebastian Leipert and Petra Mutzel 1997 Partially supported by DFG-Grant Ju204/7-2, Forschungsschwerpunkt Effiziente Algorithmen f ur diskrete Probleme
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-286.ps.gz, 19971007 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.286 Menger's Theorem As Morphism Duality by W. Hochst attler, J. Ne<=set<=ril 1996 W. Hochst attler Universit at zu K oln Weyertal 86-90 D{50931 K oln Germany Telefon (0221) 470{6012 e{Mail WH@MI.UNI-KOELN.DE J. Ne<=set<=ril
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-287.ps, 19971016 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-287 On computing all minimal solutions for feedback problems by B. Schwikowski, E. Speckenmeyer 1997 B. Schwikowski DKFZ, Abt. Theoretische Bioinformatik, INF 280, D-69120 Heidelberg GMD-SCAI, D-53757 St. Augustin E-mail:
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-287.ps.gz, 19971016 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-287 On computing all minimal solutions for feedback problems by B. Schwikowski, E. Speckenmeyer 1997 B. Schwikowski DKFZ, Abt. Theoretische Bioinformatik, INF 280, D-69120 Heidelberg GMD-SCAI, D-53757 St. Augustin E-mail:
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-224.ps.gz, 19971016 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 96.224 Rectangle and Box Visibility Graphs in 3D by S andor P. Fekete Henk Meijer 1996 To appear in: International Journal of Computational Geometry and its Applications S andor P. Fekete Center for Parallel Computing Universit at zu
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-269.ps.gz, 19971020 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-269 Dynamic Load Balancing for Simulations of Biological Aging by F. Meisgen 1997 published in: International Journal of Modern Physics C, Vol. 8, Nr.3, June 1997, pages 575{582 F. Meisgen Department of Computer Science Cologne
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-269.ps, 19971020 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-269 Dynamic Load Balancing for Simulations of Biological Aging by F. Meisgen 1997 published in: International Journal of Modern Physics C, Vol. 8, Nr.3, June 1997, pages 575{582 F. Meisgen Department of Computer Science Cologne
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-293.ps.gz, 19971111 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.293 Baumzerlegungen unter Nebenbedingungen Ein Clusterverfahren zur L osung praktischer Vehicle-Routing-Probleme by Anja Hamacher 1997 Anja Hamacher Zentrum f ur Paralleles Rechnen Universit at zu K oln hamacher@zpr.uni-koeln.de
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-285.ps, 19971111 Box-Inequalities for Quadratic Assignment Polytopes Michael J unger Institut f ur Informatik Universit at zu K oln Pohligstr. 1 50969 K oln Germany mjuenger@informatik.uni-koeln.de Volker Kaibel Institut f ur Informatik Universit at zu K oln Pohligstr. 1 50969 K oln Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-294.ps.gz, 19971111 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.294 Duality in Combinatorial Optimization Sometimes it Works, Sometimes it Won't by W. Hochst attler 1997 Winfried Hochst attler ZPR, Zentrum f ur paralleles Rechnen Universit at zu K oln Albertus-Magnus-Platz D-50923 K oln Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-294.ps, 19971111 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.294 Duality in Combinatorial Optimization Sometimes it Works, Sometimes it Won't by W. Hochst attler 1997 Winfried Hochst attler ZPR, Zentrum f ur paralleles Rechnen Universit at zu K oln Albertus-Magnus-Platz D-50923 K oln Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-284.ps, 19971111 The QAP-Polytope and the Star-Transformation Michael J unger Institut f ur Informatik Universit at zu K oln mjuenger@informatik.uni-koeln.de Volker Kaibel Institut f ur Informatik Universit at zu K oln kaibel@informatik.uni-koeln.de September 19, 1997
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-284.ps.gz, 19971111 The QAP-Polytope and the Star-Transformation Michael J unger Institut f ur Informatik Universit at zu K oln mjuenger@informatik.uni-koeln.de Volker Kaibel Institut f ur Informatik Universit at zu K oln kaibel@informatik.uni-koeln.de September 19, 1997
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-285.ps.gz, 19971111 Box-Inequalities for Quadratic Assignment Polytopes Michael J unger Institut f ur Informatik Universit at zu K oln Pohligstr. 1 50969 K oln Germany mjuenger@informatik.uni-koeln.de Volker Kaibel Institut f ur Informatik Universit at zu K oln Pohligstr. 1 50969 K oln Germany
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-293.ps, 19971111 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.293 Baumzerlegungen unter Nebenbedingungen Ein Clusterverfahren zur L osung praktischer Vehicle-Routing-Probleme by Anja Hamacher 1997 Anja Hamacher Zentrum f ur Paralleles Rechnen Universit at zu K oln hamacher@zpr.uni-koeln.de
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-295.ps.gz, 19971114 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.295 Mesoskopisches Simulationsmodell zur Kollektivfortschreibung by B. Knab, R. Schrader, I. Weber, K. Weinbrecht, B. Wichern 1997 Ausarbeitung eines auf der Fachtagung Kollektivanalyse und -fortschreibung am 16.10.1997 in
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-295.ps, 19971114 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.295 Mesoskopisches Simulationsmodell zur Kollektivfortschreibung by B. Knab, R. Schrader, I. Weber, K. Weinbrecht, B. Wichern 1997 Ausarbeitung eines auf der Fachtagung Kollektivanalyse und -fortschreibung am 16.10.1997 in
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-297.ps, 19971126 Polyhedral Combinatorics of QAPs with Less Objects than Locations (Extended Abstract) Volker Kaibel Institut f ur Informatik Universit at zu K oln kaibel@informatik.uni-koeln.de November 25, 1997
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-297.ps.gz, 19971126 Polyhedral Combinatorics of QAPs with Less Objects than Locations (Extended Abstract) Volker Kaibel Institut f ur Informatik Universit at zu K oln kaibel@informatik.uni-koeln.de November 25, 1997
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-262.ps, 19971202 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-262 CATS{Computer Aided Tram Scheduling by Peter Heusch Frank Meisgen Ewald Speckenmeyer 1997 To appear in: Proceedings of SOR'97 Peter Heusch Frank Meisgen Ewald Speckenmeyer Institut f ur Informatik Universit at zu K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-262.ps.gz, 19971202 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-262 CATS{Computer Aided Tram Scheduling by Peter Heusch Frank Meisgen Ewald Speckenmeyer 1997 To appear in: Proceedings of SOR'97 Peter Heusch Frank Meisgen Ewald Speckenmeyer Institut f ur Informatik Universit at zu K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-298.ps.gz, 19971202 ABACUS A Branch-And-CUt System Version 2.0 User's Guide and Reference Manual Stefan Thienel September 1997 ii Stefan Thienel Institut f ur Informatik Universit at zu K oln Pohligstrasse 1 50969 K oln Germany E-mail: thienel@informatik.uni-koeln.de Copyright c 1996 { 1997 by Stefan Thienel Writing this
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-298.ps, 19971202 ABACUS A Branch-And-CUt System Version 2.0 User's Guide and Reference Manual Stefan Thienel September 1997 ii Stefan Thienel Institut f ur Informatik Universit at zu K oln Pohligstrasse 1 50969 K oln Germany E-mail: thienel@informatik.uni-koeln.de Copyright c 1996 { 1997 by Stefan Thienel Writing this
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-302.ps.gz, 19971210 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97-302 Exakte Algorithmen f ur orthogonale Packungsprobleme by J org Schepers 1 1997 J org Schepers Zentrum f ur Paralleles Rechnen Universit at zu K oln schepers@zpr.uni-koeln.de 1supported by the German Federal Ministry of Education
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-302.ps, 19971210 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97-302 Exakte Algorithmen f ur orthogonale Packungsprobleme by J org Schepers 1 1997 J org Schepers Zentrum f ur Paralleles Rechnen Universit at zu K oln schepers@zpr.uni-koeln.de 1supported by the German Federal Ministry of Education
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-307.ps.gz, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 307 Dynamic User Equilibria in Traffic Simulation Models by C. Gawron, S. Krauss, P. Wagner 1997 Proceedings of Traffic and Granular Flow , Duisburg '97 C. Gawron, Center for Parallel Computing, University of Cologne, 50931 K oln,
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-303.ps, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 303 A Continuous Limit of the Nagel{Schreckenberg{Model by S. Krauss, P. Wagner, C. Gawron 1996 Pysical Review E 54, 3707 S. Krauss, P. Wagner, C. Gawron Zentrum f ur Paralleles Rechnen, Universit at zu K oln, 50931 K oln 1991
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-307.ps, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 307 Dynamic User Equilibria in Traffic Simulation Models by C. Gawron, S. Krauss, P. Wagner 1997 Proceedings of Traffic and Granular Flow , Duisburg '97 C. Gawron, Center for Parallel Computing, University of Cologne, 50931 K oln,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-304.ps.gz, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 304 Metastable States in a Microscopic Model of Traffic Flow by S. Krauss, P. Wagner, C. Gawron 1997 Pysical Review E 55, 5597 S. Krauss, P. Wagner Deutsche Forschungsanstalt f ur Luft{ und Raumfahrt, Linder H ohe, 51170 K oln C.
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-305.ps, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 305 Towards a Unified View of Microscopic Traffic Flow Theories by S. Krauss 1997 Transportation Systems, IFAC/IFIP/IFORS Symposion, Chania, Greece, 1997 S. Krauss Deutsches Zentrum f ur Luft{ und Raumfahrt Hauptabteilung Mobilit at
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-306.ps, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 306 Microscopic Traffic Simulation: Robustness of a Simple Approach by S. Krauss 1997 Proceedings of Traffic and Granular Flow , Duisburg '97 S. Krauss Deutsches Zentrum f ur Luft{ und Raumfahrt Hauptabteilung Mobilit at und
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-306.ps.gz, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 306 Microscopic Traffic Simulation: Robustness of a Simple Approach by S. Krauss 1997 Proceedings of Traffic and Granular Flow , Duisburg '97 S. Krauss Deutsches Zentrum f ur Luft{ und Raumfahrt Hauptabteilung Mobilit at und
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-303.ps.gz, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 303 A Continuous Limit of the Nagel{Schreckenberg{Model by S. Krauss, P. Wagner, C. Gawron 1996 Pysical Review E 54, 3707 S. Krauss, P. Wagner, C. Gawron Zentrum f ur Paralleles Rechnen, Universit at zu K oln, 50931 K oln 1991
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-304.ps, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 304 Metastable States in a Microscopic Model of Traffic Flow by S. Krauss, P. Wagner, C. Gawron 1997 Pysical Review E 55, 5597 S. Krauss, P. Wagner Deutsche Forschungsanstalt f ur Luft{ und Raumfahrt, Linder H ohe, 51170 K oln C.
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-305.ps.gz, 19971216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 305 Towards a Unified View of Microscopic Traffic Flow Theories by S. Krauss 1997 Transportation Systems, IFAC/IFIP/IFORS Symposion, Chania, Greece, 1997 S. Krauss Deutsches Zentrum f ur Luft{ und Raumfahrt Hauptabteilung Mobilit at
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-310.ps, 19971219 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 1997.310 Experiences with a simplified microsimulation for the Dallas/Fort Worth area by M. Rickerta;b and K. Nagelb;c 1997 International Journal of Modern Physics C, Vol. 8, No.3 (1997) 483-503 a Center for Parallel Computing,
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-301.ps, 19971219 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.301 Finding Dense Subgraphs with Semidefinite Programming by Anand Srivastav and Katja Wolf 1997 1991 Mathematics Subject Classification: 68Q25, 05C85 Keywords: Subgraph Problem, Approximation Algorithms, Randomized Algorithms,
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-308.ps, 19971219 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 1997.308 Parallel Real-time Implementation of Large-scale, Route-plan-driven Traffic Simulation by Marcus Rickerta;b and Peter Wagnera;c 1996 International Journal of Modern Physics C, Vol. 7, No.2 (1996) 133-153 a Center for Parallel
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-309.ps.gz, 19971219 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 1997.309 Real{Time Traffic Simulation of the German Autobahn Network by M. Rickerta;b, P.Wagnera;c, Ch. Gawrona 1996 Proceedings of the 4th Workshop on Parallel Systems and Algorithms (PASA '96) World Scientific Publishing Co. Pte.
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-310.ps.gz, 19971219 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 1997.310 Experiences with a simplified microsimulation for the Dallas/Fort Worth area by M. Rickerta;b and K. Nagelb;c 1997 International Journal of Modern Physics C, Vol. 8, No.3 (1997) 483-503 a Center for Parallel Computing,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-301.ps.gz, 19971219 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.301 Finding Dense Subgraphs with Semidefinite Programming by Anand Srivastav and Katja Wolf 1997 1991 Mathematics Subject Classification: 68Q25, 05C85 Keywords: Subgraph Problem, Approximation Algorithms, Randomized Algorithms,
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-309.ps, 19971219 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 1997.309 Real{Time Traffic Simulation of the German Autobahn Network by M. Rickerta;b, P.Wagnera;c, Ch. Gawrona 1996 Proceedings of the 4th Workshop on Parallel Systems and Algorithms (PASA '96) World Scientific Publishing Co. Pte.
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-308.ps.gz, 19971219 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 1997.308 Parallel Real-time Implementation of Large-scale, Route-plan-driven Traffic Simulation by Marcus Rickerta;b and Peter Wagnera;c 1996 International Journal of Modern Physics C, Vol. 7, No.2 (1996) 133-153 a Center for Parallel
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-311.ps, 19971220 1 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-311 Struktur und algorithmische Behandlung von praxisorientierten dreidimensionalen Packungsproblemen by Michael Wottawa 2 1997 Michael Wottawa Zentrum f ur Paralleles Rechnen Universit at zu K oln wottawa@zpr.uni-koeln.de
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-312.ps, 19980106 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.312 Geometric Ideas for Graph Representation and for Cooperative Game Theory by S andor P. Fekete 1997 S andor P. Fekete Center for Parallel Computing Universit at zu K oln D 50923 K oln GERMANY 1991 Mathematics Subject
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-311.ps.gz, 19980106 1 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97-311 Struktur und algorithmische Behandlung von praxisorientierten dreidimensionalen Packungsproblemen by Michael Wottawa 2 1997 Michael Wottawa Zentrum f ur Paralleles Rechnen Universit at zu K oln wottawa@zpr.uni-koeln.de
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-312.ps.gz, 19980106 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.312 Geometric Ideas for Graph Representation and for Cooperative Game Theory by S andor P. Fekete 1997 S andor P. Fekete Center for Parallel Computing Universit at zu K oln D 50923 K oln GERMANY 1991 Mathematics Subject
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-300.ps.gz, 19980112 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.300 Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States by Michael J unger, Giovanni Rinaldi 1997 To appear in: P. Kischka (ed.), Proc. SOR '97, Jena Institut f ur Informatik Universit at zu K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-299.ps.gz, 19980112 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.299 A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem by Michael J unger, Eva K. Lee, Petra Mutzel, Thomas Odenthal 1997 To appear in: G. Di Battista (ed.), Graph Drawing '97 (Proc.), Rome, Lecture Notes in
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-299.ps, 19980112 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.299 A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem by Michael J unger, Eva K. Lee, Petra Mutzel, Thomas Odenthal 1997 To appear in: G. Di Battista (ed.), Graph Drawing '97 (Proc.), Rome, Lecture Notes in
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-300.ps, 19980112 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.300 Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States by Michael J unger, Giovanni Rinaldi 1997 To appear in: P. Kischka (ed.), Proc. SOR '97, Jena Institut f ur Informatik Universit at zu K oln
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-257.ps.gz, 19980122 ANGEWANDTE MATHEMATIK UND INFORMATIK UNIVERSIT AT ZU K OLN Report No. 97.257 Analyse gro er Datenmengen und Clusteralgorithmen im Bausparwesen by A. Bachem, S. Fekete, B. Knab, R. Schrader, I. Vannahme, I. Weber, R. Wegener, K. Weinbrecht, B. Wichern 1997 C. Hipp: Tagungsband zur 7. Tagung Geld,
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr96-232.ps.gz, 19980122 Scheduling Trams in the Morning is Hard Ulrich Blasumy Michael R. Bussieckz Winfried Hochst attlery Christoph Mollx Hans-Helmut Scheelz Thomas Winterz{
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-296.ps, 19980212 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.296 Approximation of Geometric Dispersion Problems by Christoph Baur S andor P. Fekete 1997 Submitted to: APPROX '98 Christoph Baur S andor P. Fekete Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY 1991
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-283.ps.gz, 19980216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.283 Tree Partitioning under Constraints Clustering for Vehicle Routing Problems by Anja Hamacher, Winfried Hochst attler, Christoph Moll revised 2/98 Anja Hamacher G.U.S. AG & Co. Cologne Germany ahamacher@guskoeln.de Winfried
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-283.ps, 19980216 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.283 Tree Partitioning under Constraints Clustering for Vehicle Routing Problems by Anja Hamacher, Winfried Hochst attler, Christoph Moll revised 2/98 Anja Hamacher G.U.S. AG & Co. Cologne Germany ahamacher@guskoeln.de Winfried
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr97-265.ps, 19980220 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.265 New classes of lower bounds for bin packing problems by S andor P. Fekete J org Schepers 1997 To appear in: IPCO'98 S andor P. Fekete J org Schepers Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr97-265.ps.gz, 19980220 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.265 New classes of lower bounds for bin packing problems by S andor P. Fekete J org Schepers 1997 To appear in: IPCO'98 S andor P. Fekete J org Schepers Center for Parallel Computing Universit at zu K oln D{50923 K oln GERMANY
	ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr98-313.ps, 19980302 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.296 Tree Spanners in Planar Graphs by S andor P. Fekete Jana Kremer 1998 Submitted to: 24th International Workshop on Graph-Theoretic Concepts in Computer Science S andor P. Fekete Center for Parallel Computing Universit at zu K
	ftp://ftp.mi.uni-koeln.de/pub/paper/zpr98-313.ps.gz, 19980302 Angewandte Mathematik und Informatik Universit at zu K oln Report No. 97.296 Tree Spanners in Planar Graphs by S andor P. Fekete Jana Kremer 1998 Submitted to: 24th International Workshop on Graph-Theoretic Concepts in Computer Science S andor P. Fekete Center for Parallel Computing Universit at zu K