| 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 | 47 | 2012 |
| A multivariate complexity analysis of lobbying in multiple referenda R Bredereck, J Chen, S Hartung, S Kratsch, R Niedermeier, O Suchy, ... Journal of Artificial Intelligence Research 50, 409-446, 2014 | 36 | 2014 |
| On the parameterized and approximation hardness of metric dimension S Hartung, A Nichterlein 2013 IEEE Conference on Computational Complexity, 266-276, 2013 | 33 | 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 | 31 | 2015 |
| 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 | 28 | 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 | 27 | 2014 |
| On structural parameterizations for the 2-club problem S Hartung, C Komusiewicz, A Nichterlein, O Suchý Discrete Applied Mathematics 185, 79-92, 2015 | 26 | 2015 |
| Incremental list coloring of graphs, parameterized by conservation S Hartung, R Niedermeier Theoretical Computer Science 494, 86-98, 2013 | 26 | 2013 |
| Linear-time computation of a linear problem kernel for dominating set on planar graphs R Van Bevern, S Hartung, F Kammer, R Niedermeier, M Weller International Symposium on Parameterized and Exact Computation, 194-206, 2011 | 19 | 2011 |
| 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 | 14 | 2014 |
| 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 | 14 | 2013 |
| The parameterized complexity of local search for TSP, more refined J Guo, S Hartung, R Niedermeier, O Suchý Algorithmica 67 (1), 89-110, 2013 | 14 | 2013 |
| Programming by optimisation meets parameterised algorithmics: A case study for cluster editing S Hartung, HH Hoos International Conference on Learning and Intelligent Optimization, 43-58, 2015 | 13 | 2015 |
| The complexity of degree anonymization by graph contractions S Hartung, N Talmon International Conference on Theory and Applications of Models of Computation …, 2015 | 10 | 2015 |
| Exact algorithms and experiments for hierarchical tree clustering J Guo, S Hartung, C Komusiewicz, R Niedermeier, J Uhlmann Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI’10 …, 2010 | 8 | 2010 |
| Incremental list coloring of graphs, parameterized by conservation S Hartung, R Niedermeier International Conference on Theory and Applications of Models of Computation …, 2010 | 8 | 2010 |
| NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs S Hartung, A Nichterlein SIAM Journal on Discrete Mathematics 29 (4), 1931-1960, 2015 | 7 | 2015 |
| Parameterized complexity of DAG partitioning R Van Bevern, R Bredereck, M Chopin, S Hartung, F Hüffner, ... International Conference on Algorithms and Complexity, 49-60, 2013 | 7 | 2013 |
| Fixed-parameter algorithms for DAG partitioning R van Bevern, R Bredereck, M Chopin, S Hartung, F Hüffner, A Nichterlein, ... Discrete Applied Mathematics 220, 134-160, 2017 | 6 | 2017 |
| Finding large degree-anonymous subgraphs is hard C Bazgan, R Bredereck, S Hartung, A Nichterlein, GJ Woeginger Theoretical Computer Science 622, 90-110, 2016 | 6 | 2016 |
