Computer-Aided Program Development Group

Selected publications

Papers are sorted by date of publication (newest first). Most of the papers (or their final versions) are copyrighted by the authors or by the publisher. The papers are provided for personal use only; other uses require the explicit permission of the copyright holder!

  • Schmidt G., Berghammer R.:
    Contact, closure, topology, and linking of row and column types of relations. 
    J. Logic and Algebraic Progr. to appear 2011 
    Available: [Final version ScienceDirect]

  • Bolus S.:
    Power indices of simple games and vector-weighted majority games by means of binary decision diagrams. 
    Europ. J. of Oper. Research 210 (2), 258-272, 2011 
    Available: [Final version ScienceDirect]

  • Berghammer R., Winter M.:
    Embedding mappings and splittings with applications. 
    Acta Informatica 47 (2), 77-110, 2010 
    Available: [Final version SpringerLink]

  • Berghammer R., Rusinowska A., de Swart H.:
    A relation-algebraic approach to simple games. 
    SSRN Working papers 09-13, 2009 
    Available: [GATE liste des working papers] or via [SSRN abstract page
    A revised version appeared in Europ. J. of Oper. Research 210 (1), 68-80, 2010 [Final version ScienceDirect]

  • Berghammer R., Rusinowska A., de Swart H.:
    Applying relation algebra and RelView to measures in a social network. 
    SSRN Working papers 09-02, 2009 
    Available: [IDEAS database
    A revised version appeared in Europ. J. of Oper. Research.

  • Fronk A., Kehden B.:
    State space analysis of Petri nets with relation algebraic methods. 
    J. Symbolic Computation 44 (1), 15-47, 2009 
    Available: [Final version ScienceDirect]

  • Berghammer R., Rusinowska A., de Swart H.:
    An interdisciplinary approach to coalition formation. 
    Europ. J. of Oper. Research 195 (2), 487-496, 2009 
    Available: [Final version ScienceDirect]

  • Berghammer R.:
    Applying relation algebra and RelView to solve problems on orders and lattices. 
    Acta Informatica 45 (3), 211-236, 2008 
    Available: [Final version SpringerLink]

  • Schmidt G., Berghammer R.:
    Relational measures and integration in preference modelling. 
    J. Logic and Algebraic Progr. 76 (1), 112-129, 2008 
    Available: [Final version ScienceDirect]

  • Berghammer R., Kehden B.: 
    Relation algebra and RelView in practical use: Construction of special university timetables 
    In: Proc. 10th International Conference "Relational Methods in Computer Science" and 5rd International Workshop "Applications of Kleene Algebra", Frauenchiemsee, 7.4.-11.4. 2008, LNCS 4988, pages 22-36, 2008
    Available: [Final version SpringerLink]

  • Berghammer R., Rusinowska A., de Swart H.:
    Applying relation algebra and RelView to coalition formation. 
    Europ. J. of Oper. Research 178 (2), 530-542, 2007 
    Available: [Final version ScienceDirect]

  • Berghammer R., Fischer S.:
    Implementing relational specifications in a constraint functional logic language. 
    ENTCS 177, 169-183, 2007 
    Available: [Final version ScienceDirect]

  • Berghammer R., Milanese U.:
    Relational approach to Boolean logic problems. 
    In: Proc. 8th International Seminar "Relational Methods in Computer Science" and 3rd International Workshop "Applications of Kleene Algebra", St. Catharines, Canada, 21.2.-27.2. 2005, LNCS 3929, pages 48-59, 2006
    Available: [Preliminary version]

  • Kehden B., Neumann F., Berghammer R.: 
    Relational Implementation of Simple Parallel Evolutionary Algorithms 
    In: Proc. 8th International Seminar "Relational Methods in Computer Science" and 3rd International Workshop "Applications of Kleene Algebra", St. Catharines, Canada, 21.2.-27.2. 2005, LNCS 3929, pages 147-158, 2006
    Available: [Preliminary version]

  • Berghammer R., Fronk A.: 
    Exact computation of minimum feedback vertex sets with relational algebra.
    In: Fundamenta Informaticae 70, pages 301-316, 2006 
    Available: [Preliminary version]

  • Berghammer R.: 
    Relation-algebraic computation of fixed points with applications. 
    In: Journal on Logic and Algebraic Programming 66, pages 112-126, 2006
    Available: [Preliminary version]

  • Kehden, B., Neumann F.: 
    A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems 
    In: Proc. EvoCop 2006, LNCS 3906, pages 147-158, 2006
    Available: [Final version SpringerLink]

  • Neumann F., Laumanns M.: 
    Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-Objective Optimization 
    In: Proc. LATIN 2006, LNCS 3887, pages 745-756, 2006
    Available: [ECCC Report TR05-029]

  • Berghammer R., Neumann F.: 
    RELVIEW - An OBDD-based Computer Algebra System For Relations 
    In: Gansha et al. (Eds.): Proc. of The 8th International Workshop on Computer Algebra in Scientific Computing - CASC 2005, LNCS 3718, Springer, Berlin, Germany, pages 40-51, 2005
    Available: [Final version SpringerLink]

  • Berghammer R., Huch F.:
    From functional to object-oriented programming -- A smooth transition for beginners. 
    Proc. ACM SIGPLAN 2005 Workshop on Functional and Declaratice Programming in Education, ACM SIGPLAN Notices, pages 3-8, 2005 
    Available: [Preliminary version]

  • Neumann F., Wegener I.: 
    Minimum Spanning Trees Made Easier Via Multi-Objective Optimization 
    In: Beyer et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2005, Volume 1, ACM Press, New York, USA, pages 763 - 770, 2005. 
    Best Paper Award
    Available: [Final versionTechnical Report CI 192/05 (SFB 531, University of Dortmund)]

  • Berghammer R., Fronk A.: 
    Solving Design Problems in OO-Software Engineering with Relations and RelView 
    In: Journal on Relational Methods in Computer Science, Vol. 1, pages 73-92, 2004 
    Available: [Final version]

  • Berghammer R.: 
    Computation of Cut Completions and Concept Lattices Using Relational Algebra and RelView 
    In: Journal on Relational Methods in Computer Science, Vol. 1, pages 50 -72, 2004 
    Available: [Final version]

  • Neumann F.: 
    Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem 
    In: Yao et al. (Eds.): Parallel Problem Solving from Nature - PPSN VIII, LNCS 3242, Springer, Berlin, Germany, pages 80 - 89, 2004 
    Available: [Preliminary version] (PostScript, 71 KB)

  • Neumann F., Wegener I.: 
    Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem 
    In: Deb et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2004, LNCS 3102, Springer, Berlin, Germany, pages 713 - 724, 2004
    Available: [Final versionTechnical Report CI 165/04 (SFB 531 University of Dortmund)]

  • Neumann F.: 
    Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem 
    In: Proc. of the Congress on Evolutionary Computation 2004 (CEC 2004), volume 1, pages 904-910, IEEE Press
    Available: [Preliminary version] (PostScript, 50 KB)

  • Berghammer R., Schmidt G., Winter M.: 
    RELVIEW and RATH - Two systems for dealing with relations 
    In: de Swart H., Orlowska E., Schmidt G., Roubens M. (eds.): Theory and Applications of Relational Structures as Knowledge Instruments. LNCS 2929, Springer, 1-16 (2003) 
    Available: [Preliminary version] (PostScript, 75 KB)

  • Berghammer R., Müller-Olm M.: 
    Formal development and verification of approximation algorithms using auxiliary variables 
    In: Bruynooghe M. (ed.): Proc. 13th International Workshop on Logic Based Program Development and Transformation (LOPSTR '03), Uppsala, Schweden, 25.8.-27.8. 2003, LNCS 3018, pages 59-74, 2004 
    Available: [Preliminary version] (PostScript, 66 KB)

  • Berghammer R., Fronk A.: 
    Applying relational algebra in 3D graphical software design 
    In: Berghammer R., Möller B., Struth G. (eds.): Proc. 7th International Seminar "Relational Methods in Computer Science" and 2nd International Workshop "Applications of Kleene Algebra", Malente, 12.5.-17.5. 2003, LNCS 3051, Springer, Berlin, Germany, pages 62 - 74
    Available: [Final version SpringerLinkPreliminary version] (PostScript, 946 KB)

  • Berghammer R., Reuter F.:
    A linear approximation algorithm for bin packing with absolute approximation factor 3/2.
    In: Science of Computer Programming, 48, 67-80 (2003). 
    Available: [Preliminary version]

  • Berghammer R.:
    A generic program for minimal subsets with applications.
    In: Leuschel M., editor, ``Logic-based Program Development and Transformation'' (LOPSTR '02) (proceedings), Lecture Notes in Computer Science 2664, Springer Verlag, 144-157 (2003). 
    Available: [Abstract] [Preliminary version] (PostScript, 69 KB)
    © Springer-Verlag 2003

  • Berghammer R., Hoffmann T., Leoniuk B., Milanese U.:
    Prototyping and programming with relations.
    Available: [Preliminary version] (PostScript, 127 KB) 
    The final version appeared in: Electronic Notes in Theoretical Computer Science 44 (3).
    Available: [Abstract] [Full text] (PDF 275.6 Kb) [Full text] (PostScript 640.4 Kb) [BibTeX
    © Copyright 2003, Elsevier Science, All rights reserved.

  • Berghammer R., Milanese U.:
    KIEL - A computer program for visualizing the execution of functional programs.
    In: Hanus M. editor, ``Functional and (Constraint) Logic Programming '' (WFLP '01) (proceedings), Kiel, 13.9.-15.9. 2001, Bericht 2017, Institut für Informatik und Praktische Mathematik, Universität Kiel, 365-368 (2001).
    Available: [Fulltext] (PostScript, 90 KB)

  • Berghammer R., Hoffmann T., Kasper C.:
    Untersuchungen von Algorithmen für transitive Reduktionen und minimale Äquivalenzgraphen.
    In: Indermark K., Noll T. (eds.): Proc. ``Kolloquium Programmiersprachen und Grundlagen der Programmierung'', Simmerath-Rurberg, 8.10.-10.10. 2001, Aachener Informatik Berichte AIB-2001-11, Department of Computer Science, RWTH Aachen, 1-6 (2001).
    Available: [Fulltext] (PostScript, 175 KB)

  • Milanese U.:
    Zufällig erzeugte BDDs: Algorithmen und Anwendungen.
    In: Indermark K., Noll T., editors, ``Kolloquium Programmiersprachen und Grundlagen der Programmierung'' (proceedings), Simmerath-Rurberg, 8.10.-10.10. 2001, Aachener Informatik Berichte AIB-2001-11, Department of Computer Science, RWTH Aachen, 13-18 (2001).
    Available: [Fulltext] (PostScript, 175 KB)

  • Berghammer R., Hoffmann T.:
    Modelling sequences within the RELVIEW System.
    In: Schellhorn, G., Reif, W., editors: ``Proc. FM-Tools 2000'' Bericht 2000-07, Fakultät für Informatik, Universität Ulm, 59-64 (2000).
    Available: [Fulltext] (PostScript, 50 KB) 
    The final version appeared in: Journal of Universal Computer Science 7(2), 107-123 (2001).
    Available: [BibTeX]

  • Berghammer R.:
    Ein generisches Programm für inklusionsminimale Teilmengen mit einer graphentheoretischen Anwendung.
    In: Goerigk W., editor, ``Programmiersprachen und Rechnerkonzepte'' (proceedings), Bad Honnef, 8.5.-10.5. 2000, Bericht 2007, Institut für Informatik und Praktische Mathematik, Universität Kiel, 141-150 (2000).
    Available: [Fulltext] (PostScript, 53 KB)

  • Berghammer R.:
    KIEL-Ein Computerprogramm zur Visualisierung der Auswertung von funktionalen Programmen.
    In: Diehl S., Kerren A., editors, ``Softwarevisualisierung 2000'' (proceedings), Bericht A/01/2000, Fachgruppe Informatik, Universität des Saarlandes, 53-64 (2000).
    Available: [Fulltext] (PostScript, 203 KB)

  • Berghammer R., Hoffmann T.:
    Relational depth-first-search with applications.
    In: Desharnais J., editor, ``Relational Methods in Computer Science'' (proceedings), Quebec, 9.1.-14.1. 2000, Dep. d'Informatique, Laval University, 11-20 (2000).
    Available: [Preliminary version] (Postscript, 62 KB) 
    The final version appeared in: Information Sciences 139, 167-185 (2001).
    © Copyright 2003, Elsevier Science, All rights reserved.

  • Berghammer R., Hoffmann T., Leoniuk B.:
    Rechnergestützte Erstellung von Prototypen für Programme auf relationalen Strukturen.
    Bericht 9905, Institut für Informatik und Praktische Mathematik, Universität zu Kiel (1999).
    Available: [Fulltext] (PostScript, 216 KB)

  • Berghammer R.:
    Soundness of a purely syntactical formalization of weakest preconditions.
    In: Spreen D., Schulz H., Greb R., editors, ``Workshop on Domains IV" (proceedings), Rolandseck, Germany, 2-4 October 1998, Informatik-Bericht Nr. 99-01, Fachgruppe Informatik, Universität-Gesamthochschule Siegen, 53-70 (1999).
    Available: [Fulltext] (PostScript, 53 KB) 
    The final version appeared in: Electronic Notes in Theoretical Computer Science 35 (2000).
    Available: [Abstract] [Full text] (PDF 260.6 Kb) [Full text] (PostScript 248.2 Kb) [BibTeX]
    © Copyright 2003, Elsevier Science, All rights reserved.

  • von Karger B., Berghammer R.:
    A relational model for temporal logic.
    In: Logic Journal of the IGPL 6, 157-173 (1998).
    Available: [Final version
    © Oxford University Press

  • Berghammer R., von Karger B., Wolf A.:
    Relation-algebraic derivation of spanning tree algorithms.
    In: Jeuring J., editor, ``Mathematics of Programm Construction'' (MPC '98) (proceedings), Lecture Notes in Computer Science 1422. Springer Verlag, 23-43 (1998).
    Available: [Fulltext] (PostScript, 66 KB)

  • Behnke R.:
    Prototyping relational specifications and programs with RELVIEW.
    In: Buth B., Berghammer R. and Peleska J., editors, ``Tool Support for System Development and Verification'' (proceedings), Shaker Verlag, 1-21 (1998).
    Available: [Fulltext] (PostScript, 93 KB)

  Further publications can be found at the RelView-homepage and at the KIEL-Homepage.