André Nichterlein
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Complexity and Algorithms in Graphs 22
- Advanced Graph Theory Research 20
-
- Optimization and Search Problems 5
- Interconnection Networks and Systems 4
- Co-authors
- Rolf Niedermeier (26 shared papers)Sepp Hartung (8 shared papers)Robert Bredereck (10 shared papers)Mathias Weller (2 shared papers)Johannes Uhlmann (1 shared paper)Jiehua Chen (3 shared papers)Piotr Faliszewski (3 shared papers)Cristina Bazgan (4 shared papers)
In The Last Decade
André Nichterlein
38 papers receiving 336 citations
Peers
Comparison fields: 5 of 46
- Computational Theory and Mathematics 169
- Discrete Mathematics and Combinatorics 19
- Statistical and Nonlinear Physics 73
- Management Science and Operations Research 58
- Computer Science Applications 22
Countries citing papers authored by André Nichterlein
This map shows the geographic impact of André Nichterlein'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 André Nichterlein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites André Nichterlein more than expected).
Fields of papers citing papers by André Nichterlein
This network shows the impact of papers produced by André Nichterlein. 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 André Nichterlein. The network helps show where André Nichterlein may publish in the future.
Co-authors
The 25 scholars most cited alongside André Nichterlein, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 40 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 41 | |
| 2 | 2021 | 31 | |
| 3 | 2013 | 28 | |
| 4 | 2020 | 21 | |
| 5 | 2016 | 20 | |
| 6 | 2015 | 17 | |
| 7 | 2014 | 17 | |
| 8 | 2014 | 16 | |
| 9 | 2013 | 15 | |
| 10 | 2012 | 12 | |
| 11 | 2014 | 12 | |
| 12 | 2015 | 11 | |
| 13 | 2014 | 11 | |
| 14 | 2014 | 10 | |
| 15 | 2014 | 9 | |
| 16 | 2018 | 8 | |
| 17 | 2017 | 8 | |
| 18 | 2018 | 6 | |
| 19 | 2020 | 5 | |
| 20 | 2019 | 5 |
About André Nichterlein
André Nichterlein is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Computer Vision and Pattern Recognition and Statistical and Nonlinear Physics, having authored 40 papers that have together received 343 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (22 papers), Advanced Graph Theory Research (20 papers), Complex Network Analysis Techniques (6 papers), Cryptography and Data Security (5 papers), Optimization and Search Problems (5 papers), Internet Traffic Analysis and Secure E-voting (4 papers), Interconnection Networks and Systems (4 papers) and Privacy-Preserving Technologies in Data (4 papers). The work is most often cited by research in Computational Theory and Mathematics (169 citations), Discrete Mathematics and Combinatorics (19 citations), Statistical and Nonlinear Physics (73 citations), Management Science and Operations Research (58 citations) and Computer Science Applications (22 citations). André Nichterlein has collaborated with scholars based in Germany, France and Poland. Frequent co-authors include Rolf Niedermeier, Sepp Hartung, Robert Bredereck, Mathias Weller, Johannes Uhlmann, Jiehua Chen, Piotr Faliszewski, Cristina Bazgan, Hendrik Molter and Florian Sikora. Their work appears in journals such as Algorithmica, Theory of Computing Systems, Operations Research Letters, Theoretical Computer Science and Discrete Applied Mathematics.
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.