dblp.uni-trier.dewww.uni-trier.de

Hannes Moser Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
18EEJiong Guo, Hannes Moser, Rolf Niedermeier: Iterative Compression for Exactly Solving NP-Hard Minimization Problems. Algorithmics of Large and Complex Networks 2009: 65-80
17EEMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330
16EEHannes Moser, Rolf Niedermeier, Manuel Sorge: Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. SEA 2009: 233-244
15EEHannes Moser: A Problem Kernelization for Graph Packing. SOFSEM 2009: 401-412
14EEMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420
13EEMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem CoRR abs/0902.2149: (2009)
12EEHannes Moser, Somnath Sikdar: The parameterized complexity of the induced matching problem. Discrete Applied Mathematics 157(4): 715-727 (2009)
11EEDaniel Brügmann, Christian Komusiewicz, Hannes Moser: On Generating Triangle-Free Graphs. Electronic Notes in Discrete Mathematics 32: 51-58 (2009)
10EEHannes Moser, Dimitrios M. Thilikos: Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms 7(2): 181-190 (2009)
9EEChristian 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
8EEFalk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416
7EEFalk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722
2007
6EEChristian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier: Isolation Concepts for Enumerating Dense Subgraphs. COCOON 2007: 140-150
5EEHannes Moser, Somnath Sikdar: The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. FAW 2007: 325-336
4EEHannes Moser, Venkatesh Raman, Somnath Sikdar: The Parameterized Complexity of the Unique Coverage Problem. ISAAC 2007: 621-631
3EEJiong 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

Coauthor Index

1Daniel Brügmann [11]
2Michael R. Fellows (Mike Fellows) [13] [14] [17]
3Jiong Guo [3] [13] [14] [17] [18]
4Falk Hüffner [3] [6] [7] [8] [9]
5Christian Komusiewicz [6] [7] [8] [9] [11]
6Rolf Niedermeier [6] [7] [8] [9] [13] [14] [16] [17] [18]
7Venkatesh Raman [4]
8Somnath Sikdar [4] [5] [12]
9Manuel Sorge [16]
10Dimitrios M. Thilikos [2] [10]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)