Sepp Hartung

According to our database, Sepp Hartung authored at least 24 papers between 2010 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Fixed-parameter algorithms for DAG Partitioning.

René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý

Discret. Appl. Math., 2017

2016

Finding large degree-anonymous subgraphs is hard.

Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger

Theor. Comput. Sci., 2016

2015

On explaining integer vectors by few homogeneous segments.

Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý

J. Comput. Syst. Sci., 2015

On structural parameterizations for the 2-club problem.

Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý

Discret. Appl. Math., 2015

The Complexity of Degree Anonymization by Graph Contractions.

Sepp Hartung, Nimrod Talmon

Proceedings of the Theory and Applications of Models of Computation, 2015

Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing.

Sepp Hartung, Holger H. Hoos

Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

2014

Constant-factor approximations for Capacitated Arc Routing without triangle inequality.

René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge

Oper. Res. Lett., 2014

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger

J. Artif. Intell. Res., 2014

Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks.

Sepp Hartung, Clemens Hoffmann, André Nichterlein

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Co-Clustering Under the Maximum Norm.

Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

The Complexity of Degree Anonymization by Vertex Addition.

Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

On Explaining Integer Vectors by Few Homogenous Segments.

Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On Structural Parameterizations for the 2-Club Problem.

Sepp Hartung, Christian Komusiewicz, André Nichterlein

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

The Complexity of Finding a Large Subgraph under Anonymity Constraints.

Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

A Refined Complexity Analysis of Degree Anonymization in Graphs.

Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

On the Parameterized and Approximation Hardness of Metric Dimension.

Sepp Hartung, André Nichterlein

Proceedings of the 28th Conference on Computational Complexity, 2013

Parameterized Complexity of DAG Partitioning.

René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.

Sepp Hartung, Christian Komusiewicz, André Nichterlein

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.

Sepp Hartung, André Nichterlein

Proceedings of the How the World Computes, 2012

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

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

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

The Parameterized Complexity of Local Search for TSP, More Refined.

Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Incremental List Coloring of Graphs, Parameterized by Conservation.

Sepp Hartung, Rolf Niedermeier

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Exact Algorithms and Experiments for Hierarchical Tree Clustering.

Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010