Hannes Moser

Optim. Lett., 2012

Exact combinatorial algorithms and experiments for finding maximum k-plexes.

[BibT_eX]

[DOI]

Manuel Sorge

J. Comb. Optim., 2012

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

[BibT_eX]

[DOI]

René van Bevern

Algorithmica, 2012

2011

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

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2011

A generalization of Nemhauser and Trotterʼs local optimization theorem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

2010

Finding optimal solutions for covering and matching problems.

[BibT_eX]

[DOI]

PhD thesis, 2010

Fixed-Parameter Algorithms for Cluster Vertex Deletion.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Efficient Algorithms for Eulerian Extension.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Measuring Indifference: Unit Interval Vertex Deletion.

[BibT_eX]

[DOI]

René van Bevern

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Kernelization through Tidying.

[BibT_eX]

[DOI]

René van Bevern

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Experiments.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Isolation concepts for clique enumeration: Comparison and computational experiments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Parameterized complexity of finding regular induced subgraphs.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

J. Discrete Algorithms, 2009

On Generating Triangle-Free Graphs.

[BibT_eX]

[DOI]

Daniel Brügmann

Electron. Notes Discret. Math., 2009

The parameterized complexity of the induced matching problem.

[BibT_eX]

[DOI]

Somnath Sikdar

Discret. Appl. Math., 2009

Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes.

[BibT_eX]

[DOI]

Manuel Sorge

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

A Generalization of Nemhauser and Trotter's Local Optimization Theorem.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

A Problem Kernelization for Graph Packing.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Iterative Compression for Exactly Solving NP-Hard Minimization Problems.

[BibT_eX]

[DOI]

Jiong Guo

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

Enumerating Isolated Cliques in Synthetic and Financial Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Feedback arc set in bipartite tournaments is NP-complete.

[BibT_eX]

[DOI]

Jiong Guo

Inf. Process. Lett., 2007

The Parameterized Complexity of the Unique Coverage Problem.

[BibT_eX]

[DOI]

Venkatesh Raman

Somnath Sikdar

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

The Parameterized Complexity of the Induced Matching Problem in Planar Graphs.

[BibT_eX]

[DOI]

Somnath Sikdar

Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

Isolation Concepts for Enumerating Dense Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2005

System J - Konzeption und prototypische Umsetzung eines Praktikums zur Datenbanksystementwicklung.

[BibT_eX]