Hannes Moser

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