×
Compute Distance To:
Author ID: hartung.sepp Recent zbMATH articles by "Hartung, Sepp"
Published as: Hartung, Sepp
External Links: MGP
Documents Indexed: 27 Publications since 2010
Co-Authors: 19 Co-Authors with 27 Joint Publications
597 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

23 Publications have been cited 101 times in 67 Documents Cited by Year
Parameterized algorithmics and computational experiments for finding 2-clubs. Zbl 1310.05076
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
11
2015
Incremental list coloring of graphs, parameterized by conservation. Zbl 1294.68085
Hartung, Sepp; Niedermeier, Rolf
10
2013
A refined complexity analysis of degree anonymization in graphs. Zbl 1327.68134
Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Suchý, Ondřej
10
2015
Parameterized algorithmics and computational experiments for finding 2-clubs. Zbl 1375.68065
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
7
2012
On structural parameterizations for the 2-club problem. Zbl 1311.05051
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André; Suchý, Ondřej
7
2015
Linear-time computation of a linear problem kernel for dominating set on planar graphs. Zbl 1352.68119
van Bevern, René; Hartung, Sepp; Kammer, Frank; Niedermeier, Rolf; Weller, Mathias
6
2012
The parameterized complexity of local search for TSP, more refined. Zbl 1292.68086
Guo, Jiong; Hartung, Sepp; Niedermeier, Rolf; Suchý, Ondřej
6
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 graph contractions. Zbl 1459.68158
Hartung, Sepp; Talmon, Nimrod
6
2015
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
Finding large degree-anonymous subgraphs is hard. Zbl 1335.68095
Bazgan, Cristina; Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard J.
4
2016
Incremental list coloring of graphs, parameterized by conservation. Zbl 1284.68279
Hartung, Sepp; Niedermeier, Rolf
3
2010
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
A multivariate complexity analysis of lobbying in multiple referenda. Zbl 1342.91011
Bredereck, Robert; Chen, Jiehua; Hartung, Sepp; Kratsch, Stefan; Niedermeier, Rolf; Suchý, Ondřej; Woeginger, Gerhard J.
3
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
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
On structural parameterizations for the 2-club problem. Zbl 1303.68093
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
1
2013
On explaining integer vectors by few homogeneous segments. Zbl 1320.68098
Bredereck, Robert; Chen, Jiehua; Hartung, Sepp; Komusiewicz, Christian; Niedermeier, Rolf; Suchý, Ondřej
1
2015
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. Zbl 1330.68113
Hartung, Sepp; Nichterlein, André
1
2012
The parameterized complexity of local search for TSP, more refined. Zbl 1350.68141
Guo, Jiong; Hartung, Sepp; Niedermeier, Rolf; Suchý, Ondřej
1
2011
Co-clustering under the maximum norm. Zbl 1432.68172
Bulteau, Laurent; Froese, Vincent; Hartung, Sepp; Niedermeier, Rolf
1
2016
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
Finding large degree-anonymous subgraphs is hard. Zbl 1335.68095
Bazgan, Cristina; Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard J.
4
2016
Co-clustering under the maximum norm. Zbl 1432.68172
Bulteau, Laurent; Froese, Vincent; Hartung, Sepp; 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
On structural parameterizations for the 2-club problem. Zbl 1311.05051
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André; Suchý, Ondřej
7
2015
The complexity of degree anonymization by graph contractions. Zbl 1459.68158
Hartung, Sepp; Talmon, Nimrod
6
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
On explaining integer vectors by few homogeneous segments. Zbl 1320.68098
Bredereck, Robert; Chen, Jiehua; Hartung, Sepp; Komusiewicz, Christian; Niedermeier, Rolf; Suchý, Ondřej
1
2015
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
A multivariate complexity analysis of lobbying in multiple referenda. Zbl 1342.91011
Bredereck, Robert; Chen, Jiehua; Hartung, Sepp; Kratsch, Stefan; Niedermeier, Rolf; Suchý, Ondřej; Woeginger, Gerhard J.
3
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
Incremental list coloring of graphs, parameterized by conservation. Zbl 1294.68085
Hartung, Sepp; Niedermeier, Rolf
10
2013
The parameterized complexity of local search for TSP, more refined. Zbl 1292.68086
Guo, Jiong; Hartung, Sepp; Niedermeier, Rolf; Suchý, Ondřej
6
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
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
Parameterized algorithmics and computational experiments for finding 2-clubs. Zbl 1375.68065
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André
7
2012
Linear-time computation of a linear problem kernel for dominating set on planar graphs. Zbl 1352.68119
van Bevern, René; Hartung, Sepp; Kammer, Frank; Niedermeier, Rolf; Weller, Mathias
6
2012
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. Zbl 1330.68113
Hartung, Sepp; Nichterlein, André
1
2012
The parameterized complexity of local search for TSP, more refined. Zbl 1350.68141
Guo, Jiong; Hartung, Sepp; Niedermeier, Rolf; Suchý, Ondřej
1
2011
Incremental list coloring of graphs, parameterized by conservation. Zbl 1284.68279
Hartung, Sepp; Niedermeier, Rolf
3
2010
all top 5

Cited by 141 Authors

15 Niedermeier, Rolf
12 Nichterlein, André
8 Hartung, Sepp
8 Komusiewicz, Christian
5 Bredereck, Robert
5 Suchý, Ondřej
4 Froese, Vincent
4 Golovach, Petr A.
4 van Bevern, René
3 Dondi, Riccardo
3 Guo, Jiong
3 Sorge, Manuel
2 Bar-Noy, Amotz
2 Bazgan, Cristina
2 Butenko, Sergiy I.
2 Fluschnik, Till
2 Fomin, Fedor V.
2 Hermelin, Danny
2 Jansen, Bart M. P.
2 Kammer, Frank
2 Kanj, Iyad A.
2 Kowalik, Łukasz
2 Mauri, Giancarlo
2 Mertzios, George B.
2 Millani, Marcelo Garlet
2 Molter, Hendrik
2 Pajouh, Foad Mahdavi
2 Peleg, David
2 Rawitz, Dror
2 Talmon, Nimrod
2 Wang, Wencheng
2 Xin, Chunlin
2 Zhu, Binhai
2 Zoppis, Italo
2 Zou, Peng
1 Abu-Khzam, Faisal N.
1 Asahiro, Yuichi
1 Balasundaram, Balabhaskar
1 Bao, Xiaoguang
1 Baril, Ambroise
1 Baumeister, Dorothea
1 Boginski, Vladimir L.
1 Böhnlein, Toni
1 Bonnet, Edouard
1 Bossek, Jakob
1 Cao, Yongzhi
1 Cazals, Pierre
1 Chakraborty, Dibyayan
1 Chandran, L. Sunil
1 Chang, Maw-Shang
1 Chen, Hanlin
1 Chen, Jiehua
1 Chitnis, Rajesh Hemant
1 Chlebíková, Janka
1 Chopin, Morgan
1 Choudhary, Keerti
1 Cygan, Marek
1 de Kroon, Jari J. H.
1 Dippel, Matthew
1 Doi, Yuya
1 Dörnfelder, Martin
1 Egan, Judith
1 Erdélyi, Gábor
1 Erdélyi, Olivia Johanna
1 Faliszewski, Piotr
1 Feldmann, Andreas Emil
1 Fellows, Michael Ralph
1 Fertin, Guillaume
1 Gaspers, Serge
1 Gudmundsson, Joachim
1 Gutin, Gregory Z.
1 Hagerup, Torben
1 Hajiaghayi, Mohammad Taghi
1 Hassan, Olawale
1 Heeger, Klaus
1 Heggernes, Pinar
1 Hicks, Illya V.
1 Himmel, Anne-Sophie
1 Hosseinzadeh, Mohammad Mehdi
1 Hüffner, Falk
1 Hung, Ling-Ju
1 Iwata, Yoichi
1 Jones, Mitchell
1 Kao, Mong-Jen
1 Knop, Dušan
1 Koseler, Marcel
1 Koutecký, Martin
1 Kratsch, Dieter
1 Krithika, R.
1 Lafond, Manuel
1 Lee, Der-Tsai
1 Lin, Chih-Ren
1 Liu, Zhaohui
1 Lokshtanov, Daniel
1 Luo, Junjie
1 Marx, Dániel
1 Mestre, Julián
1 Misra, Neeldhara
1 Miyano, Eiji
1 Mnich, Matthias
...and 41 more Authors

Citations by Year