André Nichterlein
André Nichterlein
Verified email at
Cited by
Cited by
On tractable cases of target set selection
A Nichterlein, R Niedermeier, J Uhlmann, M Weller
Social Network Analysis and Mining 3, 233-256, 2013
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
Constant thresholds can make target set selection tractable
M Chopin, A Nichterlein, R Niedermeier, M Weller
Theory of Computing Systems 55, 61-83, 2014
Parameterized algorithmics and computational experiments for finding 2-clubs
S Hartung, C Komusiewicz, A Nichterlein
Parameterized and Exact Computation: 7th International Symposium, IPEC 2012 …, 2012
Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
E Ulitzsch, Q He, V Ulitzsch, H Molter, A Nichterlein, R Niedermeier, ...
psychometrika 86 (1), 190-214, 2021
On the parameterized and approximation hardness of metric dimension
S Hartung, A Nichterlein
2013 IEEE Conference on Computational Complexity, 266-276, 2013
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
Finding points in general position
V Froese, I Kanj, A Nichterlein, R Niedermeier
International journal of computational geometry & applications 27 (04), 277-296, 2017
The power of linear-time data reduction for maximum matching
GB Mertzios, A Nichterlein, R Niedermeier
Algorithmica 82 (12), 3521-3565, 2020
Efficient computation of optimal temporal walks under waiting-time constraints
M Bentert, AS Himmel, A Nichterlein, R Niedermeier
Applied Network Science 5, 1-26, 2020
On structural parameterizations for the 2-club problem
S Hartung, C Komusiewicz, A Nichterlein, O Suchý
Discrete Applied Mathematics 185, 79-92, 2015
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
A refined complexity analysis of degree anonymization in graphs
S Hartung, A Nichterlein, R Niedermeier, O Suchý
Information and Computation 243, 249-262, 2015
Improved upper and lower bound heuristics for degree anonymization in social networks
S Hartung, C Hoffmann, A Nichterlein
Experimental Algorithms: 13th International Symposium, SEA 2014, Copenhagen …, 2014
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, 65-91, 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
Parameterized aspects of triangle enumeration
M Bentert, T Fluschnik, A Nichterlein, R Niedermeier
Journal of Computer and System Sciences 103, 61-77, 2019
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
Fractals for kernelization lower bounds
T Fluschnik, D Hermelin, A Nichterlein, R Niedermeier
SIAM Journal on Discrete Mathematics 32 (1), 656-681, 2018
Parameterized inapproximability of target set selection and generalizations
C Bazgan, M Chopin, A Nichterlein, F Sikora
Computability 3 (2), 135-145, 2014
The system can't perform the operation now. Try again later.
Articles 1–20