Sepp Hartung

Publication Activity (10 Years)

Years Active: 2010-2017
Publications (10 Years): 5

Top Topics

Parameterized Complexity

Complexity Analysis

Information Loss

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Nimrod Talmon, Sepp Hartung
The complexity of degree anonymization by graph contractions. Inf. Comput. 256 (2017)
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220 (2017)
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Co-Clustering under the Maximum Norm. Algorithms 9 (1) (2016)
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
Fixed-Parameter Algorithms for DAG Partitioning. CoRR (2016)
Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622 (2016)
Sepp Hartung, Christian Komusiewicz, André Nichterlein
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. J. Graph Algorithms Appl. 19 (1) (2015)
Sepp Hartung, André Nichterlein
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. SIAM J. Discret. Math. 29 (4) (2015)
Sepp Hartung, Nimrod Talmon
The Complexity of Degree Anonymization by Graph Contractions. TAMC (2015)
Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý
On structural parameterizations for the 2-club problem. Discret. Appl. Math. 185 (2015)
Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
A refined complexity analysis of degree anonymization in graphs. Inf. Comput. 243 (2015)
Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. 607 (2015)
Sepp Hartung, Holger H. Hoos
Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing. LION (2015)
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Co-Clustering Under the Maximum Norm. CoRR (2015)
Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý
On explaining integer vectors by few homogeneous segments. J. Comput. Syst. Sci. 81 (4) (2015)
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Co-Clustering Under the Maximum Norm. ISAAC (2014)
Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res. 50 (2014)
René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Oper. Res. Lett. 42 (4) (2014)
Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
The Complexity of Degree Anonymization by Vertex Addition. AAIM (2014)
Sepp Hartung, Clemens Hoffmann, André Nichterlein
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. CoRR (2014)
René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. CoRR (2014)
Sepp Hartung, Clemens Hoffmann, André Nichterlein
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. SEA (2014)
Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý
On Explaining Integer Vectors by Few Homogenous Segments. WADS (2013)
Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý
The Parameterized Complexity of Local Search for TSP, More Refined. Algorithmica 67 (1) (2013)
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
Parameterized Complexity of DAG Partitioning. CIAC (2013)
Sepp Hartung, André Nichterlein
On the Parameterized and Approximation Hardness of Metric Dimension. Computational Complexity Conference (2013)
Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
The Complexity of Finding a Large Subgraph under Anonymity Constraints. ISAAC (2013)
Sepp Hartung, Christian Komusiewicz, André Nichterlein
On Structural Parameterizations for the 2-Club Problem. SOFSEM (2013)
Sepp Hartung, Rolf Niedermeier
Incremental list coloring of graphs, parameterized by conservation. Theor. Comput. Sci. 494 (2013)
Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý
On Structural Parameterizations for the 2-Club Problem CoRR (2013)
Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
A Refined Complexity Analysis of Degree Anonymization in Graphs. ICALP (2) (2013)
Sepp Hartung, André Nichterlein
On the Parameterized and Approximation Hardness of Metric Dimension CoRR (2012)
Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI (2012)
Sepp Hartung, André Nichterlein
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. CiE (2012)
Sepp Hartung, Christian Komusiewicz, André Nichterlein
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. IPEC (2012)
René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC (2011)
Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý
The Parameterized Complexity of Local Search for TSP, More Refined. ISAAC (2011)
Sepp Hartung, Rolf Niedermeier
Incremental List Coloring of Graphs, Parameterized by Conservation. TAMC (2010)
Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI (2010)