Follow
André Nichterlein
André Nichterlein
Verified email at tu-berlin.de
Title
Cited by
Cited by
Year
On tractable cases of target set selection
A Nichterlein, R Niedermeier, J Uhlmann, M Weller
Social Network Analysis and Mining 3 (2), 233-256, 2013
792013
Constant thresholds can make target set selection tractable
M Chopin, A Nichterlein, R Niedermeier, M Weller
Theory of Computing Systems 55 (1), 61-83, 2014
612014
Prices matter for the parameterized complexity of shift bribery
R Bredereck, J Chen, P Faliszewski, A Nichterlein, R Niedermeier
Information and Computation 251, 140-164, 2016
602016
Parameterized algorithmics and computational experiments for finding 2-clubs
S Hartung, C Komusiewicz, A Nichterlein
International Symposium on Parameterized and Exact Computation, 231-241, 2012
532012
Parameterized approximability of maximizing the spread of influence in networks
C Bazgan, M Chopin, A Nichterlein, F Sikora
Journal of Discrete Algorithms 27, 54-65, 2014
442014
On the parameterized and approximation hardness of metric dimension
S Hartung, A Nichterlein
2013 IEEE Conference on Computational Complexity, 266-276, 2013
382013
A refined complexity analysis of degree anonymization in graphs
S Hartung, A Nichterlein, R Niedermeier, O Suchý
Information and Computation 243, 249-262, 2015
352015
Finding points in general position
V Froese, I Kanj, A Nichterlein, R Niedermeier
International journal of computational geometry & applications 27 (04), 277-296, 2017
342017
On structural parameterizations for the 2-club problem
S Hartung, C Komusiewicz, A Nichterlein, O Suchý
Discrete Applied Mathematics 185, 79-92, 2015
342015
The power of linear-time data reduction for matching.
GB Mertzios, A Nichterlein, R Niedermeier
Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017
33*2017
The effect of homogeneity on the computational complexity of combinatorial data anonymization
R Bredereck, A Nichterlein, R Niedermeier, G Philip
Data Mining and Knowledge Discovery 28 (1), 65-91, 2014
33*2014
The complexity of degree anonymization by vertex addition
R Bredereck, V Froese, S Hartung, A Nichterlein, R Niedermeier, ...
Theoretical Computer Science 607, 16-34, 2015
322015
Improved upper and lower bound heuristics for degree anonymization in social networks
S Hartung, C Hoffmann, A Nichterlein
International Symposium on Experimental Algorithms, 376-387, 2014
322014
Data reduction for maximum matching on real-world graphs: Theory and experiments
T Koana, V Korenwein, A Nichterlein, R Niedermeier, P Zschoche
arXiv preprint arXiv:1806.09683, 2018
282018
Fractals for kernelization lower bounds
T Fluschnik, D Hermelin, A Nichterlein, R Niedermeier
SIAM Journal on Discrete Mathematics 32 (1), 656-681, 2018
232018
A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
GB Mertzios, A Nichterlein, R Niedermeier
SIAM Journal on Discrete Mathematics 32 (4), 2820-2835, 2018
222018
Parameterized aspects of triangle enumeration
M Bentert, T Fluschnik, A Nichterlein, R Niedermeier
Journal of Computer and System Sciences 103, 61-77, 2019
212019
Efficient computation of optimal temporal walks under waiting-time constraints
M Bentert, AS Himmel, A Nichterlein, R Niedermeier
Applied Network Science 5 (1), 1-26, 2020
192020
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
M Bentert, A Dittmann, L Kellerhals, A Nichterlein, R Niedermeier
arXiv preprint arXiv:1802.06701, 2018
182018
Constant-factor approximations for capacitated arc routing without triangle inequality
R Van Bevern, S Hartung, A Nichterlein, M Sorge
Operations Research Letters 42 (4), 290-292, 2014
182014
The system can't perform the operation now. Try again later.
Articles 1–20