Residuals in Higher-Order Rewriting. - H. J. Sander Bruggink (RTA, 2003)

A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property. - H. J. Sander Bruggink (RTA, 2006)

Towards a Systematic Method for Proving Termination of Graph Transformation Systems. - H. J. Sander Bruggink (GT-VC@CONCUR, 2007)

On the Recognizability of Arrow and Graph Languages. - H. J. Sander Bruggink; Barbara König 001 (ICGT, 2008)

A Logic on Subobjects and Recognizability. - H. J. Sander Bruggink; Barbara König 001 (IFIP TCS, 2010)

Recognizable Graph Languages for Checking Invariants. - Christoph Blume; H. J. Sander Bruggink; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Conditional Reactive Systems. - H. J. Sander Bruggink; Raphaël Cauderlier; Mathias Hülsbusch; Barbara König 001 (FSTTCS, 2011)

Treewidth, Pathwidth and Cospan Decompositions. - Christoph Blume; H. J. Sander Bruggink; Martin Friedrich; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages. - H. J. Sander Bruggink; Mathias Hülsbusch (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking. - Christoph Blume; H. J. Sander Bruggink; Dominik Engelke; Barbara König 001 (ICGT, 2012)

Towards Alternating Automata for Graph Languages. - H. J. Sander Bruggink; Mathias Hülsbusch; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012)

Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories. - Sebastian Küpper; Barbara König 001; H. J. Sander Bruggink (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013)

Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. - Christoph Blume; H. J. Sander Bruggink; Martin Friedrich; Barbara König 001 (J. Vis. Lang. Comput., 2013)

Towards Process Mining with Graph Transformation Systems. - H. J. Sander Bruggink (ICGT, 2014)

Termination Analysis for Graph Transformation Systems. - H. J. Sander Bruggink; Barbara König 001; Hans Zantema (IFIP TCS, 2014)

Termination of Cycle Rewriting. - Hans Zantema; Barbara König 001; H. J. Sander Bruggink (RTA-TLCA, 2014)

Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings. - H. J. Sander Bruggink; Barbara König 001; Dennis Nolte; Hans Zantema (ICGT, 2015)

Robustness and closure properties of recognizable languages in adhesive categories. - H. J. Sander Bruggink; Barbara König 001; Sebastian Küpper (Sci. Comput. Program., 2015)

Recognizable languages of arrows and cospans. - H. J. Sander Bruggink; Barbara König 001 (Math. Struct. Comput. Sci., 2018)

A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java. - H. J. Sander Bruggink; Barbara König 001; Marleen Matjeka; Dennis Nolte; Lara Stoltenow (ICGT, 2020)