Hannes Moser

Publication Activity (10 Years)

Years Active: 2005-2014
Publications (10 Years): 0

Top Venues

Algorithmica

J. Comb. Optim.

ISCO

Acta Informatica

Friedrich Schiller University of Jena (PHD)

Education History

Friedrich Schiller University of Jena

PHD

Publications

Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller
Exploiting a hypergraph model for finding Golomb rulers. Acta Informatica 51 (7) (2014)
Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica 65 (3) (2013)
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM J. Discret. Math. 27 (1) (2013)
Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller
Exploiting a Hypergraph Model for Finding Golomb Rulers. ISCO (2012)
Hannes Moser, Rolf Niedermeier, Manuel Sorge
Exact combinatorial algorithms and experiments for finding maximum k-plexes. J. Comb. Optim. 24 (3) (2012)
Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. 6 (5) (2012)
René van Bevern, Hannes Moser, Rolf Niedermeier
Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. Algorithmica 62 (3-4) (2012)
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. ACM Trans. Comput. Theory 2 (2) (2011)
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
A generalization of Nemhauser and Trotterʼs local optimization theorem. J. Comput. Syst. Sci. 77 (6) (2011)
René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
Measuring Indifference: Unit Interval Vertex Deletion. WG (2010)
Eric Berberich, Matthias Hagen, Benjamin Hiller, Hannes Moser
Experiments. Algorithm Engineering (2010)
René van Bevern, Hannes Moser, Rolf Niedermeier
Kernelization through Tidying. LATIN (2010)
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. 47 (1) (2010)
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
Efficient Algorithms for Eulerian Extension. WG (2010)
Hannes Moser, Dimitrios M. Thilikos
Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms 7 (2) (2009)
Hannes Moser, Rolf Niedermeier, Manuel Sorge
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. SEA (2009)
Hannes Moser
A Problem Kernelization for Graph Packing. SOFSEM (2009)
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
Isolation concepts for clique enumeration: Comparison and computational experiments. Theor. Comput. Sci. 410 (52) (2009)
Daniel Brügmann, Christian Komusiewicz, Hannes Moser
On Generating Triangle-Free Graphs. Electron. Notes Discret. Math. 32 (2009)
Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier
Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. 410 (38-40) (2009)
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS (2009)
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
A Generalization of Nemhauser and Trotter's Local Optimization Theorem CoRR (2009)
Jiong Guo, Hannes Moser, Rolf Niedermeier
Iterative Compression for Exactly Solving NP-Hard Minimization Problems. Algorithmics of Large and Complex Networks (2009)
Hannes Moser, Somnath Sikdar
The parameterized complexity of the induced matching problem. Discret. Appl. Math. 157 (4) (2009)
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS (2009)
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA (2008)
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN (2008)
Jiong Guo, Falk Hüffner, Hannes Moser
Feedback arc set in bipartite tournaments is NP-complete. Inf. Process. Lett. 102 (2-3) (2007)
Hannes Moser, Venkatesh Raman, Somnath Sikdar
The Parameterized Complexity of the Unique Coverage Problem. ISAAC (2007)
Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier
Isolation Concepts for Enumerating Dense Subgraphs. COCOON (2007)
Hannes Moser, Somnath Sikdar
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. FAW (2007)
Hannes Moser, Dimitrios M. Thilikos
Parameterized Complexity of Finding Regular Induced Subgraphs. ACiD (2006)
Hannes Moser
System J - Konzeption und prototypische Umsetzung eines Praktikums zur Datenbanksystementwicklung. BTW Studierenden-Programm (2005)

Hannes Moser.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hannes Moser