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 34 matches
- 2000
- Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski, Grzegorz Rozenberg:
Theory and Application of Graph Transformations, 6th International Workshop, TAGT'98, Paderborn, Germany, November 16-20, 1998, Selected Papers. Lecture Notes in Computer Science 1764, Springer 2000, ISBN 3-540-67203-6 [contents] - 1998
- Paolo Baldan, Andrea Corradini, Ugo Montanari:
Unfolding of Double-Pushout Graph Grammars is a Coreflection. TAGT 1998: 145-163 - Roswitha Bardohl, Hartmut Ehrig:
Conceptual Model of the Graphical Editor GENGED for the Visual Definition of Visual Languages. TAGT 1998: 252-266 - Paolo Bottoni, Francesco Parisi-Presicce, Marta Simeoni:
From Formulae to Rewriting Systems. TAGT 1998: 267-280 - Giorgio Busatto, Gregor Engels, Katharina Mehner, Annika Wagner:
A Framework for Adding Packages to Graph Transformation Approaches. TAGT 1998: 352-367 - Frank Drewes:
Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars. TAGT 1998: 1-14 - Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
Complexity Issues in Switching of Graphs. TAGT 1998: 59-70 - Hartmut Ehrig, Reiko Heckel, Mercè Llabrés, Fernando Orejas, Julia Padberg, Grzegorz Rozenberg:
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information. TAGT 1998: 85-102 - Joost Engelfriet, Sebastian Maneth:
Tree Languages Generated be Context-Free Graph Grammars. TAGT 1998: 15-29 - Lukas Faulstich:
Using Graph Transformation Techniques for Integrating Information from the WWW. TAGT 1998: 426-441 - Ingrid Fischer, Manuel Koch, Gabriele Taentzer:
Local Views on Distributed Systems and Their Communication. TAGT 1998: 164-178 - Thorsten Fischer, Jörg Niere, Lars Torunski, Albert Zündorf:
Story Diagrams: A New Graph Rewrite Language Based on the Unified Modeling Language and Java. TAGT 1998: 296-309 - Fabio Gadducci, Reiko Heckel, Manuel Koch:
A Fully Abstract Model for Graph-Interpreted Temporal Logic. TAGT 1998: 310-322 - Emmanuel Godard, Yves Métivier, Anca Muscholl:
The Power of Local Computations in Graphs with Initial Knowledge. TAGT 1998: 71-84 - Martin Große-Rhode, Francesco Parisi-Presicce, Marta Simeoni:
Refinements of Graph Transformation Systems via Rule Expressions. TAGT 1998: 368-382 - Annegret Habel, Jürgen Müller, Detlef Plump:
Double-Pushout Approach with Injective Matching. TAGT 1998: 103-116 - Reiko Heckel, Berthold Hoffmann, Peter Knirsch, Sabine Kuske:
Simple Modules for GRACE. TAGT 1998: 383-395 - Curtis E. Hrischuk:
A Model Making Automation Process (MMAP) Using a Graph Grammar Formalism. TAGT 1998: 442-454 - Hélène Jacquet, Renate Klempien-Hinrichs:
Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approach. TAGT 1998: 117-130 - Carl-Arndt Krapp, Sven Krüppel, Ansgar Schleicher, Bernhard Westfechtel:
Graph-Based Models for Managing Development Processes, Resources, and Products. TAGT 1998: 455-474 - Hans-Jörg Kreowski, Gabriel Valiente:
Redundancy and Subsumption in High-Level Replacement Systems. TAGT 1998: 215-227 - Sabine Kuske:
More About Control Conditions for Transformation Units. TAGT 1998: 323-337 - Mercè Llabrés, Francesc Rosselló:
Pushout Complements for Arbitrary Partial Algebras. TAGT 1998: 131-144 - Mark Minas:
Hypergraphs as a Uniform Diagram Representation Model. TAGT 1998: 281-295 - Manfred Münch, Andy Schürr, Andreas J. Winter:
Integrity Constraints in the Multi-paradigm Language PROGRES. TAGT 1998: 338-351 - Julia Padberg, Magdalena Gajewsky, Kathrin Hoffmann:
Incremental Development of Safety Properties in Petri Net Transformations. TAGT 1998: 410-425 - Dorina C. Petriu, Xin Wang:
Deriving Software Performance Models from Architectural Patterns by Graph Transformations. TAGT 1998: 475-488 - John L. Pfaltz:
Neighborhood Expansion Grammars. TAGT 1998: 30-44 - Michael Rudolf:
Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching. TAGT 1998: 238-251 - Andy Schürr, Andreas J. Winter:
UML Packages for PROgrammed Graph REwriting Systems. TAGT 1998: 396-409
skipping 4 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-10-06 20:45 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