Countries citing papers authored by Martin Sonntag
Since
Specialization
Citations
This map shows the geographic impact of Martin Sonntag'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 Martin Sonntag with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Martin Sonntag more than expected).
This network shows the impact of papers produced by Martin Sonntag. 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 Martin Sonntag. The network helps show where Martin Sonntag may publish in the future.
Co-authorship network of co-authors of Martin Sonntag
This figure shows the co-authorship network connecting the top 25 collaborators of Martin Sonntag.
A scholar is included among the top collaborators of Martin Sonntag 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 Martin Sonntag. Martin Sonntag is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sonntag, Martin & Hanns‐Martin Teichert. (2000). Sum numbers of hypertrees. Discrete Mathematics. 214(1-3). 285–290.8 indexed citations
15.
Sonntag, Martin. (1993). Hamiltonicity of the Disjunction of Two Hypergraphs.. Journal of automata, languages and combinatorics. 29. 193–205.1 indexed citations
16.
Sonntag, Martin. (1991). Hamiltonicity and Traceability of the Lexicographic Product of Hypergraphs.. Journal of automata, languages and combinatorics. 27. 289–301.1 indexed citations
Sonntag, Martin. (1989). Hamiltonian properties of the Cartesian sum of hypergraphs. Journal of automata, languages and combinatorics. 25(3). 87–100.2 indexed citations
19.
Sonntag, Martin, et al.. (1988). Hamiltonian properties of products of graphs and digraphs.1 indexed citations
20.
Sonntag, Martin. (1985). Some Hamiltonian Properties of Products of Digraphs.. Journal of automata, languages and combinatorics. 21. 275–282.1 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.