Hannes Moser

According to our database1, Hannes Moser
  • authored at least 34 papers between 2005 and 2014.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2014
Exploiting a hypergraph model for finding Golomb rulers.
Acta Inf., 2014

2013
Efficient Algorithms for Eulerian Extension and Rural Postman.
SIAM J. Discrete Math., 2013

The Parameterized Complexity of Unique Coverage and Its Variants.
Algorithmica, 2013

2012
Parameterized computational complexity of finding small-diameter subgraphs.
Optimization Letters, 2012

Exact combinatorial algorithms and experiments for finding maximum k-plexes.
J. Comb. Optim., 2012

Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion.
Algorithmica, 2012

Exploiting a Hypergraph Model for Finding Golomb Rulers.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
TOCT, 2011

A generalization of Nemhauser and Trotterʼs local optimization theorem.
J. Comput. Syst. Sci., 2011

2010
Finding optimal solutions for covering and matching problems.
PhD thesis, 2010

Fixed-Parameter Algorithms for Cluster Vertex Deletion.
Theory Comput. Syst., 2010

Efficient Algorithms for Eulerian Extension.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Measuring Indifference: Unit Interval Vertex Deletion.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Kernelization through Tidying.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Experiments.
Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009
Isolation concepts for efficiently enumerating dense subgraphs.
Theor. Comput. Sci., 2009

Isolation concepts for clique enumeration: Comparison and computational experiments.
Theor. Comput. Sci., 2009

Parameterized complexity of finding regular induced subgraphs.
J. Discrete Algorithms, 2009

On Generating Triangle-Free Graphs.
Electronic Notes in Discrete Mathematics, 2009

The parameterized complexity of the induced matching problem.
Discrete Applied Mathematics, 2009

A Generalization of Nemhauser and Trotter's Local Optimization Theorem
CoRR, 2009

Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

A Generalization of Nemhauser and Trotter's Local Optimization Theorem.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

A Problem Kernelization for Graph Packing.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Iterative Compression for Exactly Solving NP-Hard Minimization Problems.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008
Fixed-Parameter Algorithms for Cluster Vertex Deletion.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Enumerating Isolated Cliques in Synthetic and Financial Networks.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Feedback arc set in bipartite tournaments is NP-complete.
Inf. Process. Lett., 2007

The Parameterized Complexity of the Unique Coverage Problem.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

The Parameterized Complexity of the Induced Matching Problem in Planar Graphs.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

Isolation Concepts for Enumerating Dense Subgraphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Parameterized Complexity of Finding Regular Induced Subgraphs.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005
System J - Konzeption und prototypische Umsetzung eines Praktikums zur Datenbanksystementwicklung.
Proceedings of the Beitragsband zum Studierenden-Programm bei der 11. Fachtagung "Datenbanken für Business, 2005


  Loading...