-
Sepp Hartung and André Nichterlein:
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.
In Proceedings of the 8th Conference on Computability in Europe
(CiE'12), Cambridge, England, June 2012, To appear in Lecture Notes in Computer Science, Springer.
-
Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondřej Suchý, and Stefan Kratsch:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
.
In Proceedings of the 26th AAAI Conference on Artificial Intelligence
(AAAI'12), Toronto, Canada, July 2012.
| 2011
| | Conference articles |
-
Jiong Guo, Sepp Hartung, Rolf Niedermeier, and Ondřej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined.
In Proceedings of the 22nd International Symposium on Algorithms and Computation
(ISAAC'11), Yokohama, Japan, Dezember 2011, LNCS 7074, pp. 614-623, Springer.
-
René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, and Mathias Weller:
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.
In Proceedings of the 6th International Symposium on Parameterized and Exact Computation
(IPEC'11), Saarbrücken, Germany, September 2011, LNCS 7112, pp. 194-206, Springer.
| 2010
| | Conference articles |
-
Jiong Guo,
Sepp Hartung,
Christian Komusiewicz,
Rolf Niedermeier and
Johannes Uhlmann:
Exact Algorithms and Experiments for Hierarchical Tree Clustering.
In Proceedings of the 24th AAAI Conference on Artificial Intelligence
(AAAI'10), Atlanta, GA, USA, July 2010.
-
Sepp Hartung and Rolf Niedermeier
Incremental List Coloring of Graphs, Parameterized by Conservation.
In Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation
(TAMC'10),
Prague, Czech Republic, June 2010, LNCS 6108, pp. 258–270, Springer.
|
| 2009
| | Thesis |
-
Sepp Hartung:
Inkrementelles Clustering mit Constraints für Data-Mining Aufgaben
Diploma Thesis, Department of Mathematics and Computer Science, University of Jena, Dez. 2009 (in German language)
-
Sepp Hartung:
Fixed-Parameter Tractability and Data Reduction for Hierarchical Clustering
Pre Diploma Thesis, Department of Mathematics and Computer Science, University of Jena, Feb. 2009
|
| |
