Reflections on multivariate algorithmics and problem parameterization
R Niedermeier - … Symposium on Theoretical Aspects of Computer …, 2010 - drops.dagstuhl.de
Research on parameterized algorithmics for NP-hard problems has steadily grown over the
last years. We survey and discuss how parameterized complexity analysis naturally …
last years. We survey and discuss how parameterized complexity analysis naturally …
Upper and lower bounds for finding connected motifs in vertex-colored graphs
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a
motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices …
motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices …
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
M Dom, J Guo, R Niedermeier - Journal of Computer and System Sciences, 2010 - Elsevier
We develop an algorithmically useful refinement of a forbidden submatrix characterization of
0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds …
0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds …
[HTML][HTML] Deconstructing intractability—a multivariate complexity analysis of interval constrained coloring
C Komusiewicz, R Niedermeier, J Uhlmann - Journal of Discrete Algorithms, 2011 - Elsevier
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of
experimental data in biochemistry dealing with protein fragments. Given a set of m integer …
experimental data in biochemistry dealing with protein fragments. Given a set of m integer …
The driving regulators of the connectivity protein network of brain malignancies
A Tahmassebi, K Pinker-Domenig… - Smart Biomedical …, 2017 - spiedigitallibrary.org
An important problem in modern therapeutics at the proteomic level remains to identify
therapeutic targets in a plentitude of high-throughput data from experiments relevant to a …
therapeutic targets in a plentitude of high-throughput data from experiments relevant to a …
A faster algorithm for finding minimum Tucker submatrices
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in
such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are …
such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are …
Integer linear programming in computational biology
Computational molecular biology (bioinformatics) is a young research field that is rich in NP-
hard optimization problems. The problem instances encountered are often huge and …
hard optimization problems. The problem instances encountered are often huge and …
Deconstructing intractability: A case study for interval constrained coloring
C Komusiewicz, R Niedermeier, J Uhlmann - Annual Symposium on …, 2009 - Springer
Abstract The NP-hard Interval Constrained Coloring problem appears in the interpretation of
experimental data in biochemistry dealing with protein fragments. Given a set of m integer …
experimental data in biochemistry dealing with protein fragments. Given a set of m integer …
Approximating the interval constrained coloring problem
E Althaus, S Canzar, K Elbassioni… - … Workshop on Algorithm …, 2008 - Springer
We consider the interval constrained coloring problem, which appears in the interpretation of
experimental data in biochemistry. Monitoring hydrogen-deuterium exchange rates via mass …
experimental data in biochemistry. Monitoring hydrogen-deuterium exchange rates via mass …
A faster algorithm for finding minimum Tucker submatrices
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in
such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are …
such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are …