H. J. Sander Bruggink

According to our database, H. J. Sander Bruggink authored at least 20 papers between 2003 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java.

H. J. Sander Bruggink, Barbara König, Marleen Matjeka, Dennis Nolte, Lara Stoltenow

Proceedings of the Graph Transformation - 13th International Conference, 2020

2018

Recognizable languages of arrows and cospans.

H. J. Sander Bruggink, Barbara König

Math. Struct. Comput. Sci., 2018

2015

Robustness and closure properties of recognizable languages in adhesive categories.

H. J. Sander Bruggink, Barbara König, Sebastian Küpper

Sci. Comput. Program., 2015

Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings.

H. J. Sander Bruggink, Barbara König, Dennis Nolte, Hans Zantema

Proceedings of the Graph Transformation - 8th International Conference, 2015

2014

Termination of Cycle Rewriting.

Hans Zantema, Barbara König, H. J. Sander Bruggink

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Termination Analysis for Graph Transformation Systems.

H. J. Sander Bruggink, Barbara König, Hans Zantema

Proceedings of the Theoretical Computer Science, 2014

Towards Process Mining with Graph Transformation Systems.

H. J. Sander Bruggink

Proceedings of the Graph Transformation - 7th International Conference, 2014

2013

Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata.

Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara König

J. Vis. Lang. Comput., 2013

Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories.

Sebastian Küpper, Barbara König, H. J. Sander Bruggink

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

2012

Towards Alternating Automata for Graph Languages.

H. J. Sander Bruggink, Mathias Hülsbusch, Barbara König

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

Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking.

Christoph Blume, H. J. Sander Bruggink, Dominik Engelke, Barbara König

Proceedings of the Graph Transformations - 6th International Conference, 2012

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

Treewidth, Pathwidth and Cospan Decompositions.

Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara König

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

Conditional Reactive Systems.

H. J. Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, Barbara König

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Recognizable Graph Languages for Checking Invariants.

Christoph Blume, H. J. Sander Bruggink, Barbara König

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

A Logic on Subobjects and Recognizability.

H. J. Sander Bruggink, Barbara König

Proceedings of the Theoretical Computer Science, 2010

2008

On the Recognizability of Arrow and Graph Languages.

H. J. Sander Bruggink, Barbara König

Proceedings of the Graph Transformations, 4th International Conference, 2008

2007

Towards a Systematic Method for Proving Termination of Graph Transformation Systems.

H. J. Sander Bruggink

Proceedings of the Third Workshop on Graph Transformation for Concurrency and Verification, 2007

2006

A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.

H. J. Sander Bruggink

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2003

Residuals in Higher-Order Rewriting.

H. J. Sander Bruggink

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003