Corradini, Andrea, and Reiko Heckel. “A Compositional Approach to Structuring and Refinement of Typed Graph Grammars.” In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), 2:46–55. Electronic Notes in Theoretical Computer Science . Elsevier, 1995.

Bardohl, Bernhard, Roswitha Bardohl, Paulo Castro, Hartmut Ehrig, Reiko Heckel, Leila Ribeiro, Daltro Nunes, and Alfio Martini. “GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development.” In Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany), Vol. 26. Bilateral Seminars of the International Bureau. Forschungszentrum Jülich GmbH, 1995.

Engels, Gregor, and Andy Schürr. “Encapsulated Hierarchical Graphs, Graph Types, and Meta Types.”http://dx.doi.org/10.1016/S1571-0661(05)80186-0__In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), 101–9. Electronic Notes in Theoretical Computer Science. Amsterdam, The Netherlands: Elsevier, 1995.http://dx.doi.org/10.1016/S1571-0661(05)80186-0 .

Heckel, Reiko, and Annika Wagner. “Ensuring Consistency of Conditional Graph Grammars - A Constructive Approach.”http://dx.doi.org/10.1016/S1571-0661(05)80188-4__In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), 2:118–26. Electronic Notes in Theoretical Computer Science. Elsevier, 1995.http://dx.doi.org/10.1016/S1571-0661(05)80188-4 .

Kremer, H.-Hugo. “Existenzgründung.” In Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1, edited by U. Braukmann, A. Diettrich, H.-H. Kremer, P.F.E. Sloane, and E. Stickling, 1st ed., 19–94. Düsseldorf, 1995.

Aston, Philip J., and Michael Dellnitz. “Symmetry Breaking Bifurcations of Chaotic Attractors.”https://doi.org/10.1142/s021812749500123x__International Journal of Bifurcation and Chaos, 1995, 1643–76.https://doi.org/10.1142/s021812749500123x .

Dellnitz, M, and C Heinrich. “Admissible Symmetry Increasing Bifurcations.”https://doi.org/10.1088/0951-7715/8/6/009__Nonlinearity, 1995, 1039–66.https://doi.org/10.1088/0951-7715/8/6/009 .

Dellnitz, M, and I Melbourne. “A Note on the Shadowing Lemma and Symmetric Periodic Points.”https://doi.org/10.1088/0951-7715/8/6/010__Nonlinearity, 1995, 1067–75.https://doi.org/10.1088/0951-7715/8/6/010 .

Dellnitz, Michael, Michael Field, Martin Golubitsky, Jun Ma, and Andreas Hohmann. “Cycling Chaos.”https://doi.org/10.1142/s0218127495000909__International Journal of Bifurcation and Chaos, 1995, 1243–47.https://doi.org/10.1142/s0218127495000909 .

Dellnitz, Michael, Martin Golubitsky, Andreas Hohmann, and Ian Stewart. “Spirals in Scalar Reaction–Diffusion Equations.”https://doi.org/10.1142/s0218127495001149__International Journal of Bifurcation and Chaos, 1995, 1487–1501.https://doi.org/10.1142/s0218127495001149 .

Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”https://doi.org/10.1016/s0020-0190(97)00032-x__Information Processing Letters, 1995, 103–10.https://doi.org/10.1016/s0020-0190(97)00032-x .

Golubitsky, Martin, Jerrold Marsden, Ian Stewart, and Michael Dellnitz. “The Constrained Liapunov-Schmidt Procedure and Periodic Orbits.”https://doi.org/10.1090/fic/004/05__In Normal Forms and Homoclinic Chaos. Providence, Rhode Island, 1995.https://doi.org/10.1090/fic/004/05 .

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.”https://doi.org/10.1007/3-540-59042-0_81__In STACS 95. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-59042-0_81 .

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.”https://doi.org/10.1007/3-540-60313-1_133__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_133 .

Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.”https://doi.org/10.1145/215399.215430__In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995.https://doi.org/10.1145/215399.215430 .

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.”https://doi.org/10.1109/istcs.1995.377051__In Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.https://doi.org/10.1109/istcs.1995.377051 .

Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.”https://doi.org/10.1007/3-540-60618-1_77__In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60618-1_77 .

Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.”https://doi.org/10.1007/3-540-60313-1_131__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_131 .

Platzner, Marco, Bernhard Rinner, and Reinhold Weiss. “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation.” J.UCS Journal of Universal Computer Science 12 (1995): 811–20.

Dugast, Christian, Peter Beyerlein, and Reinhold Haeb-Umbach. “Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition.” In ICASSP, Detroit, 1995.