direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Dr. Sepp Hartung, Postdoc
Address:
Technische Universität Berlin
Fakultät IV
Sekr. TEL 5-1
Ernst-Reuter-Platz 7
10587 Berlin







Room:
TEL 509A
Phone:
+49(0)30-314 73137
E-Mail:
sepp.hartung[at]tu-berlin.de
Research Interests:
parameterized algorithms
graph modification problems
dynamics in social networks
matrix modification problems
Office hour
by arrangement via email

I have left academia and won't read my e-mail regularly.

PhD Thesis

2014

Sepp Hartung.
Exploring Parameter Spaces in Coping with Computational Intractability.
TU Berlin, Januar, 2014.
Bibtex entry Link to PDF

Conference Publications

2015

Sepp Hartung and Nimrod Talmon.
The Complexity of Degree Anonymization by Graph Contractions.
In Proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC '15), Springer, 2015. Accepted for publication.
Bibtex entry Link to publication
Sepp Hartung and Holger H. Hoos.
Programming by Optimisation meets Parameterised Algorithmics: A Case Study for Cluster Editing.
In Proceedings of the 9th Learning and Intelligent OptimizatioN Conference (LION'15), pages 43–58. Springer, 2015.
Bibtex entry Link to publication
Link to original publication

2014

Laurent Bulteau and Vincent Froese and Sepp Hartung and Rolf Niedermeier.
Co-Clustering Under the Maximum Norm.
In Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC '14), pages 298–309. Springer, 2014.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Vincent Froese and Sepp Hartung and André Nichterlein and Rolf Niedermeier and Nimrod Talmon.
The Complexity of Degree Anonymization by Vertex Addition.
In Proceedings of the International Conference on Algorithmic Aspects of Information and Management (AAIM '14), pages 44–55. Springer, 2014.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and Clemens Hoffmann and André Nichterlein.
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks.
In Proceedings of the 13th Symposium on Experimental Algorithms (SEA' 14), pages 376–387. Springer, 2014.
Bibtex entry Link to publication
Link to original publication

2013

Sepp Hartung and Christian Komusiewicz and André Nichterlein.
On Structural Parameterizations for the 2-Club Problem.
In Proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '13), pages 233-243. Springer, 2013.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Sepp Hartung and André Nichterlein and Gerhard Woeginger.
The complexity of finding a large subgraph under anonymity constraints.
In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13), pages 152–162. Springer, 2013.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Robert Bredereck and Morgan Chopin and Sepp Hartung and Falk Hüffner and André Nichterlein and Ondrej Suchý.
Parameterized Complexity of DAG Partitioning.
In Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC '13), pages 49-60. Springer, 2013.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and André Nichterlein.
On the Parameterized and Approximation Hardness of Metric Dimension.
In Proceedings of the 28th IEEE Conference on Computational Complexity (CCC '13), pages 266-276. IEEE, 2013.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and André Nichterlein and Rolf Niedermeier and Ondrej Suchý.
A Refined Complexity Analysis of Degree Anonymization on Graphs.
In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP '13), pages 594-606. Springer, 2013.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Jiehua Chen and Sepp Hartung and Christian Komusiewicz and Rolf Niedermeier and Ondrej Suchý.
On Explaining Integer Vectors by Few Homogenous Segments.
In Proceedings of the 13th Algorithms and Data Structures Symposium (WADS '13), pages 207-218. Springer, 2013.
Bibtex entry Link to publication

2012

Robert Bredereck and Jiehua Chen and Sepp Hartung and Stefan Kratsch and Rolf Niedermeier and Ondřej Suchý.
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI '12), pages 1292-1298. AAAI Press, 2012.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and André Nichterlein.
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.
In Proceedings of the 8th International Conference on Computability in Europe 2012 (CiE 2012), pages 283-292. Springer, 2012.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and Christian Komusiewicz and André Nichterlein.
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.
In Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC'12), pages 231-241. Springer, 2012.
Bibtex entry Link to publication
Link to original publication

2011

René van Bevern and Sepp Hartung and Frank Kammer and 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), pages 194–206. Springer, 2011.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Sepp Hartung and Rolf Niedermeier and Ondrej Suchý.
The Parameterized Complexity of Local Search for TSP, More Refined.
In Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC '11), pages 614-623. Springer, 2011.
Bibtex entry Link to publication
Link to original publication

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), pages 258–270. Springer, 2010.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Sepp Hartung and Christian Komusiewicz and 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), AAAI Press, 2010.
Bibtex entry Link to publication
Link to original publication

To top

Journal Publications

2016

Laurent Bulteau and Vincent Froese and Sepp Hartung and Rolf Niedermeier.
Co-Clustering Under the Maximum Norm.
Algorithms, 9(1):17, 2016.
Bibtex entry Link to publication
Link to original publication
Cristina Bazgan and Robert Bredereck and Sepp Hartung and André Nichterlein and Gerhard J. Woeginger.
Finding large degree-anonymous subgraphs is hard.
Theoretical Computer Science, 622:90–110, 2016.
Bibtex entry Link to publication

2015

Sepp Hartung and Christian Komusiewicz and André Nichterlein.
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.
Journal of Graph Algorithms and Applications, 19(1):155–190, 2015.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Jiehua Chen and Sepp Hartung and Christian Komusiewicz and Rolf Niedermeier and Ondrej Suchý.
On Explaining Integer Vectors by Few Homogenous Segments.
Journal of Computer and System Sciences, 81(4):766-782, Elsevier, 2015.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and André Nichterlein.
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.
SIAM Journal on Discrete Mathematics, 29(4):1931-1960, 2015.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and André Nichterlein and Rolf Niedermeier and Ondrej Suchý.
A Refined Complexity Analysis of Degree Anonymization on Graphs.
Information and Computation, 243:249–262, 2015.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and Christian Komusiewicz and André Nichterlein and Ondrej Suchý.
On structural parameterizations for the 2-club problem.
Discrete Applied Mathematics, 185:79-92, 2015.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Vincent Froese and Sepp Hartung and André Nichterlein and Rolf Niedermeier and Nimrod Talmon.
The Complexity of Degree Anonymization by Vertex Addition.
Theoretical Computer Science, 607(Part 1):16–34, Elsevier, 2015.
Bibtex entry Link to publication
Link to original publication

2014

René van Bevern and Sepp Hartung and André Nichterlein and Manuel Sorge.
Constant-factor approximations for {Capacitated Arc Routing} without triangle inequality.
Operations Research Letters, 4(4):290–292, 2014.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Jiehua Chen and Sepp Hartung and Stefan Kratsch and Rolf Niedermeier and Ondřej Suchý and Gerhard J. Woeginger.
A multivariate complexity analysis of lobbying in multiple referenda.
Journal of Artificial Intelligence Research, 50:409–446, 2014.
Bibtex entry Link to publication
Link to original publication

2013

Jiong Guo and Sepp Hartung and Rolf Niedermeier and Ondrej Suchý.
The Parameterized Complexity of Local Search for TSP, More Refined.
Algorithmica, 67(1):89-110, Springer, 2013.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and Rolf Niedermeier.
Incremental List Coloring of Graphs, Parameterized by Conservation.
Theoretical Computer Science, 494:86-98, 2013.
Bibtex entry Link to publication

Zusatzinformationen / Extras