Elmar Langetepe
About
In The Last Decade
Elmar Langetepe
26 papers receiving 197 citations
Peers
Comparison fields: 5 of 51
- Computer Graphics and Computer-Aided Design 114
- Computer Networks and Communications 86
- Computer Vision and Pattern Recognition 81
- Signal Processing 37
- Computational Mechanics 30
Countries citing papers authored by Elmar Langetepe
This map shows the geographic impact of Elmar Langetepe'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 Elmar Langetepe with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Elmar Langetepe more than expected).
Fields of papers citing papers by Elmar Langetepe
This network shows the impact of papers produced by Elmar Langetepe. 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 Elmar Langetepe. The network helps show where Elmar Langetepe may publish in the future.
Co-authorship network of co-authors of Elmar Langetepe
This figure shows the co-authorship network connecting the top 25 collaborators of Elmar Langetepe. A scholar is included among the top collaborators of Elmar Langetepe 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 Elmar Langetepe. Elmar Langetepe is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 3 | |
| 3 | 0 | |
| 4 | 31 | |
| 5 | 30 | |
| 6 | On optimizing multi-sequence functionals for competitive analysis. | 3 |
| 7 | 1 | |
| 8 | Finding a door along a wall with an error afflicted robot | 1 |
| 9 | Lower bounds for the polygon exploration problem | 2 |
| 10 | 6 | |
| 11 | 5 | |
| 12 | 13 | |
| 13 | 23 | |
| 14 | On the Competitive Complexity of Navigation Tasks | 5 |
| 15 | 11 | |
| 16 | 13 | |
| 17 | An Optimal Competitive Strategy for Walking in Streets | 1 |
| 18 | Searching for the Kernel of a Polygon: A Competitive Strategy Using Self-Approaching Curves | 5 |
| 19 | Soundness and completeness of a logic programming approach to default logic | 2 |
| 20 | 1 |
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.