Johannes Uhlmann

Algorithmica, 2014

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

Two-Layer Planarization parameterized by feedback edge set.

[BibT_eX]

[DOI]

Mathias Weller

Theor. Comput. Sci., 2013

On tractable cases of Target Set Selection.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2013

On the Computation of Fully Proportional Representation.

[BibT_eX]

[DOI]

Nadja Betzler

Arkadii Slinko

J. Artif. Intell. Res., 2013

2012

On making directed graphs transitive.

[BibT_eX]

[DOI]

Mathias Weller

J. Comput. Syst. Sci., 2012

Cluster editing with locally bounded modifications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

On Bounded-Degree Vertex Deletion parameterized by treewidth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Partitioning into Colorful Components by Minimum Edge Deletions.

[BibT_eX]

[DOI]

Sharon Bruckner

Falk Hüffner

Sven Thiel

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Multivariate Algorithmics in Biological Data Analysis.

[BibT_eX]

[DOI]

PhD thesis, 2011

Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Graph-based data clustering with overlaps.

[BibT_eX]

[DOI]

Michael R. Fellows

Discret. Optim., 2011

Exploiting bounded signal flow for graph orientation based on cause-effect pairs.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2011

Editing Graphs into Disjoint Unions of Dense Clusters.

[BibT_eX]

[DOI]

Iyad A. Kanj

Algorithmica, 2011

Alternative Parameterizations for Cluster Editing.

[BibT_eX]

[DOI]

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

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.

[BibT_eX]

[DOI]

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

2010

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Kernelization and complexity results for connectivity augmentation problems.

[BibT_eX]

[DOI]

Networks, 2010

Extended Islands of Tractability for Parsimony Haplotyping.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Exact Algorithms and Experiments for Hierarchical Tree Clustering.

[BibT_eX]

[DOI]

Sepp Hartung

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Parameterized complexity of candidate control in elections and related digraph problems.

[BibT_eX]

[DOI]

Nadja Betzler

Theor. Comput. Sci., 2009

Deconstructing Intractability: A Case Study for Interval Constrained Coloring.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Two fixed-parameter algorithms for Vertex Covering by Paths on Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

2006

Complexity and Exact Algorithms for Multicut.

[BibT_eX]

[DOI]

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

2004

Tree Decompositions of Graphs: Saving Memory in Dynamic Programming.

[BibT_eX]

[DOI]

Nadja Betzler