|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | René van Bevern, Hannes Moser, Rolf Niedermeier |
Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. |
TOCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
A generalization of Nemhauser and Trotterʼs local optimization theorem. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser |
Finding optimal solutions for covering and matching problems. |
|
2010 |
RDF |
|
| 1 | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
Fixed-Parameter Algorithms for Cluster Vertex Deletion. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller |
Efficient Algorithms for Eulerian Extension. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
Measuring Indifference: Unit Interval Vertex Deletion. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | René van Bevern, Hannes Moser, Rolf Niedermeier |
Kernelization through Tidying. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Berberich, Matthias Hagen, Benjamin Hiller, Hannes Moser |
Experiments. |
Algorithm Engineering |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Brügmann, Christian Komusiewicz, Hannes Moser |
On Generating Triangle-Free Graphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier |
Isolation concepts for efficiently enumerating dense subgraphs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
Isolation concepts for clique enumeration: Comparison and computational experiments. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
A Generalization of Nemhauser and Trotter's Local Optimization Theorem |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Hannes Moser, Somnath Sikdar |
The parameterized complexity of the induced matching problem. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser, Dimitrios M. Thilikos |
Parameterized complexity of finding regular induced subgraphs. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser, Rolf Niedermeier, Manuel Sorge |
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. |
SEA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Hannes Moser, Rolf Niedermeier |
Iterative Compression for Exactly Solving NP-Hard Minimization Problems. |
Algorithmics of Large and Complex Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser |
A Problem Kernelization for Graph Packing. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
Fixed-Parameter Algorithms for Cluster Vertex Deletion. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
Enumerating Isolated Cliques in Synthetic and Financial Networks. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Falk Hüffner, Hannes Moser |
Feedback arc set in bipartite tournaments is NP-complete. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser, Somnath Sikdar |
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. |
FAW |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier |
Isolation Concepts for Enumerating Dense Subgraphs. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser, Venkatesh Raman, Somnath Sikdar |
The Parameterized Complexity of the Unique Coverage Problem. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser, Dimitrios M. Thilikos |
Parameterized Complexity of Finding Regular Induced Subgraphs. |
ACiD |
2006 |
DBLP BibTeX RDF |
|
| 1 | Hannes Moser |
System J - Konzeption und prototypische Umsetzung eines Praktikums zur Datenbanksystementwicklung. |
BTW Studierenden-Programm |
2005 |
DBLP BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")