Papers can be submitted at using Springer's LNCS format (, and should contain original research. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. All submissions will be peer reviewed by the members of the Programme Committee and external subreviewers. Proceedings will be published by Springer in the LNCS series and a special issue of the Journal of Logic and Algebraic Methods in Programming (Elsevier) will be devoted to extended versions of the best ICGT’18 papers.

Papers are solicited in three categories:

  • Research papers (15 pages max) are evaluated w.r.t. originality, significance, and technical soundness. Theoretical papers should include a motivation and examples illustrating the theoretical contribution. Application papers should contain a case study and evaluation. Additional material intended for reviewers may be included in a clearly marked appendix.
  • Tool presentation papers (5 pages max) demonstrate main new features and functionality of graph-based tools. These papers may have an appendix with a detailed demo description (up to 5 pages), which will be reviewed but not included in the proceedings.
  • New ideas papers (5 pages max) describe initial reflections on the establishment of connections of graph transformation with a new area. They are evaluated w.r.t. innovation, potential for success as well as value for the ICGT research community.


In order to foster a lively exchange of perspectives on the subject of the conference, the programme committee of ICGT 2018 encourages all kinds of contributions related to graph transformation, either from a theoretical, or from a practical point of view.

Topics of interest include, but are not limited to:

  • General models of graph transformation (e.g., high-level, adhesive, node, edge, and hyperedge replacement systems)
  • Analysis and verification of graph transformation systems
  • Graph theoretical properties of graph languages
  • Automata on graphs and parsing of graph languages
  • Logical aspects of graph transformation
  • Computational models based on graph transformation
  • Structuring and modularization of graph transformation
  • Hierarchical graphs and decompositions of graphs
  • Parallel, concurrent, and distributed graph transformation
  • Term graph rewriting
  • Graph transformation and Petri nets
  • Model-driven development and model transformation
  • Model checking, program verification, simulation and animation
  • Syntax, semantics and implementation of programming languages, domain-specific languages, and visual languages
  • Graph transformation languages and tool support
  • Efficient algorithms (pattern matching, graph traversal, etc.)
  • Applications in software engineering, including software architectures, refactoring, business processes, access control and service-orientation
  • Applications to computing paradigms such as bio-inspired, quantum, ubiquitous, and visual computing