Concepedia

Hannes Moser

HM

16

Publications

740

Citations

14

H-Index

2006

Active since

Affiliations

Friedrich Schiller University Jena(Current)

Technische Universität Berlin

National and Kapodistrian University of Athens

Charles Darwin University

Institute of Mathematical Sciences

Hannes Moser is an author at Friedrich Schiller University Jena specializing in combinatorial optimization, engineering, and discrete mathematics.

Top concepts

Combinatorial OptimizationEngineeringGraph TheoryDiscrete MathematicsComputer ScienceComputational ComplexityMathematical ProgrammingBusinessGraph ProcessingNetwork Analysis

Publications per year

2006–2016

16

Publications

16

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Falk Hüffner, Christian Komusiewicz, Hannes Moser et al. · Theory of Computing Systems · 2008 · 114 citations

Cluster Computing, Cluster Vertex Deletion, Graph Theory +7

A generalization of Nemhauser and Trotterʼs local optimization theorem

Michael R. Fellows, Jiong Guo, Hannes Moser et al. · Journal of Computer and System Sciences · 2010 · 88 citations

Mathematical Programming, Continuous Optimization, Engineering +3

Parameterized complexity of finding regular induced subgraphs

Hannes Moser, Dimitrios M. Thilikos · Journal of Discrete Algorithms · 2008 · 78 citations

Mathematical Programming, Engineering, Graph Theory +7

The parameterized complexity of the induced matching problem

Hannes Moser, Somnath Sikdar · Discrete Applied Mathematics · 2008 · 76 citations

Mathematical Programming, Engineering, Matching Technique +7

Parameterized computational complexity of finding small-diameter subgraphs

Alexander Schäfer, Christian Komusiewicz, Hannes Moser et al. · Optimization Letters · 2011 · 72 citations

Engineering, Graph Theory, Structural Graph Theory +9

Rows per page

1–5 of 16