| 2010 | LATIN | Kernelization through Tidying. | Ren van Bevern, Hannes Moser, Rolf Niedermeier |
| 2010 | WG | Measuring Indifference: Unit Interval Vertex Deletion. | Ren van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 2010 | WG | Efficient Algorithms for Eulerian Extension. | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller |
| 2009 | MFCS | A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
| 2009 | STACS | A Generalization of Nemhauser and Trotter's Local Optimization Theorem. | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
| 2009 | SOFSEM | A Problem Kernelization for Graph Packing. | Hannes Moser |
| 2008 | COCOA | Enumerating Isolated Cliques in Synthetic and Financial Networks. | Falk Hffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 2008 | LATIN | Fixed-Parameter Algorithms for Cluster Vertex Deletion. | Falk Hffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 2007 | COCOON | Isolation Concepts for Enumerating Dense Subgraphs. | Christian Komusiewicz, Falk Hffner, Hannes Moser, Rolf Niedermeier |
| 2007 | FAW | The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. | Hannes Moser, Somnath Sikdar |
| 2007 | ISAAC | The Parameterized Complexity of the Unique Coverage Problem. | Hannes Moser, Venkatesh Raman, Somnath Sikdar |
| 2005 | BTW | System J - Konzeption und prototypische Umsetzung eines Praktikums zur Datenbanksystementwicklung. | Hannes Moser |