Browsing by Author "Nichterlein, André"
-
Constant Thresholds Can Make Target Set Selection Tractable
Chopin, Morgan; Nichterlein, André; Niedermeier, Rolf; Weller, Mathias (2014) Article accepté pour publication ou publié -
Finding large degree-anonymous subgraphs is hard
Bazgan, Cristina; Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard (2016) Article accepté pour publication ou publié -
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
Bazgan, Cristina; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf; Stahlberg, Maximilian (2019) Article accepté pour publication ou publié -
Parameterized Approximability of Maximizing the Spread of Influence in Networks
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian (2013) Communication / Conférence -
Parameterized approximability of maximizing the spread of influence in networks
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian (2014) Article accepté pour publication ou publié -
Parameterized Inapproximability of Degree Anonymization
Bazgan, Cristina; Nichterlein, André (2014) Communication / Conférence -
Parameterized Inapproximability of Target Set Selection and Generalizations
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian (2014) Communication / Conférence -
Parameterized Inapproximability of Target Set Selection and Generalizations
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian (2014) Article accepté pour publication ou publié -
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
Bazgan, Cristina; Nichterlein, André; Niedermeier, Rolf (2015) Communication / Conférence