1. Aditya Agrawal, Gabor Karsai, Sandeep Neema, Feng Shi & Attila Vizhanyo (2006): The design of a language for model transformations. Software and System Modeling 5(3), pp. 261–288, doi:10.1007/s10270-006-0027-7.
  2. Thorsten Arendt, Enrico Biermann, Stefan Jurack, Christian Krause & Gabriele Taentzer (2010): Henshin: Advanced Concepts and Tools for In-Place EMF Model Transformations. In: Model Driven Engineering Languages and Systems (MODELS 2010), Lecture Notes in Computer Science 6394. Springer, pp. 121–135, doi:10.1007/978-3-642-16145-2_9.
  3. Christopher Bak (2015): GP+.1667em2: Efficient Implementation of a Graph Programming Language. Department of Computer Science, University of York. Available at
  4. Christopher Bak & Detlef Plump (2012): Rooted Graph Programs. In: Proc. International Workshop on Graph Based Tools (GraBaTs 2012), Electronic Communications of the EASST 54, doi:10.14279/tuj.eceasst.54.780.
  5. Christopher Bak & Detlef Plump (2016): Compiling Graph Programs to C. In: Proc. International Conference on Graph Transformation (ICGT 2016), LNCS 9761. Springer, pp. 102–117, doi:10.1007/978-3-319-40530-8_7.
  6. Cüneyt F. Bazlamaçcı & Khalil S. Hindi (2001): Minimum-weight spanning tree algorithms A survey and empirical study. Computers & Operations Research 28(8), pp. 767–785, doi:10.1016/S0305-0548(00)00007-1.
  7. Graham Campbell, Brian Courtehoute & Detlef Plump: Fast Rule-Based Graph Programs. Work in progress.
  8. Graham Campbell, Brian Courtehoute & Detlef Plump (2019): Linear-Time Graph Algorithms in GP+.1667em2. In: Proceedings 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019), Leibniz International Proceedings in Informatics (LIPICS). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 16:1–16:23, doi:10.4230/LIPIcs.CALCO.2019.16.
  9. Graham Campbell, Jack Romö & Detlef Plump (2020): The Improved GP+.1667em2 Compiler. ArXiv e-prints arXiv:2010.03993. Available at 11 pages.
  10. Brian Courtehoute & Detlef Plump (2020): A Fast Graph Program for Computing Minimum Spanning Trees. In: Proc. 11th International Workshop on Graph Computation Models (GCM 2020), pp. 165–183. Available at Pre-proceedings version of this paper.
  11. Maribel Fernández, Hélène Kirchner, Ian Mackie & Bruno Pinaud (2014): Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY. In: Proc. Computability in Europe (CiE 2014), Lecture Notes in Computer Science 8493. Springer, pp. 183–193, doi:10.1007/978-3-319-08019-2_19.
  12. Amir Hossein Ghamarian, Maarten de Mol, Arend Rensink, Eduardo Zambon & Maria Zimakova (2012): Modelling and analysis using GROOVE. International Journal on Software Tools for Technology Transfer 14(1), pp. 15–40, doi:10.1007/s10009-011-0186-x.
  13. Annegret Habel & Detlef Plump (2002): Relabelling in Graph Transformation. In: Proc. International Conference on Graph Transformation (ICGT 2002), Lecture Notes in Computer Science 2505. Springer, pp. 135–147, doi:10.1007/3-540-45832-8_12.
  14. Edgar Jakumeit, Sebastian Buchwald & Moritz Kroll (2010): GrGen.NET - The expressive, convenient and fast graph rewrite system. International Journal on Software Tools for Technology Transfer 12(3–4), pp. 263–271, doi:10.1007/s10009-010-0148-8.
  15. Detlef Plump (2012): The Design of GP+.1667em2. In: Proc. Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), Electronic Proceedings in Theoretical Computer Science 82, pp. 1–16, doi:10.4204/EPTCS.82.1.
  16. Detlef Plump (2017): From Imperative to Rule-based Graph Programs. Journal of Logical and Algebraic Methods in Programming 88, pp. 154–173, doi:10.1016/j.jlamp.2016.12.001.
  17. Olga Runge, Claudia Ermel & Gabriele Taentzer (2012): AGG 2.0 — New Features for Specifying and Analyzing Algebraic Graph Transformations. In: Proc. Applications of Graph Transformations with Industrial Relevance (AGTIVE 2011), Lecture Notes in Computer Science 7233. Springer, pp. 81–88, doi:10.1007/978-3-642-34176-2_8.
  18. Robert Sedgewick (1997): Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching, 3rd edition. Addison-Wesley.
  19. Robert Sedgewick (2001): Algorithms in C, Part 5: Graph Algorithms, 3rd edition. Addison-Wesley.
  20. Steven S. Skiena (2008): The Algorithm Design Manual, 2nd edition. Springer, doi:10.1007/978-1-84800-070-4.
  21. Gia Wulandari & Detlef Plump (2020): Verifying Graph Programs with First-Order Logic. In: Graph Computation Models (GCM 2020), Revised Selected Papers, Electronic Proceedings in Theoretical Computer Science This volume.

Comments and questions to:
For website issues: