 | 2009 |
|---|
| 18 |       | Jiong Guo,
Hannes Moser,
Rolf Niedermeier:
Iterative Compression for Exactly Solving NP-Hard Minimization Problems.
Algorithmics of Large and Complex Networks 2009: 65-80 |
| 17 | | Michael R. Fellows,
Jiong Guo,
Hannes Moser,
Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
MFCS 2009: 319-330 |
| 16 | | Hannes Moser,
Rolf Niedermeier,
Manuel Sorge:
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes.
SEA 2009: 233-244 |
| 15 | | Hannes Moser:
A Problem Kernelization for Graph Packing.
SOFSEM 2009: 401-412 |
| 14 | | Michael R. Fellows,
Jiong Guo,
Hannes Moser,
Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem.
STACS 2009: 409-420 |
| 13 | | Michael R. Fellows,
Jiong Guo,
Hannes Moser,
Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem
CoRR abs/0902.2149: (2009) |
| 12 | | Hannes Moser,
Somnath Sikdar:
The parameterized complexity of the induced matching problem.
Discrete Applied Mathematics 157(4): 715-727 (2009) |
| 11 | | Daniel Brügmann,
Christian Komusiewicz,
Hannes Moser:
On Generating Triangle-Free Graphs.
Electronic Notes in Discrete Mathematics 32: 51-58 (2009) |
| 10 | | Hannes Moser,
Dimitrios M. Thilikos:
Parameterized complexity of finding regular induced subgraphs.
J. Discrete Algorithms 7(2): 181-190 (2009) |
| 9 | | Christian Komusiewicz,
Falk Hüffner,
Hannes Moser,
Rolf Niedermeier:
Isolation concepts for efficiently enumerating dense subgraphs.
Theor. Comput. Sci. 410(38-40): 3640-3654 (2009) |
| 2008 |
|---|
| 8 | | Falk Hüffner,
Christian Komusiewicz,
Hannes Moser,
Rolf Niedermeier:
Enumerating Isolated Cliques in Synthetic and Financial Networks.
COCOA 2008: 405-416 |
| 7 | | Falk Hüffner,
Christian Komusiewicz,
Hannes Moser,
Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion.
LATIN 2008: 711-722 |
| 2007 |
|---|
| 6 | | Christian Komusiewicz,
Falk Hüffner,
Hannes Moser,
Rolf Niedermeier:
Isolation Concepts for Enumerating Dense Subgraphs.
COCOON 2007: 140-150 |
| 5 | | Hannes Moser,
Somnath Sikdar:
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs.
FAW 2007: 325-336 |
| 4 | | Hannes Moser,
Venkatesh Raman,
Somnath Sikdar:
The Parameterized Complexity of the Unique Coverage Problem.
ISAAC 2007: 621-631 |
| 3 | | Jiong Guo,
Falk Hüffner,
Hannes Moser:
Feedback arc set in bipartite tournaments is NP-complete.
Inf. Process. Lett. 102(2-3): 62-65 (2007) |
| 2006 |
|---|
| 2 |  | Hannes Moser,
Dimitrios M. Thilikos:
Parameterized Complexity of Finding Regular Induced Subgraphs.
ACiD 2006: 107-118 |
| 2005 |
|---|
| 1 | | Hannes Moser:
System J - Konzeption und prototypische Umsetzung eines Praktikums zur Datenbanksystementwicklung.
BTW Studierenden-Programm 2005: 29-31 |
