André Nichterlein

1.0k total citations
39 papers, 325 citations indexed

About

André Nichterlein is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, André Nichterlein has authored 39 papers receiving a total of 325 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 13 papers in Computer Networks and Communications and 9 papers in Artificial Intelligence. Recurrent topics in André Nichterlein's work include Complexity and Algorithms in Graphs (21 papers), Advanced Graph Theory Research (20 papers) and Complex Network Analysis Techniques (6 papers). André Nichterlein is often cited by papers focused on Complexity and Algorithms in Graphs (21 papers), Advanced Graph Theory Research (20 papers) and Complex Network Analysis Techniques (6 papers). André Nichterlein collaborates with scholars based in Germany, France and Poland. André Nichterlein's co-authors include Rolf Niedermeier, Sepp Hartung, Mathias Weller, Robert Bredereck, Johannes Uhlmann, Cristina Bazgan, Christian Komusiewicz, Hendrik Molter, Florian Sikora and Jiehua Chen and has published in prestigious journals such as European Journal of Operational Research, Psychometrika and Theoretical Computer Science.

In The Last Decade

André Nichterlein

37 papers receiving 314 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
André Nichterlein Germany 12 162 84 72 68 47 39 325
Anke van Zuylen United States 8 111 0.7× 70 0.8× 156 2.2× 85 1.3× 71 1.5× 23 341
Johannes Uhlmann Germany 9 175 1.1× 79 0.9× 40 0.6× 65 1.0× 20 0.4× 19 268
Stefano Leucci Italy 8 66 0.4× 44 0.5× 75 1.0× 99 1.5× 25 0.5× 36 230
Serge Gaspers Australia 14 396 2.4× 166 2.0× 17 0.2× 110 1.6× 140 3.0× 70 620
Chavdar Dangalchev Bulgaria 6 64 0.4× 88 1.0× 140 1.9× 26 0.4× 13 0.3× 12 278
Naoto Ohsaka Japan 6 42 0.3× 102 1.2× 225 3.1× 98 1.4× 27 0.6× 21 301
Christos Giatsidis France 8 54 0.3× 108 1.3× 239 3.3× 159 2.3× 5 0.1× 11 363
Ramasuri Narayanam India 9 31 0.2× 75 0.9× 325 4.5× 155 2.3× 90 1.9× 30 499
Valeria Fionda Italy 11 33 0.2× 87 1.0× 66 0.9× 178 2.6× 30 0.6× 37 277
Paolo Penna Italy 10 48 0.3× 219 2.6× 11 0.2× 46 0.7× 118 2.5× 48 367

Countries citing papers authored by André Nichterlein

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of André Nichterlein

This figure shows the co-authorship network connecting the top 25 collaborators of André Nichterlein. A scholar is included among the top collaborators of André Nichterlein 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 André Nichterlein. André Nichterlein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Nichterlein, André, et al.. (2022). Parameterized Complexity of Diameter. Algorithmica. 85(2). 325–351.
2.
Bevern, René van, et al.. (2021). Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS journal on computing. 34(1). 55–75.
3.
Ulitzsch, Esther, Qiwei He, Hendrik Molter, et al.. (2021). Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes. Psychometrika. 86(1). 190–214. 30 indexed citations
4.
Nichterlein, André, et al.. (2021). Detecting and enumerating small induced subgraphs in c -closed graphs. Discrete Applied Mathematics. 302. 198–207. 4 indexed citations
5.
Molter, Hendrik, et al.. (2020). Parameterized Dynamic Cluster Editing. Algorithmica. 83(1). 1–44. 5 indexed citations
6.
Nichterlein, André, et al.. (2019). Parameterized aspects of triangle enumeration. Journal of Computer and System Sciences. 103. 61–77. 5 indexed citations
7.
Komusiewicz, Christian, et al.. (2018). Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments. European Journal of Operational Research. 275(3). 846–864. 6 indexed citations
8.
Bevern, René van, Robert Bredereck, Sepp Hartung, et al.. (2017). Fixed-parameter algorithms for DAG Partitioning. Discrete Applied Mathematics. 220. 134–160. 3 indexed citations
9.
Mertzios, George B., André Nichterlein, & Rolf Niedermeier. (2017). The Power of Linear-Time Data Reduction for Maximum Matching. Durham Research Online (Durham University). 8 indexed citations
10.
Mertzios, George B., André Nichterlein, & Rolf Niedermeier. (2016). Fine-Grained Algorithm Design for Matching.. arXiv (Cornell University). 2 indexed citations
11.
Bredereck, Robert, Jiehua Chen, Piotr Faliszewski, André Nichterlein, & Rolf Niedermeier. (2016). Prices matter for the parameterized complexity of shift bribery. Information and Computation. 251. 140–164. 19 indexed citations
12.
Bazgan, Cristina, Robert Bredereck, Sepp Hartung, André Nichterlein, & Gerhard J. Woeginger. (2016). Finding large degree-anonymous subgraphs is hard. Theoretical Computer Science. 622. 90–110. 2 indexed citations
13.
Bredereck, Robert, et al.. (2015). The complexity of degree anonymization by vertex addition. Theoretical Computer Science. 607. 16–34. 11 indexed citations
14.
Hartung, Sepp & André Nichterlein. (2015). NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. SIAM Journal on Discrete Mathematics. 29(4). 1931–1960. 2 indexed citations
15.
Hartung, Sepp, Christian Komusiewicz, & André Nichterlein. (2015). Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. Journal of Graph Algorithms and Applications. 19(1). 155–190. 17 indexed citations
16.
Hartung, Sepp, André Nichterlein, Rolf Niedermeier, & Ondřej Suchý. (2014). A refined complexity analysis of degree anonymization in graphs. Information and Computation. 243. 249–262. 11 indexed citations
17.
Bazgan, Cristina, et al.. (2014). Parameterized approximability of maximizing the spread of influence in networks. Journal of Discrete Algorithms. 27. 54–65. 17 indexed citations
18.
Bevern, René van, Sepp Hartung, André Nichterlein, & Manuel Sorge. (2014). Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Operations Research Letters. 42(4). 290–292. 9 indexed citations
19.
Bredereck, Robert, Thomas Köhler, André Nichterlein, Rolf Niedermeier, & Geevarghese Philip. (2013). Using Patterns to Form Homogeneous Teams. Algorithmica. 71(2). 517–538. 3 indexed citations
20.
Nichterlein, André, Rolf Niedermeier, Johannes Uhlmann, & Mathias Weller. (2012). On tractable cases of Target Set Selection. Social Network Analysis and Mining. 3(2). 233–256. 41 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Anke van Zuylen Breakdown of academic impact, for papers by Johannes Uhlmann Breakdown of academic impact, for papers by Stefano Leucci Breakdown of academic impact, for papers by Serge Gaspers Breakdown of academic impact, for papers by Chavdar Dangalchev Breakdown of academic impact, for papers by Naoto Ohsaka Breakdown of academic impact, for papers by Christos Giatsidis Breakdown of academic impact, for papers by Ramasuri Narayanam Breakdown of academic impact, for papers by Valeria Fionda Breakdown of academic impact, for papers by Paolo Penna
Rankless by CCL
2026