G. Tinhofer
Impact in
-
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Limits and Structures in Graph Theory 4
- Finite Group Theory Research 3
-
- Advanced Graph Theory Research 15
- Complexity and Algorithms in Graphs 7
- Co-authors
- Joel BernsteinLuitpold BabelHartmut NoltemeierE. MayrMaciej M. SysłoIlia PonomarenkoMikhail MuzychukWinfried Hochstättler
In The Last Decade
G. Tinhofer
29 papers receiving 463 citations
Peers
Comparison fields: 5 of 72
- Discrete Mathematics and Combinatorics 68
- Computational Theory and Mathematics 195
- Physical and Theoretical Chemistry 97
- Geometry and Topology 63
- Inorganic Chemistry 98
Countries citing papers authored by G. Tinhofer
This map shows the geographic impact of G. Tinhofer'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 G. Tinhofer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites G. Tinhofer more than expected).
Fields of papers citing papers by G. Tinhofer
This network shows the impact of papers produced by G. Tinhofer. 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 G. Tinhofer. The network helps show where G. Tinhofer may publish in the future.
Co-authors
The 18 scholars most cited alongside G. Tinhofer, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2000 | 13 | |
| 2 | Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I. Permutation groups and coherent (cellular) algebras. | 1999 | 13 |
| 3 | On a New Class of Weakly Compact Graphs | 1997 | 1 |
| 4 | 1996 | 12 | |
| 5 | Graph-theoretic concepts in computer science : 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994 : proceedings | 1995 | 2 |
| 6 | 1995 | 13 | |
| 7 | 1994 | 4 | |
| 8 | 1991 | 24 | |
| 9 | 1990 | 45 | |
| 10 | 1990 | 34 | |
| 11 | 1988 | 22 | |
| 12 | 1988 | 13 | |
| 13 | Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science | 1986 | 2 |
| 14 | 1986 | 33 | |
| 15 | 1986 | 2 | |
| 16 | 1984 | 3 | |
| 17 | 1984 | 4 | |
| 18 | 1984 | 16 | |
| 19 | 1977 | 1 | |
| 20 | 1971 | 0 |
About G. Tinhofer
G. Tinhofer is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Networks and Communications and Industrial and Manufacturing Engineering, having authored 31 papers that have together received 486 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (15 papers), Complexity and Algorithms in Graphs (7 papers), graph theory and CDMA systems (6 papers), Graph theory and applications (5 papers), Interconnection Networks and Systems (4 papers), Limits and Structures in Graph Theory (4 papers), DNA and Biological Computing (3 papers) and Finite Group Theory Research (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (68 citations), Computational Theory and Mathematics (195 citations), Physical and Theoretical Chemistry (97 citations), Geometry and Topology (63 citations) and Inorganic Chemistry (98 citations). G. Tinhofer has collaborated with scholars based in Germany, Austria and Israel. Frequent co-authors include Joel Bernstein, Luitpold Babel, Hartmut Noltemeier, E. Mayr, Maciej M. Sysło, Ilia Ponomarenko, Mikhail Muzychuk, Winfried Hochstättler, Сергей Евдокимов and Oliver Bastert. Their work appears in journals such as Computing, Discrete Applied Mathematics, The Electronic Journal of Combinatorics, Crystallography Reviews and Applied Mathematics and Computation.
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.