Burkhard Monien
About
In The Last Decade
Burkhard Monien
111 papers receiving 1.7k citations
Peers
Comparison fields: 5 of 83
- Computer Networks and Communications 926
- Computational Theory and Mathematics 723
- Artificial Intelligence 365
- Electrical and Electronic Engineering 287
- Management Science and Operations Research 276
Countries citing papers authored by Burkhard Monien
This map shows the geographic impact of Burkhard Monien'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 Burkhard Monien with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Burkhard Monien more than expected).
Fields of papers citing papers by Burkhard Monien
This network shows the impact of papers produced by Burkhard Monien. 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 Burkhard Monien. The network helps show where Burkhard Monien may publish in the future.
Co-authorship network of co-authors of Burkhard Monien
This figure shows the co-authorship network connecting the top 25 collaborators of Burkhard Monien. A scholar is included among the top collaborators of Burkhard Monien 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 Burkhard Monien. Burkhard Monien is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 6 | |
| 2 | 32 | |
| 3 | 7 | |
| 4 | 16 | |
| 5 | 21 | |
| 6 | 10 | |
| 7 | 10 | |
| 8 | High Performance Computing - HiPC 2001 : 8th International Conference, Hyderabad, India, December 17-20, 2001 : proceedings | 1 |
| 9 | A Distributed Algorithm to Evaluate Quantified Boolean Formulae | 33 |
| 10 | A Local Graph Partitioning Heuristic Meeting Bisection Bounds. | 11 |
| 11 | Parallel architectures and their efficient use : First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992 : proceedings | 6 |
| 12 | Proceedings of the 18th International Colloquium on Automata, Languages and Programming | 12 |
| 13 | Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract) | 1 |
| 14 | Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89 | 7 |
| 15 | 74 | |
| 16 | The ring machine | 4 |
| 17 | The Complexity of Determining Paths of Length k. | 1 |
| 18 | Four Approximation Algorithms for the Feedback Vertex Set Problem. | 11 |
| 19 | Corrigenda: Transformational Methods and Their Application to Complexity Problems | 7 |
| 20 | Relationship between Pushdown Automata and Tape-Bounded Turing Machines. | 2 |
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.