H. J. Sander Bruggink

Publication Activity (10 Years)

Years Active: 2003-2020
Publications (10 Years): 5

Top Topics

Conjunctive Queries

Closure Properties

Graph Transformation

Top Venues

Electron. Commun. Eur. Assoc. Softw. Sci. Technol.

Math. Struct. Comput. Sci.

Publications

H. J. Sander Bruggink, Barbara König, Marleen Matjeka, Dennis Nolte, Lars Stoltenow
A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java. ICGT (2020)
H. J. Sander Bruggink, Barbara König
Recognizable languages of arrows and cospans. Math. Struct. Comput. Sci. 28 (8) (2018)
H. J. Sander Bruggink, Barbara König, Sebastian Küpper
Robustness and closure properties of recognizable languages in adhesive categories. Sci. Comput. Program. 104 (2015)
H. J. Sander Bruggink, Barbara König, Dennis Nolte, Hans Zantema
Proving Termination of Graph Transformation Systems using Weighted Type Graphs over Semirings. CoRR (2015)
H. J. Sander Bruggink, Barbara König, Dennis Nolte, Hans Zantema
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings. ICGT (2015)
H. J. Sander Bruggink
Towards Process Mining with Graph Transformation Systems. ICGT (2014)
H. J. Sander Bruggink, Barbara König, Hans Zantema
Termination Analysis for Graph Transformation Systems. IFIP TCS (2014)
Hans Zantema, Barbara König, H. J. Sander Bruggink
Termination of Cycle Rewriting. RTA-TLCA (2014)
Sebastian Küpper, Barbara König, H. J. Sander Bruggink
Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 58 (2013)
Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara König
Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. J. Vis. Lang. Comput. 24 (3) (2013)
Christoph Blume, H. J. Sander Bruggink, Dominik Engelke, Barbara König
Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking. ICGT (2012)
H. J. Sander Bruggink, Mathias Hülsbusch, Barbara König
Towards Alternating Automata for Graph Languages. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 47 (2012)
H. J. Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, Barbara König
Conditional Reactive Systems. FSTTCS (2011)
Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara König
Treewidth, Pathwidth and Cospan Decompositions. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 41 (2011)
H. J. Sander Bruggink, Mathias Hülsbusch
Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 41 (2011)
H. J. Sander Bruggink, Barbara König
A Logic on Subobjects and Recognizability. IFIP TCS (2010)
Christoph Blume, H. J. Sander Bruggink, Barbara König
Recognizable Graph Languages for Checking Invariants. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 29 (2010)
H. J. Sander Bruggink
Towards a Systematic Method for Proving Termination of Graph Transformation Systems. Electron. Notes Theor. Comput. Sci. 213 (1) (2008)
H. J. Sander Bruggink, Barbara König
On the Recognizability of Arrow and Graph Languages. ICGT (2008)
H. J. Sander Bruggink
A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property. RTA (2006)
H. J. Sander Bruggink
Residuals in Higher-Order Rewriting. RTA (2003)