André Nichterlein
André Nichterlein
Geverifieerd e-mailadres voor
Geciteerd door
Geciteerd door
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
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
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
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
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
On the parameterized and approximation hardness of metric dimension
S Hartung, A Nichterlein
2013 IEEE Conference on Computational Complexity, 266-276, 2013
A refined complexity analysis of degree anonymization in graphs
S Hartung, A Nichterlein, R Niedermeier, O Suchý
Information and Computation 243, 249-262, 2015
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
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 complexity of degree anonymization by vertex addition
R Bredereck, V Froese, S Hartung, A Nichterlein, R Niedermeier, ...
Theoretical Computer Science 607, 16-34, 2015
On structural parameterizations for the 2-club problem
S Hartung, C Komusiewicz, A Nichterlein, O Suchý
Discrete Applied Mathematics 185, 79-92, 2015
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
The power of linear-time data reduction for maximum matching
GB Mertzios, A Nichterlein, R Niedermeier
Algorithmica, 1-45, 2020
Parameterized aspects of triangle enumeration
M Bentert, T Fluschnik, A Nichterlein, R Niedermeier
Journal of Computer and System Sciences 103, 61-77, 2019
When can graph hyperbolicity be computed in linear time?
T Fluschnik, C Komusiewicz, GB Mertzios, A Nichterlein, R Niedermeier, ...
Algorithmica 81 (5), 2016-2045, 2019
Fractals for kernelization lower bounds
T Fluschnik, D Hermelin, A Nichterlein, R Niedermeier
SIAM Journal on Discrete Mathematics 32 (1), 656-681, 2018
Win-win kernelization for degree sequence completion problems
V Froese, A Nichterlein, R Niedermeier
Journal of Computer and System Sciences 82 (6), 1100-1111, 2016
The complexity of finding a large subgraph under anonymity constraints
R Bredereck, S Hartung, A Nichterlein, GJ Woeginger
International Symposium on Algorithms and Computation, 152-162, 2013
Data reduction for maximum matching on real-world graphs: theory and experiments
V Korenwein, A Nichterlein, R Niedermeier, P Zschoche
26th Annual European Symposium on Algorithms (ESA 2018), 2018
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
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20