Jungle Evaluation for Efficient Term Rewriting. - Berthold Hoffmann; Detlef Plump (ALP, 1988)

Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems. - Detlef Plump (CTRS, 1990)

Graph-Reducible Term Rewriting Systems. - Detlef Plump (Graph-Grammars and Their Application to Computer Science, 1990)

Jungle evaluation. - Annegret Habel; Hans-Jörg Kreowski; Detlef Plump (Fundam. Informaticae, 1991)

Implementing term rewriting by jungle evaluation. - Berthold Hoffmann; Detlef Plump (RAIRO Theor. Informatics Appl., 1991)

Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. - Detlef Plump (CTRS, 1992)

Evaluation of functional expressions by hypergraph rewriting. - Detlef Plump (1993)

Critical Pairs in Term Graph Rewriting. - Detlef Plump (MFCS, 1994)

Graph Unification and Matching. - Detlef Plump; Annegret Habel (TAGT, 1994)

On Termination of Graph Rewriting. - Detlef Plump (WG, 1995)

Unification, rewriting, and narrowing on term graphs. - Annegret Habel; Detlef Plump (SEGRAGRA, 1995)

Term Graph Narrowing. - Annegret Habel; Detlef Plump (Math. Struct. Comput. Sci., 1996)

Simplification Orders for Term Graph Rewriting. - Detlef Plump (MFCS, 1997)

Confluent rewriting of bisimilar term graphs. - Zena M. Ariola; Jan Willem Klop; Detlef Plump (EXPRESS, 1997)

Double-Pushout Approach with Injective Matching. - Annegret Habel; Jürgen Müller; Detlef Plump (TAGT, 1998)

Complete Strategies for Term Graph Narrowing. - Annegret Habel; Detlef Plump (WADT, 1998)

Termination of Graph Rewriting is Undecidable. - Detlef Plump (Fundam. Informaticae, 1998)

Graph Transformation for Specification and Programming. - Marc Andries; Gregor Engels; Annegret Habel; Berthold Hoffmann; Hans-Jörg Kreowski; Sabine Kuske; Detlef Plump; Andy Schürr; Gabriele Taentzer (Sci. Comput. Program., 1999)

Bisimilarity in Term Graph Rewriting. - Zena M. Ariola; Jan Willem Klop; Detlef Plump (Inf. Comput., 2000)

Computational Completeness of Programming Languages Based on Graph Transformation. - Annegret Habel; Detlef Plump (FoSSaCS, 2001)

Solving Equations by Graph Transformation. - Annegret Habel; Detlef Plump (GETGRATS Closing Workshop, 2001)

Essentials of Term Graph Rewriting. - Detlef Plump (GETGRATS Closing Workshop, 2001)

Double-pushout graph transformation revisited. - Annegret Habel; Jürgen Müller; Detlef Plump (Math. Struct. Comput. Sci., 2001)

Relabelling in Graph Transformation. - Annegret Habel; Detlef Plump (ICGT, 2002)

TERMGRAPH 2002 - Workshop Survey. - Detlef Plump (ICGT, 2002)

Preface. - Ian Mackie; Detlef Plump (TERMGRAPH, 2002)

Hierarchical Graph Transformation. - Frank Drewes; Berthold Hoffmann; Detlef Plump (J. Comput. Syst. Sci., 2002)

Checking the Shape Safety of Pointer Manipulations. - Adam Bakewell; Detlef Plump; Colin Runciman (RelMiCS, 2003)

Specifying Pointer Structures by Graph Reduction. - Adam Bakewell; Detlef Plump; Colin Runciman (AGTIVE, 2003)

Diagrams for Meaning Preservation. - J. B. Wells; Detlef Plump; Fairouz Kamareddine (RTA, 2003)

Towards Graph Programs for Graph Algorithms. - Detlef Plump; Sandra Steinert (ICGT, 2004)

Confluence of Graph Transformation Revisited. - Detlef Plump (Processes, Terms and Cycles, 2005)

Extending C for Checking Shape Safety. - Mike Dodds; Detlef Plump (GT-VC@CONCUR, 2005)

Graph Transformation in Constant Time. - Mike Dodds; Detlef Plump (ICGT, 2006)

The York Abstract Machine. - Greg Manning; Detlef Plump (GT-VMT@ETAPS, 2006)

Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools. - Gabriele Taentzer; Enrico Biermann; Dénes Bisztray; Bernd Bohnet; Iovka Boneva; Artur Boronat; Leif Geiger; Rubino Geiß; Ákos Horváth 001; Ole Kniemeyer; Tom Mens; Benjamin Ness; et al. (AGTIVE, 2007)

Theory and applications of term graph rewriting: introduction. - Ian Mackie; Detlef Plump (Math. Struct. Comput. Sci., 2007)

From Hyperedge Replacement to Separation Logic and Back. - Mike Dodds; Detlef Plump (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2008)

The GP Programming System. - Greg Manning; Detlef Plump (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2008)

The Graph Programming Language GP. - Detlef Plump (CAI, 2009)

The Semantics of Graph Programs - Detlef Plump; Sandra Steinert (RULE, 2009)

A Hoare Calculus for Graph Programs. - Christopher M. Poskitt; Detlef Plump (ICGT, 2010)

Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. - Frank Drewes; Annegret Habel; Berthold Hoffmann; Detlef Plump (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Checking Graph-Transformation Systems for Confluence. - Detlef Plump (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

The Design of GP 2 - Detlef Plump (WRS, 2011)

Minimizing Finite Automata with Graph Programs. - Detlef Plump; Robin Suri; Ambuj Singh (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

$ mathcal M, mathcal N$ -Adhesive Transformation Systems. - Annegret Habel; Detlef Plump (ICGT, 2012)

Rooted Graph Programs. - Detlef Plump; Christopher Bak (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012)

Hoare-Style Verification of Graph Programs. - Christopher M. Poskitt; Detlef Plump (Fundam. Informaticae, 2012)

Verifying Total Correctness of Graph Programs. - Christopher M. Poskitt; Detlef Plump (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013)

Verifying Monadic Second-Order Properties of Graph Programs. - Christopher M. Poskitt; Detlef Plump (ICGT, 2014)

A Unification Algorithm for GP 2. - Ivaylo Hristakiev; Detlef Plump (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014)

A Reference Interpreter for the Graph Programming Language GP 2. - Christopher Bak; Glyn Faulkner; Detlef Plump; Colin Runciman (GaM, 2015)

Preface. - Detlef Plump (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2015)

Compiling Graph Programs to C. - Christopher Bak; Detlef Plump (ICGT, 2016)

Attributed Graph Transformation via Rule Schemata: Church-Rosser Theorem. - Ivaylo Hristakiev; Detlef Plump (STAF Workshops, 2016)

Towards Critical Pair Analysis for the Graph Programming Language GP 2. - Ivaylo Hristakiev; Detlef Plump (WADT, 2016)

Reasoning about Graph Programs. - Detlef Plump (TERMGRAPH, 2016)

Checking Graph Programs for Confluence. - Ivaylo Hristakiev; Detlef Plump (STAF Workshops, 2017)

A Unification Algorithm for GP 2 (Long Version). - Ivaylo Hristakiev; Detlef Plump (CoRR, 2017)

From imperative to rule-based graph programs. - Detlef Plump (J. Log. Algebraic Methods Program., 2017)

Modular Termination of Graph Transformation. - Detlef Plump (Graph Transformation, Specifications, and Nets, 2018)

Evolving Graphs by Graph Programming. - Timothy Atkinson 001; Detlef Plump; Susan Stepney (EuroGP, 2018)

Probabilistic Graph Programs for Randomised and Evolutionary Algorithms. - Timothy Atkinson 001; Detlef Plump; Susan Stepney (ICGT, 2018)

Verifying a Copying Garbage Collector in GP 2. - Gia Septiana Wulandari; Detlef Plump (STAF Workshops, 2018)

Semantic Neutral Drift. - Timothy Atkinson 001; Detlef Plump; Susan Stepney (CoRR, 2018)

Linear-Time Graph Algorithms in GP 2. - Graham Campbell 001; Brian Courtehoute; Detlef Plump (CALCO, 2019)

Evolving graphs with horizontal gene transfer. - Timothy Atkinson 001; Detlef Plump; Susan Stepney (GECCO, 2019)

Efficient Recognition of Graph Languages. - Graham Campbell 001; Detlef Plump (CoRR, 2019)

Preface to the special issue on the 10th International Conference on Graph Transformation. - Detlef Plump; Juan de Lara (J. Log. Algebraic Methods Program., 2019)

Confluence up to Garbage. - Graham Campbell 001; Detlef Plump (ICGT, 2020)

Improving the GP 2 Compiler. - Graham Campbell 001; Jack Romo; Detlef Plump (CoRR, 2020)

The Improved GP 2 Compiler. - Graham Campbell 001; Jack Romo; Detlef Plump (CoRR, 2020)

Verifying Graph Programs with First-Order Logic (Extended Version). - Gia Septiana Wulandari; Detlef Plump (CoRR, 2020)

Verifying Graph Programs with First-Order Logic. - Gia Septiana Wulandari; Detlef Plump (GCM@STAF, 2020)

A Fast Graph Program for Computing Minimum Spanning Trees. - Brian Courtehoute; Detlef Plump (GCM@STAF, 2020)

Horizontal gene transfer for recombining graphs. - Timothy Atkinson 001; Detlef Plump; Susan Stepney (Genet. Program. Evolvable Mach., 2020)

Verifying Graph Programs with Monadic Second-Order Logic. - Gia Septiana Wulandari; Detlef Plump (ICGT, 2021)

A Small-Step Operational Semantics for GP 2. - Brian Courtehoute; Detlef Plump (GCM@STAF, 2021)

Evolving graphs with semantic neutral drift. - Timothy Atkinson 001; Detlef Plump; Susan Stepney (Nat. Comput., 2021)

Confluence up to garbage in graph transformation. - Graham Campbell 001; Detlef Plump (Theor. Comput. Sci., 2021)

Towards Mechanised Proofs in Double-Pushout Graph Transformation. - Robert Söldner; Detlef Plump (GCM@STAF, 2022)

Time and Space Measures for a Complete Graph Computation Model. - Brian Courtehoute; Detlef Plump (GCM@STAF, 2022)

Fast rule-based graph programs. - Graham Campbell 001; Brian Courtehoute; Detlef Plump (Sci. Comput. Program., 2022)

Mechanised DPO Theory: Uniqueness of Derivations and Church-Rosser Theorem. - Robert Söldner; Detlef Plump (ICGT, 2023)

Random Graph Generation in Context-Free Graph Languages. - Federico Vastarini; Detlef Plump (DCM, 2023)

Monadic second-order incorrectness logic for GP 2. - Christopher M. Poskitt; Detlef Plump (J. Log. Algebraic Methods Program., 2023)

Linear-Time Graph Programs for Unbounded-Degree Graphs. - Ziad Ismaili Alaoui; Detlef Plump (ICGT, 2024)

Formalising the Double-Pushout Approach to Graph Transformation. - Robert Söldner; Detlef Plump (Log. Methods Comput. Sci., 2024)

Linear-Time Graph Programs without Preconditions. - Ziad Ismaili Alaoui; Detlef Plump (GCM, 2024)

Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms. - Ziad Ismaili Alaoui; Detlef Plump (CoRR, 2025)