Hannes Moser

Available identifiers

zbMath Open moser.hannesWikidataQ102425129 ScholiaQ102425129MaRDI QIDQ471186

List of research outcomes

Publication	Date of Publication	Type
A complexity dichotomy for finding disjoint solutions of vertex deletion problems	2015-09-24	Paper
Exploiting a hypergraph model for finding Golomb rulers	2014-11-14	Paper
The parameterized complexity of unique coverage and its variants	2013-08-05	Paper
On generating triangle-free graphs	2013-07-04	Paper
Efficient algorithms for Eulerian extension and rural Postman	2013-06-27	Paper
Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes	2013-01-03	Paper
Parameterized computational complexity of finding small-diameter subgraphs	2012-11-07	Paper
Exploiting a Hypergraph Model for Finding Golomb Rulers	2012-11-02	Paper
Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion	2012-04-26	Paper
A generalization of Nemhauser and Trotter's local optimization theorem	2012-04-24	Paper
A generalization of Nemhauser and Trotter's local optimization theorem	2012-01-11	Paper
Efficient algorithms for Eulerian extension	2010-11-16	Paper
Measuring indifference: unit interval vertex deletion	2010-11-16	Paper
Fixed-parameter algorithms for cluster vertex deletion	2010-08-13	Paper
Kernelization through Tidying	2010-04-27	Paper
Feedback arc set in bipartite tournaments is NP-complete	2010-01-29	Paper
Isolation concepts for clique enumeration: comparison and computational experiments	2009-11-25	Paper
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems	2009-10-16	Paper
Isolation concepts for efficiently enumerating dense subgraphs	2009-09-10	Paper
Iterative Compression for Exactly Solving NP-Hard Minimization Problems	2009-07-09	Paper
The parameterized complexity of the induced matching problem	2009-06-30	Paper
Parameterized complexity of finding regular induced subgraphs	2009-06-24	Paper
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs	2009-03-10	Paper
Isolation Concepts for Enumerating Dense Subgraphs	2009-03-06	Paper
A Problem Kernelization for Graph Packing	2009-02-03	Paper
Enumerating Isolated Cliques in Synthetic and Financial Networks	2009-01-27	Paper
The Parameterized Complexity of the Unique Coverage Problem	2008-05-27	Paper
Fixed-Parameter Algorithms for Cluster Vertex Deletion	2008-04-15	Paper

Research outcomes over time

This page was built for person: Hannes Moser