This map shows the geographic impact of Frank Drewes'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 Frank Drewes with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Frank Drewes more than expected).
This network shows the impact of papers produced by Frank Drewes. 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 Frank Drewes. The network helps show where Frank Drewes may publish in the future.
Co-authorship network of co-authors of Frank Drewes
This figure shows the co-authorship network connecting the top 25 collaborators of Frank Drewes.
A scholar is included among the top collaborators of Frank Drewes 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 Frank Drewes. Frank Drewes is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Drewes, Frank. (2017). On DAG Languages and DAG Transducers. Bulletin of the European Association for Theoretical Computer Science. 121(121). 142–163.3 indexed citations
4.
Bensch, Suna, Frank Drewes, & Thomas Hellström. (2015). Grammatical Inference of Graph Transformation Rules. 73–90.
Berglund, Martin, Henrik Björklund, & Frank Drewes. (2013). On the Parameterized Complexity of Linear Context-Free Rewriting Systems. KTH Publication Database DiVA (KTH Royal Institute of Technology). 21–29.2 indexed citations
7.
Drewes, Frank & Marco Kuhlmann. (2010). Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing. Meeting of the Association for Computational Linguistics.2 indexed citations
8.
Bensch, Suna & Frank Drewes. (2010). Millstream Systems -- a Formal Model for Linking Language Modules by Interfaces. Meeting of the Association for Computational Linguistics. 28–36.3 indexed citations
9.
Drewes, Frank, Berthold Hoffmann, Dirk Janssens, & Mark Minas. (2010). Adaptive star grammars and their languages. Theoretical Computer Science. 411(34-36). 3090–3109.13 indexed citations
10.
Drewes, Frank. (2009). MAT learners for recognizable tree languages and tree series. Acta Cybernetica. 19(2). 249–274.3 indexed citations
11.
Drewes, Frank, et al.. (2005). Random context tree grammars and tree transducers : reviewed article. South African Computer Journal. 2005(34). 11–25.
12.
Drewes, Frank, et al.. (2005). Random Context Tree Grammars and Tree Transducers.. South African Computer Journal. 34. 11–25.
Drewes, Frank, et al.. (2000). Picking Knots from Trees - The Syntactic Structure of Celtic Knotwork. Lecture notes in computer science. 89–104.4 indexed citations
18.
Corradini, Andrea & Frank Drewes. (1997). Cyclic) Term Graph Rewriting is adequate for Rational Parallel Term Rewriting. UnipiEprints Open Archive (Università di Pisa).11 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.