default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 663 matches
- 2024
- Ziad Ismaili Alaoui, Detlef Plump:
Linear-Time Graph Programs for Unbounded-Degree Graphs. ICGT 2024: 3-20 - Blair Archibald
, Michele Sevegnani:
A Bigraphs Paper of Sorts. ICGT 2024: 21-38 - Richard Banach, John W. Baugh Jr.:
The 'Causality' Quagmire for Formalised Bond Graphs. ICGT 2024: 99-117 - Matthias Barkowsky, Holger Giese:
Localized RETE for Incremental Graph Queries. ICGT 2024: 118-137 - Stefania Dumbrava, Zhao Jin, Burcu Kulahcioglu Ozkan, Jingxuan Qiu:
Checking Transaction Isolation Violations Using Graph Queries. ICGT 2024: 203-213 - Jörg Endrullis, Roy Overbeek:
Generalized Weighted Type Graphs for Termination of Graph Transformation Systems. ICGT 2024: 39-58 - Lars Fritsche, Alexander Lauer, Andy Schürr, Gabriele Taentzer:
Using Application Conditions to Rank Graph Transformations for Graph Repair. ICGT 2024: 138-157 - Mustafa Ghani, Sven Schneider, Maria Maximova, Holger Giese:
Deriving Delay-Robust Timed Graph Transformation System Models. ICGT 2024: 158-179 - Reiko Heckel, Issam Al-Azzoni:
Can I Teach Graph Rewriting to My Chatbot? ICGT 2024: 214-222 - Hans-Jörg Kreowski, Aaron Lye, Aljoscha Windhorst:
Extension and Restriction of Derivations in Adhesive Categories. ICGT 2024: 59-76 - Leen Lambers, Lucas Sakizloglou, Osama Al-Wardi, Taisiya Khakharova:
Taint Analysis for Graph APIs Focusing on Broken Access Control. ICGT 2024: 180-200 - Luidnel Maignan, Antoine Spicher:
Causal Graph Dynamics and Kan Extensions. ICGT 2024: 77-96 - Christopher Stone, András Z. Salamon, Ian Miguel:
A Graph Transformation-Based Engine for the Automated Exploration of Constraint Models. ICGT 2024: 223-238 - Russ Harmer, Jens Kosiol:
Graph Transformation - 17th International Conference, ICGT 2024, Held as Part of STAF 2024, Enschede, The Netherlands, July 10-11, 2024, Proceedings. Lecture Notes in Computer Science 14774, Springer 2024, ISBN 978-3-031-64284-5 [contents] - 2023
- Paolo Baldan, Richard Eggert, Barbara König, Timo Matt, Tommaso Padoan:
A Monoidal View on Fixpoint Checks. ICGT 2023: 3-21 - Richard Banach, John W. Baugh Jr.:
Formalisation, Abstraction and Refinement of Bond Graphs. ICGT 2023: 145-162 - Nicolas Behr, Russ Harmer:
A Living Monograph for Graph Transformation. ICGT 2023: 281-291 - Dominique Duval, Rachid Echahed, Frédéric Prost:
A Rule-Based Procedure for Graph Query Solving. ICGT 2023: 163-183 - Lars Fritsche, Jens Kosiol, Adrian Möller, Andy Schürr:
Advanced Consistency Restoration with Higher-Order Short-Cut Rules. ICGT 2023: 184-203 - Fabio Gadducci, Andrea Laretto, Davide Trotta:
Specification and Verification of a Linear-Time Temporal Logic for Graph Transformation. ICGT 2023: 22-42 - Jens Kosiol, Daniel Strüber, Gabriele Taentzer, Steffen Zschaler:
Finding the Right Way to Rome: Effect-Oriented Graph Transformation. ICGT 2023: 43-63 - Tim Kräuter, Adrian Rutle, Harald König, Yngve Lamo:
Formalization and Analysis of BPMN Using Graph Transformation Systems. ICGT 2023: 204-222 - Hans-Jörg Kreowski, Sabine Kuske, Aaron Lye, Aljoscha Windhorst:
Moving a Derivation Along a Derivation Preserves the Spine. ICGT 2023: 64-80 - Adam Machowczyk, Reiko Heckel:
Graph Rewriting for Graph Neural Networks. ICGT 2023: 292-301 - Roy Overbeek, Jörg Endrullis:
Termination of Graph Transformation Systems Using Weighted Subgraph Counting. ICGT 2023: 81-101 - Jannik Rau, David Richerby, Ansgar Scherp:
Computing k-Bisimulations for Large Graphs: A Comparison and Efficiency Analysis. ICGT 2023: 223-242 - Aloïs Rosset, Roy Overbeek, Jörg Endrullis:
Fuzzy Presheaves are Quasitoposes. ICGT 2023: 102-122 - Jin Sano, Kazunori Ueda:
Implementing the λ GT Language: A Functional Language with Graphs as First-Class Data. ICGT 2023: 263-277 - Robert Söldner, Detlef Plump:
Mechanised DPO Theory: Uniqueness of Derivations and Church-Rosser Theorem. ICGT 2023: 123-142 - Kaiyuan Yang, Li Xia, Y. C. Tay:
Dominant Eigenvalue-Eigenvector Pair Estimation via Graph Infection. ICGT 2023: 243-260
skipping 633 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-11-02 16:12 CET from data curated 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:
