H. J. Sander Bruggink

21 papers B 5Journal 9Unranked 7

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