Hannes Moser

From MaRDI portal
Person:471186

Available identifiers

zbMath Open moser.hannesWikidataQ102425129 ScholiaQ102425129MaRDI QIDQ471186

List of research outcomes





PublicationDate of PublicationType
A complexity dichotomy for finding disjoint solutions of vertex deletion problems2015-09-24Paper
Exploiting a hypergraph model for finding Golomb rulers2014-11-14Paper
The parameterized complexity of unique coverage and its variants2013-08-05Paper
On generating triangle-free graphs2013-07-04Paper
Efficient algorithms for Eulerian extension and rural Postman2013-06-27Paper
Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes2013-01-03Paper
Parameterized computational complexity of finding small-diameter subgraphs2012-11-07Paper
Exploiting a Hypergraph Model for Finding Golomb Rulers2012-11-02Paper
Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion2012-04-26Paper
A generalization of Nemhauser and Trotter's local optimization theorem2012-04-24Paper
A generalization of Nemhauser and Trotter's local optimization theorem2012-01-11Paper
Efficient algorithms for Eulerian extension2010-11-16Paper
Measuring indifference: unit interval vertex deletion2010-11-16Paper
Fixed-parameter algorithms for cluster vertex deletion2010-08-13Paper
Kernelization through Tidying2010-04-27Paper
Feedback arc set in bipartite tournaments is NP-complete2010-01-29Paper
Isolation concepts for clique enumeration: comparison and computational experiments2009-11-25Paper
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems2009-10-16Paper
Isolation concepts for efficiently enumerating dense subgraphs2009-09-10Paper
Iterative Compression for Exactly Solving NP-Hard Minimization Problems2009-07-09Paper
The parameterized complexity of the induced matching problem2009-06-30Paper
Parameterized complexity of finding regular induced subgraphs2009-06-24Paper
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs2009-03-10Paper
Isolation Concepts for Enumerating Dense Subgraphs2009-03-06Paper
A Problem Kernelization for Graph Packing2009-02-03Paper
Enumerating Isolated Cliques in Synthetic and Financial Networks2009-01-27Paper
The Parameterized Complexity of the Unique Coverage Problem2008-05-27Paper
Fixed-Parameter Algorithms for Cluster Vertex Deletion2008-04-15Paper

Research outcomes over time

This page was built for person: Hannes Moser