Sepp Hartung

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