Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDH. J. Sander Bruggink
Person information
- affiliation: University of Duisburg-Essen, Department of Computer Science and Applied Cognitive Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j8]H. J. Sander Bruggink, Barbara König:
Recognizable languages of arrows and cospans. Math. Struct. Comput. Sci. 28(8): 1290-1332 (2018)- 2015
- [j7]H. J. Sander Bruggink, Barbara König, Sebastian Küpper:
Robustness and closure properties of recognizable languages in adhesive categories. Sci. Comput. Program. 104: 71-98 (2015) - 2013
- [j6]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) - [j5]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): 192-206 (2013) - 2012
- [j4]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) - 2011
- [j3]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) - [j2]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) - 2010
- [j1]Christoph Blume, H. J. Sander Bruggink, Barbara König:
Recognizable Graph Languages for Checking Invariants. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 29 (2010)
Conference and Workshop Papers
- 2020
- [c12]H. J. Sander Bruggink, Barbara König
, Marleen Matjeka, Dennis Nolte, Lara Stoltenow:
A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java. ICGT 2020: 297-306 - 2015
- [c11]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: 52-68 - 2014
- [c10]H. J. Sander Bruggink:
Towards Process Mining with Graph Transformation Systems. ICGT 2014: 253-268 - [c9]H. J. Sander Bruggink, Barbara König, Hans Zantema:
Termination Analysis for Graph Transformation Systems. IFIP TCS 2014: 179-194 - [c8]Hans Zantema, Barbara König, H. J. Sander Bruggink:
Termination of Cycle Rewriting. RTA-TLCA 2014: 476-490 - 2012
- [c7]Christoph Blume, H. J. Sander Bruggink, Dominik Engelke, Barbara König:
Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking. ICGT 2012: 264-278 - 2011
- [c6]H. J. Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, Barbara König:
Conditional Reactive Systems. FSTTCS 2011: 191-203 - 2010
- [c5]H. J. Sander Bruggink, Barbara König:
A Logic on Subobjects and Recognizability. IFIP TCS 2010: 197-212 - 2008
- [c4]H. J. Sander Bruggink, Barbara König:
On the Recognizability of Arrow and Graph Languages. ICGT 2008: 336-350 - 2007
- [c3]H. J. Sander Bruggink:
Towards a Systematic Method for Proving Termination of Graph Transformation Systems. GT-VC@CONCUR 2007: 23-38 - 2006
- [c2]H. J. Sander Bruggink:
A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property. RTA 2006: 372-386 - 2003
- [c1]H. J. Sander Bruggink:
Residuals in Higher-Order Rewriting. RTA 2003: 123-137
Informal and Other Publications
- 2015
- [i1]H. J. Sander Bruggink, Barbara König, Dennis Nolte, Hans Zantema:
Proving Termination of Graph Transformation Systems using Weighted Type Graphs over Semirings. CoRR abs/1505.01695 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 04:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
