Angelika Hellwig
-
- Advanced Graph Theory Research 14
- Complexity and Algorithms in Graphs 3
- Graph Labeling and Dimension Problems 2
-
- Interconnection Networks and Systems 13
- Optimization and Search Problems 1
- Geometry and Topology top 5%
- Graph theory and applications 5
-
- Graphene research and applications 3
-
- Supercapacitor Materials and Fabrication 1
Angelika Hellwig
15 papers receiving 296 citations
Peers
Comparison fields: 5 of 30
- Computational Theory and Mathematics 208
- Computer Networks and Communications 259
- Geometry and Topology 82
- Discrete Mathematics and Combinatorics 8
- Automotive Engineering 17
Countries citing papers authored by Angelika Hellwig
This map shows the geographic impact of Angelika Hellwig'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 Angelika Hellwig with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Angelika Hellwig more than expected).
Fields of papers citing papers by Angelika Hellwig
This network shows the impact of papers produced by Angelika Hellwig. 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 Angelika Hellwig. The network helps show where Angelika Hellwig may publish in the future.
Co-authorship network
The 6 scholars most cited alongside Angelika Hellwig, 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 | 2008 | 40 | |
| 2 | 2008 | 11 | |
| 3 | 2007 | 91 | |
| 4 | 2007 | 4 | |
| 5 | 2006 | 2 | |
| 6 | 2006 | 4 | |
| 7 | 2005 | 17 | |
| 8 | Neighborhood conditions for graphs and digraphs to be maximally edge-connected. | 2005 | 4 |
| 9 | 2005 | 34 | |
| 10 | 2005 | 37 | |
| 11 | 2004 | 38 | |
| 12 | Maximally local-edge-connected graphs and digraphs. | 2004 | 6 |
| 13 | 2004 | 11 | |
| 14 | 2004 | 1 | |
| 15 | Maximally edge-connected digraphs. | 2003 | 6 |
About Angelika Hellwig
Angelika Hellwig is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Computer Networks and Communications, Automotive Engineering and Materials Chemistry, having authored 15 papers that have together received 306 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (14 papers), Interconnection Networks and Systems (13 papers), Graph theory and applications (5 papers), Complexity and Algorithms in Graphs (3 papers), Graphene research and applications (3 papers), Graph Labeling and Dimension Problems (2 papers), Supercapacitor Materials and Fabrication (1 paper) and Optimization and Search Problems (1 paper). The work is most often cited by research in Computational Theory and Mathematics (208 citations), Computer Networks and Communications (259 citations), Geometry and Topology (82 citations), Discrete Mathematics and Combinatorics (8 citations) and Automotive Engineering (17 citations). Angelika Hellwig has collaborated with scholars based in Germany, South Africa and China. Frequent co-authors include Lutz Volkmann, Peter Dankelmann, Jun‐Ming Xu, Min Lü, Dieter Rautenbach and Meijie Ma. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Discrete Applied Mathematics, Results in Mathematics and Information Processing Letters.
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.