Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Fundamentals of Algebraic Graph Transformation
2006374 citationsHartmut Ehrig, Gabriele Taentzer et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Hartmut Ehrig's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hartmut Ehrig with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hartmut Ehrig more than expected).
This network shows the impact of papers produced by Hartmut Ehrig. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hartmut Ehrig. The network helps show where Hartmut Ehrig may publish in the future.
Co-authorship network of co-authors of Hartmut Ehrig
This figure shows the co-authorship network connecting the top 25 collaborators of Hartmut Ehrig.
A scholar is included among the top collaborators of Hartmut Ehrig based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Hartmut Ehrig. Hartmut Ehrig is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hermann, Frank & Hartmut Ehrig. (2008). Process Definition using Subobject Transformation Systems. Open Repository and Bibliography (University of Luxembourg).3 indexed citations
3.
Ehrig, Hartmut, Karsten Ehrig, Claudia Ermel, & Ulrike Prange. (2007). Model Transformations by Graph Transformation are Functors.. Bulletin of the European Association for Theoretical Computer Science. 93. 134–142.1 indexed citations
4.
Padberg, Julia, Hartmut Ehrig, & Kathrin Hoffmann. (2007). Formal Modeling and Analysis of Flexible Processes in Mobile Ad-Hoc Networks.. Bulletin of the European Association for Theoretical Computer Science. 91. 120–124.5 indexed citations
5.
Ehrig, Hartmut. (2006). Report on ACCAT Workshop at ETAPS 2006: Applied and Computational Category Theory.. Bulletin of the European Association for Theoretical Computer Science. 89. 134–135.
6.
Ehrig, Hartmut, Karsten Ehrig, Ulrike Prange, & Gabriele Taentzer. (2006). Fundamental Theory for Typed Attributed Graphs and Graph Transformation based on Adhesive HLR Categories. Fundamenta Informaticae. 74(1). 31–61.37 indexed citations
7.
Ehrig, Hartmut, Julia Padberg, Ulrike Prange, & Annegret Habel. (2006). Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation. Fundamenta Informaticae. 74(1). 1–29.29 indexed citations
Ehrig, Hartmut. (2002). A Review of Algebraic Specification and Component Techniques at TU Berlin.. Bulletin of the European Association for Theoretical Computer Science. 76. 84–87.
10.
Ehrig, Hartmut & Bernd Mahr. (2001). Theory and practice of software development: a review of driving forces and expectations of TAPSOFT from 1985 to 1997. 118–130.1 indexed citations
Ehrig, Hartmut. (2000). On the Role of Formal Specification Techniques: From TAPSOFT 1985 to ETAPS 2000.. Bulletin of the European Association for Theoretical Computer Science. 71. 131–133.1 indexed citations
13.
Ehrig, Hartmut, Alan G. Merten, & Julia Padberg. (1997). How to Transfer Concepts of Abstract Data Types to Petri Nets. Bulletin of the European Association for Theoretical Computer Science. 62.2 indexed citations
14.
Ehrig, Hartmut, et al.. (1991). Amalgamation and Extension in the Framework of Specification Logics and Generalized Morphisms.. Bulletin of the European Association for Theoretical Computer Science. 44. 129–143.
15.
Ehrig, Hartmut, et al.. (1989). Categories for the development of algebraic module specifications. Springer eBooks. 157–184.2 indexed citations
16.
Ehrig, Hartmut. (1989). Categorical concept of constraints for algebraic specifications. Springer eBooks. 1–15.2 indexed citations
17.
Ehrig, Hartmut. (1986). Towards an Algebraic Semantics of the ISO Specification Language LOTOS.. Annals of Telecommunications.2 indexed citations
Ehrig, Hartmut, et al.. (1983). ACT one An algebraic specification language with two levels of semantics. Annals of Telecommunications.40 indexed citations
20.
Ehrig, Hartmut, Hans‐Jörg Kreowski, & Herbert Weber. (1978). Algebraic specification schemes for data base systems. Very Large Data Bases. 427–440.19 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.