On context-free gragh languages generated by edge replacement. - Annegret Habel; Hans-Jörg Kreowski (Graph-Grammars and Their Application to Computer Science, 1982)

Concurrent Transformations of Graphs and Relational Structures. - Hartmut Ehrig; Annegret Habel (WG, 1983)

Amalgamation of Graph Transformations with Applications to Synchronization. - Paul Boehm; Harald-Reto Fonio; Annegret Habel (TAPSOFT, Vol.1, 1985)

May we introduce to you: hyperedge replacement. - Annegret Habel; Hans-Jörg Kreowski (Graph-Grammars and Their Application to Computer Science, 1986)

Towards algebraic data types grammars: a junction between algebraic specification and graph grammars. - Hartmut Ehrig; Annegret Habel; Udo Hummert; Paul Boehm (Bull. EATCS, 1986)

Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement. - Annegret Habel; Hans-Jörg Kreowski (STACS, 1987)

Pretty Patterns Produced by Hyperedge Replacement. - Annegret Habel; Hans-Jörg Kreowski (WG, 1987)

Complativle graph properties are decidable for hypergraph replacement graph languages. - Annegret Habel; Hans-Jörg Kreowski; Walter Vogler (Bull. EATCS, 1987)

Amalgamation of Graph Transformations: A Synchronization Mechanism. - Paul Boehm; Harald-Reto Fonio; Annegret Habel (J. Comput. Syst. Sci., 1987)

Characteristics of Graph Languages Generated by Edge Replacement. - Annegret Habel; Hans-Jörg Kreowski (Theor. Comput. Sci., 1987)

Graph-Theoretic Properties Compatible with Graph Derivations. - Annegret Habel (WG, 1988)

Hyperedge replacement - grammars and languages. - Annegret Habel (1989)

Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. - Annegret Habel; Hans-Jörg Kreowski; Walter Vogler (TAPSOFT, Vol.1, 1989)

Filtering Hyperedge-Replacement Through Compatible Properties. - Annegret Habel; Hans-Jörg Kreowski (WG, 1989)

Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages. - Annegret Habel; Hans-Jörg Kreowski; Walter Vogler (Acta Informatica, 1989)

From Graph Grammars to High Level Replacement Systems. - Hartmut Ehrig; Annegret Habel; Hans-Jörg Kreowski; Francesco Parisi-Presicce (Graph-Grammars and Their Application to Computer Science, 1990)

Collage Grammars. - Annegret Habel; Hans-Jörg Kreowski (Graph-Grammars and Their Application to Computer Science, 1990)

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

Parallelism and Concurrency in High-Level Replacement Systems. - Hartmut Ehrig; Annegret Habel; Hans-Jörg Kreowski; Francesco Parisi-Presicce (Math. Struct. Comput. Sci., 1991)

Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. - Annegret Habel; Hans-Jörg Kreowski; Walter Vogler (Theor. Comput. Sci., 1991)

Hyperedge Replacement: Grammars and Languages - Annegret Habel (Springer, 1992)

Hypergraph Grammars: Transformational and Algorithmic Aspects. - Annegret Habel (J. Inf. Process. Cybern., 1992)

A scetch of Collage Grammars. - Frank Drewes; Annegret Habel; Hans-Jörg Kreowski; Stefan Taubenberger (Bull. EATCS, 1993)

A Comparison of Compatible, Finite, and Inductive Graph Properties. - Annegret Habel; Hans-Jörg Kreowski; Clemens Lautemann (Theor. Comput. Sci., 1993)

Chain-Code Pictures and Collages Generated by Hyperedge Replacement. - Jürgen Dassow; Annegret Habel; Stefan Taubenberger (TAGT, 1994)

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

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

Generating Self-Affine Fractals by Collage Grammars. - Frank Drewes; Annegret Habel; Hans-Jörg Kreowski; Stefan Taubenberger (Theor. Comput. Sci., 1995)

Graph Grammars with Negative Application Conditions. - Annegret Habel; Reiko Heckel; Gabriele Taentzer (Fundam. Informaticae, 1996)

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

Hyperedge Replacement, Graph Grammars. - Frank Drewes; Hans-Jörg Kreowski; Annegret Habel (Handbook of Graph Grammars, 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)

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)

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

Basic Results for Two Types of High-Level Replacement Systems. - Hartmut Ehrig; Annegret Habel; Francesco Parisi-Presicce (GETGRATS Closing Workshop, 2001)

Solving Equations by Graph Transformation. - Annegret Habel; 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)

Constraints and Application Conditions: From Graphs to High-Level Structures. - Hartmut Ehrig; Karsten Ehrig; Annegret Habel; Karl-Heinz Pennemann (ICGT, 2004)

Adhesive High-Level Replacement Categories and Systems. - Hartmut Ehrig; Annegret Habel; Julia Padberg; Ulrike Prange (ICGT, 2004)

Parallel Independence in Hierarchical Graph Transformation. - Annegret Habel; Berthold Hoffmann (ICGT, 2004)

Nested Constraints and Application Conditions for High-Level Structures. - Annegret Habel; Karl-Heinz Pennemann (Formal Methods in Software and Systems Modeling, 2005)

Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars. - Ralf H. Reussner; Jens Happe; Annegret Habel (FASE, 2005)

Satisfiability of High-Level Conditions. - Annegret Habel; Karl-Heinz Pennemann (ICGT, 2006)

Weakest Preconditions for High-Level Programs. - Annegret Habel; Karl-Heinz Pennemann; Arend Rensink (ICGT, 2006)

ENFORCe: A System for Ensuring Formal Correctness of High-level Programs. - Karl Azab; Annegret Habel; Karl-Heinz Pennemann; Christian Zuckschwerdt (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2006)

Theory of Constraints and Application Conditions: From Graphs to High-Level Structures. - Hartmut Ehrig; Karsten Ehrig; Annegret Habel; Karl-Heinz Pennemann (Fundam. Informaticae, 2006)

Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation. - Hartmut Ehrig; Julia Padberg; Ulrike Prange; Annegret Habel (Fundam. Informaticae, 2006)

High-Level Programs and Program Conditions. - Karl Azab; Annegret Habel (ICGT, 2008)

Workshop on Graph Computation Models. - Mohamed Mosbah 001; Annegret Habel (ICGT, 2008)

Correctness of high-level transformation systems relative to nested conditions. - Annegret Habel; Karl-Heinz Pennemann (Math. Struct. Comput. Sci., 2009)

Local Confluence for Rules with Nested Application Conditions. - Hartmut Ehrig; Annegret Habel; Leen Lambers; Fernando Orejas; Ulrike Golas (ICGT, 2010)

Multi-Amalgamation in Adhesive Categories. - Ulrike Golas; Hartmut Ehrig; Annegret Habel (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)

Parallelism and Concurrency Theorems for Rules with Nested Application Conditions. - Hartmut Ehrig; Annegret Habel; Leen Lambers (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Expressiveness of graph conditions with variables. - Annegret Habel; Hendrik Radke (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Graph Computation Models. - Rachid Echahed; Annegret Habel; Mohamed Mosbah 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

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

ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence. - Hartmut Ehrig; Ulrike Golas; Annegret Habel; Leen Lambers; Fernando Orejas (Fundam. Informaticae, 2012)

Graph Computation Models 2012. - Rachid Echahed; Annegret Habel; Mohamed Mosbah 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013)

From Core OCL Invariants to Nested Graph Constraints. - Thorsten Arendt; Annegret Habel; Hendrik Radke; Gabriele Taentzer (ICGT, 2014)

Preface. - Rachid Echahed; Annegret Habel; Mohamed Mosbah 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014)

ℳ-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation. - Hartmut Ehrig; Ulrike Golas; Annegret Habel; Leen Lambers; Fernando Orejas (Math. Struct. Comput. Sci., 2014)

Multi-amalgamation of rules with application conditions in ℳ-adhesive categories. - Ulrike Golas; Annegret Habel; Hartmut Ehrig (Math. Struct. Comput. Sci., 2014)

Attribution of Graphs by Composition of M, N-adhesive Categories. - Christoph Peuser; Annegret Habel (GCM@ICGT, 2015)

Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations. - Hendrik Radke; Thorsten Arendt; Jan Steffen Becker; Annegret Habel; Gabriele Taentzer (ICGT, 2015)

Composition of M, N-adhesive Categories with Application to Attribution of Graphs. - Christoph Peuser; Annegret Habel (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2015)

Integration of Graph Constraints into Graph Grammars. - Annegret Habel; Christian Sandmann; Tilman Teusch (Graph Transformation, Specifications, and Nets, 2018)

Graph Repair by Graph Programs. - Annegret Habel; Christian Sandmann (STAF Workshops, 2018)

Translating essential OCL invariants to nested graph constraints for generating instances of meta-models. - Hendrik Radke; Thorsten Arendt; Jan Steffen Becker; Annegret Habel; Gabriele Taentzer (Sci. Comput. Program., 2018)

Rule-based Graph Repair. - Christian Sandmann; Annegret Habel (GCM@STAF, 2019)