Hannes Moser

PhD student

Theoretische Informatik I
Institut für Informatik
Friedrich-Schiller-Universität Jena
Ernst-Abbe-Platz 2
D-07743 Jena

Phone: +49 3641 9-46324
Fax: +49 3641 9-46322
E-mail:
Room: 3323

Journal Articles

		BibTeX bibliography of all publications
Falk Hüffner Christian Komusiewicz Hannes Moser Rolf Niedermeier		Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory of Computing Systems. Accepted for publication, September 2008. Springer (Original Publication).
Hannes Moser Dimitrios M. Thilikos		Parameterized Complexity of Finding Regular Induced Subgraphs. Journal of Discrete Algorithms. Accepted for publication, September 2008. Elsevier (Original Publication).
Hannes Moser Somnath Sikdar		The Parameterized Complexity of the Induced Matching Problem. Discrete Applied Mathematics. Accepted for publication, August 2008. Elsevier (Original Publication).
Jiong Guo, Falk Hüffner Hannes Moser		Feedback Arc Set in Bipartite Tournaments is NP-Complete. Information Processing Letters, 102(2-3): 62-65, 2007 (Original Publication).
Hannes Moser		System J - Konzeption und prototypische Umsetzung eines Praktikums zur Datenbanksystementwicklung. BTW Studierenden-Programm, pages 29–31, 2005.

Conference Articles

Michael R. Fellows Jiong Guo Hannes Moser Rolf Niedermeier		A Generalization of Nemhauser and Trotter's Local Optimization Theorem. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09), Freiburg, Germany. February 2009.
Hannes Moser		Problem Kernelization for Graph Packing. In Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09), Špindlerův Mlýn, Czech Republic, January 2009. Lecture Notes in Computer Science, Springer. To appear.
Falk Hüffner Christian Komusiewicz Hannes Moser Rolf Niedermeier		Enumerating Isolated Cliques in Synthetic and Financial Networks. In Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), St. John's, Newfoundland, Canada. August 2008. Volume 5165 in Lecture Notes in Computer Science, pages 405–416, Springer (Original Publication).
Falk Hüffner Christian Komusiewicz Hannes Moser Rolf Niedermeier		Fixed-Parameter Algorithms for Cluster Vertex Deletion. In Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN'08), Búzios, Brazil. April 2008. Volume 4957 in Lecture Notes in Computer Science, pages 711–722, Springer (Original Publication).
Hannes Moser Venkatesh Raman Somnath Sikdar		The Parameterized Complexity of the Unique Coverage Problem. In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC'07), Sendai, Japan. December 2007. Volume 4835 in Lecture Notes in Computer Science, pages 621–631, Springer (Original Publication).
Hannes Moser Somnath Sikdar		The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. In Proceedings of the 2007 International Frontiers in Algorithmics Workshop (FAW'07), Lanzhou, China. August 2007. Volume 4613 in Lecture Notes in Computer Science, pages 325–336, Springer (Original Publication).
Christian Komusiewicz Falk Hüffner Hannes Moser Rolf Niedermeier		Isolation Concepts for Enumerating Dense Subgraphs. In Proceedings of the 13th International Computing and Combinatorics Conference (COCOON'07), Banff, Canada. July 2007. Volume 4598 in Lecture Notes in Computer Science, pages 140–150, Springer (Original Publication).
Hannes Moser Dimitrios M. Thilikos		Parameterized Complexity of Finding Regular Induced Subgraphs. Proceedings of the 2nd Algorithms and Complexity in Durham workshop (ACiD'06), Durham, England, September 2006. In Texts in Algorithmics, College Publications, 2006.

Thesis

Hannes Moser

Exact Algorithms for Generalizations of Vertex Cover. Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, 2005.

Talks

		Enumerating Isolated Cliques in Synthetic and Financial Networks. Talk held at the 2008 Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), St. John's, Newfoundland, Canada, August 21–24, 2008.
		The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. Talk held at the 2007 International Frontiers in Algorithmics Workshop (FAW'07), Lanzhou, China, August 01–03, 2007.
		Iterative Compression: Some Case Studies. Talk held at the Colloquium of the DFG-Schwerpunkt 1126 “Algorithms on large and complex networks”, Freiburg, Germany, July 04–06, 2007.
		Parameterized Complexity of Finding Regular Induced Subgraphs. Talk held at the 2nd Algorithms and Complexity in Durham Workshop (ACID'06), Durham, England, September 18–20, 2006.
		Experiments: Test Design. Talk held at the GI-Dagstuhl Research Seminar 06362 “Algorithm Engineering”, Dagstuhl, Germany, September 4–8, 2006.
		Iterative Compression for Solving Hard Network Problems. Talk held at the Colloquium of the DFG-Schwerpunkt 1126 “Algorithms on large and complex networks”, Aachen, Germany, June 12–14, 2006.