×

Nichterlein, André

Compute Distance To:
Author ID: nichterlein.andre Recent zbMATH articles by "Nichterlein, André"
Published as: Nichterlein, André
External Links: ORCID
Documents Indexed: 59 Publications since 2010
Co-Authors: 43 Co-Authors with 59 Joint Publications
718 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

49 Publications have been cited 226 times in 143 Documents Cited by Year
Constant thresholds can make target set selection tractable. Zbl 1319.68109
Chopin, Morgan; Nichterlein, André; Niedermeier, Rolf; Weller, Mathias
16
2014
Parameterized approximability of maximizing the spread of influence in networks. Zbl 1361.68105
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian
13
2014
On tractable cases of target set selection. Zbl 1310.68115
Nichterlein, André; Niedermeier, Rolf; Uhlmann, Johannes; Weller, Mathias
12
2010
Parameterized algorithmics and computational experiments for finding 2-clubs. Zbl 1310.05076
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
11
2015
A refined complexity analysis of degree anonymization in graphs. Zbl 1327.68134
Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Suchý, Ondřej
10
2015
Constant thresholds can make target set selection tractable. Zbl 1319.68108
Chopin, Morgan; Nichterlein, André; Niedermeier, Rolf; Weller, Mathias
10
2012
Prices matter for the parameterized complexity of shift bribery. Zbl 1354.91052
Bredereck, Robert; Chen, Jiehua; Faliszewski, Piotr; Nichterlein, André; Niedermeier, Rolf
10
2016
Finding points in general position. Zbl 1386.68196
Froese, Vincent; Kanj, Iyad; Nichterlein, André; Niedermeier, Rolf
9
2017
Parameterized inapproximability of target set selection and generalizations. Zbl 1320.68088
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian
7
2014
A refined complexity analysis of finding the most vital edges for undirected shortest paths. Zbl 1459.68152
Bazgan, Cristina; Nichterlein, André; Niedermeier, Rolf
7
2015
On structural parameterizations for the 2-club problem. Zbl 1311.05051
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André; Suchý, Ondřej
7
2015
Parameterized algorithmics and computational experiments for finding 2-clubs. Zbl 1375.68065
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
7
2012
Parameterized approximability of maximizing the spread of influence in networks. Zbl 1382.68329
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian
7
2013
The complexity of finding a large subgraph under anonymity constraints. Zbl 1329.05276
Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard J.
6
2013
The complexity of degree anonymization by vertex addition. Zbl 1445.68153
Bredereck, Robert; Froese, Vincent; Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod
5
2014
Parameterized inapproximability of degree anonymization. Zbl 1456.68062
Bazgan, Cristina; Nichterlein, André
5
2014
Win-win kernelization for degree sequence completion problems. Zbl 1417.68067
Froese, Vincent; Nichterlein, André; Niedermeier, Rolf
5
2014
A linear-time algorithm for maximum-cardinality matching on cocomparability graphs. Zbl 1401.05284
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf
5
2018
Fractals for kernelization lower bounds. Zbl 1388.68112
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf
5
2018
Finding large degree-anonymous subgraphs is hard. Zbl 1335.68095
Bazgan, Cristina; Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard J.
4
2016
Pattern-guided \(k\)-anonymity. Zbl 1303.68059
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf
4
2013
When can graph hyperbolicity be computed in linear time? Zbl 06778724
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod
4
2017
The effect of homogeneity on the computational complexity of combinatorial data anonymization. Zbl 1281.68120
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
4
2014
Pattern-guided data anonymization and clustering. Zbl 1343.68105
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
4
2011
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. Zbl 1330.68114
Hartung, Sepp; Nichterlein, André
3
2015
The complexity of degree anonymization by vertex addition. Zbl 1332.68164
Bredereck, Robert; Froese, Vincent; Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod
3
2015
Win-win kernelization for degree sequence completion problems. Zbl 1345.68156
Froese, Vincent; Nichterlein, André; Niedermeier, Rolf
3
2016
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments. Zbl 1430.05119
Komusiewicz, Christian; Nichterlein, André; Niedermeier, Rolf; Picker, Marten
3
2019
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Zbl 1407.90090
Bazgan, Cristina; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf; Stahlberg, Maximilian
3
2019
Parameterized complexity of diameter. Zbl 07163775
Bentert, Matthias; Nichterlein, André
3
2019
Parameterized aspects of triangle enumeration. Zbl 1430.68176
Bentert, Matthias; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf
3
2019
Fractals for kernelization lower bounds, with an application to length-bounded cut problems. Zbl 1388.68111
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf
3
2016
Using patterns to form homogeneous teams. Zbl 1322.90074
Bredereck, Robert; Köhler, Thomas; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
2
2015
The power of linear-time data reduction for maximum matching. Zbl 1441.68192
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf
2
2017
An adaptive version of Brandes’ algorithm for betweenness centrality. Zbl 1446.05085
Bentert, Matthias; Dittmann, Alexander; Kellerhals, Leon; Nichterlein, André; Niedermeier, Rolf
2
2020
The power of linear-time data reduction for maximum matching. Zbl 07272772
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf
2
2020
Constant-factor approximations for capacitated arc routing without triangle inequality. Zbl 1408.90044
van Bevern, René; Hartung, Sepp; Nichterlein, André; Sorge, Manuel
2
2014
Fixed-parameter algorithms for DAG partitioning. Zbl 1355.05204
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej
2
2017
Parameterized complexity of DAG partitioning. Zbl 1382.68127
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej
2
2013
Parameterized aspects of triangle enumeration. Zbl 06810947
Bentert, Matthias; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf
2
2017
Editing graphs into few cliques: complexity, approximation, and kernelization schemes. Zbl 1451.68203
Hüffner, Falk; Komusiewicz, Christian; Nichterlein, André
1
2015
Parameterized inapproximability of target set selection and generalizations. Zbl 1432.68186
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian
1
2014
Parameterized dynamic cluster editing. Zbl 07303842
Luo, Junjie; Molter, Hendrik; Nichterlein, André; Niedermeier, Rolf
1
2021
Kernelization lower bounds for finding constant-size subgraphs. Zbl 06932471
Fluschnik, Till; Mertzios, George B.; Nichterlein, André
1
2018
When can graph hyperbolicity be computed in linear time? Zbl 1439.68016
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod
1
2019
On structural parameterizations for the 2-club problem. Zbl 1303.68093
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
1
2013
The effect of homogeneity on the complexity of \(k\)-anonymity. Zbl 1342.68154
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
1
2011
Parameterized algorithmics for graph modification problems: on interactions with heuristics. Zbl 1417.68055
Komusiewicz, Christian; Nichterlein, André; Niedermeier, Rolf
1
2016
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. Zbl 1330.68113
Hartung, Sepp; Nichterlein, André
1
2012
Parameterized dynamic cluster editing. Zbl 07303842
Luo, Junjie; Molter, Hendrik; Nichterlein, André; Niedermeier, Rolf
1
2021
An adaptive version of Brandes’ algorithm for betweenness centrality. Zbl 1446.05085
Bentert, Matthias; Dittmann, Alexander; Kellerhals, Leon; Nichterlein, André; Niedermeier, Rolf
2
2020
The power of linear-time data reduction for maximum matching. Zbl 07272772
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf
2
2020
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments. Zbl 1430.05119
Komusiewicz, Christian; Nichterlein, André; Niedermeier, Rolf; Picker, Marten
3
2019
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Zbl 1407.90090
Bazgan, Cristina; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf; Stahlberg, Maximilian
3
2019
Parameterized complexity of diameter. Zbl 07163775
Bentert, Matthias; Nichterlein, André
3
2019
Parameterized aspects of triangle enumeration. Zbl 1430.68176
Bentert, Matthias; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf
3
2019
When can graph hyperbolicity be computed in linear time? Zbl 1439.68016
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod
1
2019
A linear-time algorithm for maximum-cardinality matching on cocomparability graphs. Zbl 1401.05284
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf
5
2018
Fractals for kernelization lower bounds. Zbl 1388.68112
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf
5
2018
Kernelization lower bounds for finding constant-size subgraphs. Zbl 06932471
Fluschnik, Till; Mertzios, George B.; Nichterlein, André
1
2018
Finding points in general position. Zbl 1386.68196
Froese, Vincent; Kanj, Iyad; Nichterlein, André; Niedermeier, Rolf
9
2017
When can graph hyperbolicity be computed in linear time? Zbl 06778724
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod
4
2017
The power of linear-time data reduction for maximum matching. Zbl 1441.68192
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf
2
2017
Fixed-parameter algorithms for DAG partitioning. Zbl 1355.05204
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej
2
2017
Parameterized aspects of triangle enumeration. Zbl 06810947
Bentert, Matthias; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf
2
2017
Prices matter for the parameterized complexity of shift bribery. Zbl 1354.91052
Bredereck, Robert; Chen, Jiehua; Faliszewski, Piotr; Nichterlein, André; Niedermeier, Rolf
10
2016
Finding large degree-anonymous subgraphs is hard. Zbl 1335.68095
Bazgan, Cristina; Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard J.
4
2016
Win-win kernelization for degree sequence completion problems. Zbl 1345.68156
Froese, Vincent; Nichterlein, André; Niedermeier, Rolf
3
2016
Fractals for kernelization lower bounds, with an application to length-bounded cut problems. Zbl 1388.68111
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf
3
2016
Parameterized algorithmics for graph modification problems: on interactions with heuristics. Zbl 1417.68055
Komusiewicz, Christian; Nichterlein, André; Niedermeier, Rolf
1
2016
Parameterized algorithmics and computational experiments for finding 2-clubs. Zbl 1310.05076
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
11
2015
A refined complexity analysis of degree anonymization in graphs. Zbl 1327.68134
Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Suchý, Ondřej
10
2015
A refined complexity analysis of finding the most vital edges for undirected shortest paths. Zbl 1459.68152
Bazgan, Cristina; Nichterlein, André; Niedermeier, Rolf
7
2015
On structural parameterizations for the 2-club problem. Zbl 1311.05051
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André; Suchý, Ondřej
7
2015
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. Zbl 1330.68114
Hartung, Sepp; Nichterlein, André
3
2015
The complexity of degree anonymization by vertex addition. Zbl 1332.68164
Bredereck, Robert; Froese, Vincent; Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod
3
2015
Using patterns to form homogeneous teams. Zbl 1322.90074
Bredereck, Robert; Köhler, Thomas; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
2
2015
Editing graphs into few cliques: complexity, approximation, and kernelization schemes. Zbl 1451.68203
Hüffner, Falk; Komusiewicz, Christian; Nichterlein, André
1
2015
Constant thresholds can make target set selection tractable. Zbl 1319.68109
Chopin, Morgan; Nichterlein, André; Niedermeier, Rolf; Weller, Mathias
16
2014
Parameterized approximability of maximizing the spread of influence in networks. Zbl 1361.68105
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian
13
2014
Parameterized inapproximability of target set selection and generalizations. Zbl 1320.68088
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian
7
2014
The complexity of degree anonymization by vertex addition. Zbl 1445.68153
Bredereck, Robert; Froese, Vincent; Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod
5
2014
Parameterized inapproximability of degree anonymization. Zbl 1456.68062
Bazgan, Cristina; Nichterlein, André
5
2014
Win-win kernelization for degree sequence completion problems. Zbl 1417.68067
Froese, Vincent; Nichterlein, André; Niedermeier, Rolf
5
2014
The effect of homogeneity on the computational complexity of combinatorial data anonymization. Zbl 1281.68120
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
4
2014
Constant-factor approximations for capacitated arc routing without triangle inequality. Zbl 1408.90044
van Bevern, René; Hartung, Sepp; Nichterlein, André; Sorge, Manuel
2
2014
Parameterized inapproximability of target set selection and generalizations. Zbl 1432.68186
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian
1
2014
Parameterized approximability of maximizing the spread of influence in networks. Zbl 1382.68329
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian
7
2013
The complexity of finding a large subgraph under anonymity constraints. Zbl 1329.05276
Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard J.
6
2013
Pattern-guided \(k\)-anonymity. Zbl 1303.68059
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf
4
2013
Parameterized complexity of DAG partitioning. Zbl 1382.68127
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej
2
2013
On structural parameterizations for the 2-club problem. Zbl 1303.68093
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
1
2013
Constant thresholds can make target set selection tractable. Zbl 1319.68108
Chopin, Morgan; Nichterlein, André; Niedermeier, Rolf; Weller, Mathias
10
2012
Parameterized algorithmics and computational experiments for finding 2-clubs. Zbl 1375.68065
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
7
2012
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. Zbl 1330.68113
Hartung, Sepp; Nichterlein, André
1
2012
Pattern-guided data anonymization and clustering. Zbl 1343.68105
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
4
2011
The effect of homogeneity on the complexity of \(k\)-anonymity. Zbl 1342.68154
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
1
2011
On tractable cases of target set selection. Zbl 1310.68115
Nichterlein, André; Niedermeier, Rolf; Uhlmann, Johannes; Weller, Mathias
12
2010
all top 5

Cited by 249 Authors

23 Nichterlein, André
23 Niedermeier, Rolf
11 Gargano, Luisa
10 Vaccaro, Ugo
9 Cordasco, Gennaro
8 Bredereck, Robert
7 Bazgan, Cristina
7 Golovach, Petr A.
7 Komusiewicz, Christian
7 Rescigno, Adele Anna
6 Hartung, Sepp
5 Fluschnik, Till
5 Froese, Vincent
5 Molter, Hendrik
4 Chopin, Morgan
4 Dey, Palash
4 Dondi, Riccardo
4 Klavžar, Sandi
4 Mertzios, George B.
4 Misra, Neeldhara
4 Peters, Joseph G.
4 Rautenbach, Dieter
4 Sikora, Florian
4 Suchý, Ondřej
4 Zschoche, Philipp
3 Bentert, Matthias
3 Cicalese, Ferdinando
3 Ducoffe, Guillaume
3 Faliszewski, Piotr
3 Himmel, Anne-Sophie
3 Knop, Dušan
3 Lafond, Manuel
3 Mauri, Giancarlo
3 Milanič, Martin
3 Narahari, Yadati
3 Philip, Geevarghese
3 Sorge, Manuel
3 Talmon, Nimrod
3 Thomas, Elias John
3 Zoppis, Italo
2 Auletta, Vincenzo
2 Bar-Noy, Amotz
2 Boginski, Vladimir L.
2 Bringmann, Karl
2 Butenko, Sergiy I.
2 Cao, Yixin
2 Chandran S. V., Ullas
2 Changat, Manoj
2 Dabrowski, Konrad Kazimierz
2 Draque Penso, Lucia
2 Dvořák, Pavel
2 Ehard, Stefan
2 Ferraioli, Diodato
2 Foucaud, Florent
2 Greco, Gianluigi
2 Guan, Xiucui
2 Heeger, Klaus
2 Hell, Pavol
2 Hemaspaandra, Edith
2 Hemaspaandra, Lane A.
2 Husfeldt, Thore
2 Kolman, Petr
2 Kratsch, Dieter
2 Kratsch, Stefan
2 Liu, Xianliang
2 Magnusson, Måns
2 Mathieson, Luke
2 Mecchia, Marco
2 Millani, Marcelo Garlet
2 Narayanan, Lata
2 Pajouh, Foad Mahdavi
2 Pardalos, Panos M.
2 Paulusma, Daniël
2 Peleg, David
2 Popa, Alexandru
2 Prokopyev, Oleg Alexan
2 Rawitz, Dror
2 Rizzi, Romeo
2 Rothe, Jörg-Matthias
2 Ullas Chandran, S. V.
2 van Bevern, René
2 van ’t Hof, Pim
2 Veremyev, Alexander
2 Wang, Jianxin
2 Wang, Wei
2 Wang, Wencheng
2 Weller, Mathias
2 Wu, Kangkang
2 Xin, Chunlin
2 Yang, Zishen
2 You, Jie
2 Zaker, Manouchehr
2 Zhang, Qiao
2 Zhu, Binhai
2 Zou, Peng
1 Adiga, Abhijin
1 Altmanová, Kateřina
1 Anand, Bijo S.
1 Asahiro, Yuichi
1 Balasundaram, Balabhaskar
...and 149 more Authors

Citations by Year