Get started
Author

Hannes Moser

Fixed-Parameter Algorithms for Cluster Vertex Deletion
2008 · Falk Hüffner, Christian Komusiewicz, et al. · Theory of Computing Systems · 121
A generalization of Nemhauser and Trotterʼs local optimization theorem
2010 · Michael R. Fellows, Jiong Guo, et al. · Journal of Computer and System Sciences · 97
Parameterized complexity of finding regular induced subgraphs
2008 · Hannes Moser, Dimitrios M. Thilikos · Journal of Discrete Algorithms · 96
PDF
Parameterized computational complexity of finding small-diameter subgraphs
2011 · Alexander Schäfer, Christian Komusiewicz, et al. · Optimization Letters · 78
The parameterized complexity of the induced matching problem
2008 · Hannes Moser, Somnath Sikdar · Discrete Applied Mathematics · 78
Isolation concepts for efficiently enumerating dense subgraphs
2009 · Christian Komusiewicz, Falk Hüffner, et al. · Theoretical Computer Science · 55
Exact combinatorial algorithms and experiments for finding maximum k-plexes
2011 · Hannes Moser, Rolf Niedermeier, et al. · Journal of Combinatorial Optimization · 54
On Generating Triangle-Free Graphs
2009 · Daniel Brügmann, Christian Komusiewicz, et al. · Electronic Notes in Discrete Mathematics · 47
A Problem Kernelization for Graph Packing
2009 · Hannes Moser · Lecture notes in computer science · 42
Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion
2011 · René van Bevern, Hannes Moser, et al. · Algorithmica · 36
PDF
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
2009 · Jiong Guo, Hannes Moser, et al. · Lecture notes in computer science · 33
Feedback arc set in bipartite tournaments is NP-complete
2007 · Jiong Guo, Falk Hüffner, et al. · Information Processing Letters · 32
Efficient Algorithms for Eulerian Extension and Rural Postman
2013 · Frederic Dorn, Hannes Moser, et al. · SIAM Journal on Discrete Mathematics · 30
Measuring Indifference: Unit Interval Vertex Deletion
2010 · René van Bevern, Christian Komusiewicz, et al. · Lecture notes in computer science · 27
Fixed-Parameter Algorithms for Cluster Vertex Deletion
2008 · Falk Hüffner, Christian Komusiewicz, et al. · Springer eBooks · 23
Isolation concepts for clique enumeration: Comparison and computational experiments
2009 · Falk Hüffner, Christian Komusiewicz, et al. · Theoretical Computer Science · 22
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
2007 · Hannes Moser, Somnath Sikdar · Springer eBooks · 20
Algorithms and Experiments for Clique Relaxations—Finding Maximum s-Plexes
2009 · Hannes Moser, Rolf Niedermeier, et al. · Lecture notes in computer science · 17
The Parameterized Complexity of the Unique Coverage Problem
2007 · Hannes Moser, Venkatesh Raman, et al. · Springer eBooks · 15
The Parameterized Complexity of Unique Coverage and Its Variants
2011 · Neeldhara Misra, Hannes Moser, et al. · Algorithmica · 14
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
2011 · Michael R. Fellows, Jiong Guo, et al. · ACM Transactions on Computation Theory · 11
Efficient Algorithms for Eulerian Extension
2010 · Frederic Dorn, Hannes Moser, et al. · Lecture notes in computer science · 10
Enumerating Isolated Cliques in Synthetic and Financial Networks
2008 · Falk Hüffner, Christian Komusiewicz, et al. · Lecture notes in computer science · 10
Isolation Concepts for Enumerating Dense Subgraphs
2007 · Christian Komusiewicz, Falk Hüffner, et al. · Lecture notes in computer science · 9
Kernelization through Tidying: A Case Study Based on s-Plex Cluster Vertex Deletion
2010 · René van Bevern, Hannes Moser, et al. · Lecture notes in computer science · 6
Works count: 36
Citation count: 993
H-index: 17
I10-index: 23
Year
Topic
Type