Exact Algorithms and Experiments for Hierarchical Tree Clustering. - Sepp Hartung; Jiong Guo; Christian Komusiewicz; Rolf Niedermeier; Johannes Uhlmann (AAAI, 2010)

Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. - René van Bevern; Sepp Hartung; Frank Kammer; Rolf Niedermeier; Mathias Weller (IPEC, 2011)

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Rolf Niedermeier; Ondrej Suchý 001; Stefan Kratsch (AAAI, 2012)

Parameterized Complexity of DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (CIAC, 2013)

On the Parameterized and Approximation Hardness of Metric Dimension. - Sepp Hartung; André Nichterlein (CCC, 2013)

The Complexity of Finding a Large Subgraph under Anonymity Constraints. - Robert Bredereck; Sepp Hartung; André Nichterlein; Gerhard J. Woeginger (ISAAC, 2013)

On Structural Parameterizations for the 2-Club Problem. - Sepp Hartung; Christian Komusiewicz; André Nichterlein (SOFSEM, 2013)

On Explaining Integer Vectors by Few Homogenous Segments. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Christian Komusiewicz; Rolf Niedermeier; Ondrej Suchý 001 (WADS, 2013)

The Parameterized Complexity of Local Search for TSP, More Refined. - Jiong Guo; Sepp Hartung; Rolf Niedermeier; Ondrej Suchý 001 (Algorithmica, 2013)

Incremental list coloring of graphs, parameterized by conservation. - Sepp Hartung; Rolf Niedermeier (Theor. Comput. Sci., 2013)

Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. - Sepp Hartung; Clemens Hoffmann 002; André Nichterlein (SEA, 2014)

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Stefan Kratsch; Rolf Niedermeier; Ondrej Suchý 001; Gerhard J. Woeginger (J. Artif. Intell. Res., 2014)

Constant-factor approximations for Capacitated Arc Routing without triangle inequality. - René van Bevern; Sepp Hartung; André Nichterlein; Manuel Sorge (Oper. Res. Lett., 2014)

Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing. - Sepp Hartung; Holger H. Hoos (LION, 2015)

On structural parameterizations for the 2-club problem. - Sepp Hartung; Christian Komusiewicz; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. Math., 2015)

A refined complexity analysis of degree anonymization in graphs. - Sepp Hartung; André Nichterlein; Rolf Niedermeier; Ondrej Suchý 001 (Inf. Comput., 2015)

On explaining integer vectors by few homogeneous segments. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Christian Komusiewicz; Rolf Niedermeier; Ondrej Suchý 001 (J. Comput. Syst. Sci., 2015)

Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. - Sepp Hartung; Christian Komusiewicz; André Nichterlein (J. Graph Algorithms Appl., 2015)

NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. - Sepp Hartung; André Nichterlein (SIAM J. Discret. Math., 2015)

The complexity of degree anonymization by vertex addition. - Robert Bredereck; Vincent Froese; Sepp Hartung; André Nichterlein; Rolf Niedermeier; Nimrod Talmon (Theor. Comput. Sci., 2015)

Co-Clustering under the Maximum Norm. - Laurent Bulteau; Vincent Froese; Sepp Hartung; Rolf Niedermeier (Algorithms, 2016)

Finding large degree-anonymous subgraphs is hard. - Cristina Bazgan; Robert Bredereck; Sepp Hartung; André Nichterlein; Gerhard J. Woeginger (Theor. Comput. Sci., 2016)

Fixed-parameter algorithms for DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. Math., 2017)

The complexity of degree anonymization by graph contractions. - Nimrod Talmon; Sepp Hartung (Inf. Comput., 2017)