Остановите войну!
for scientists:
default search action
Search 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 699 matches
- 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 - Maribel Fernández, Christopher M. Poskitt:
Graph Transformation - 16th International Conference, ICGT 2023, Held as Part of STAF 2023, Leicester, UK, July 19-20, 2023, Proceedings. Lecture Notes in Computer Science 13961, Springer 2023, ISBN 978-3-031-36708-3 [contents] - 2022
- Matthias Barkowsky, Holger Giese:
Towards Development with Multi-version Models: Detecting Merge Conflicts and Checking Well-Formedness. ICGT 2022: 118-136 - Kristopher Brown, Evan Patterson, Tyler Hanks, James P. Fairbanks:
Computational Category-Theoretic Rewriting. ICGT 2022: 155-172 - Frank Drewes, Berthold Hoffmann, Mark Minas:
Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power. ICGT 2022: 3-19 - Reiko Heckel, Andrea Corradini, Fabio Gadducci:
Graph Rewriting Components. ICGT 2022: 20-37 - Reiko Heckel, Zobia Erum, Nitia Rahmi, Albert Pul:
Visual Smart Contracts for DAML. ICGT 2022: 137-154 - Okan Özkan:
Decidability of Resilience for Well-Structured Graph Transformation Systems. ICGT 2022: 38-57 - Sven Schneider, Maria Maximova, Holger Giese:
Probabilistic Metric Temporal Graph Logic. ICGT 2022: 58-76 - Sven Schneider, Maria Maximova, Holger Giese:
Invariant Analysis for Multi-agent Graph Transformation Systems Using k-Induction. ICGT 2022: 173-192 - Gabriele Taentzer, Stefan John, Jens Kosiol:
A Generic Construction for Crossovers of Graph-Like Structures. ICGT 2022: 97-117 - Jens H. Weber:
Tool Support for Functional Graph Rewriting with Persistent Data Structures - GrapeVine. ICGT 2022: 195-206 - Paul W. Wilson, Fabio Zanasi:
Categories of Differentiable Polynomial Circuits for Machine Learning. ICGT 2022: 77-93 - Nicolas Behr, Daniel Strüber:
Graph Transformation - 15th International Conference, ICGT 2022, Held as Part of STAF 2022, Nantes, France, July 7-8, 2022, Proceedings. Lecture Notes in Computer Science 13349, Springer 2022, ISBN 978-3-031-09842-0 [contents] - 2021
- Sven Schneider, Leen Lambers:
Evaluation Diversity for Graph Conditions. ICGT 2021: 122-141
skipping 669 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-06-17 08:57 CEST 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