Jens Gramm

发表

On the complexity of SNP block partitioning under the perfect phylogeny model

Roded Sharan, Jens Gramm, Tzvika Hartman, 2009, Discret. Math..

Closest Substring

Jens Gramm, 2016, Encyclopedia of Algorithms.

Towards an Information Security Framework for the Automotive Domain

Benjamin Glas, Jens Gramm, Priyamvadha Vembar, 2014, Automotive - Safety & Security.

Haplotyping with missing data via perfect path phylogenies

Roded Sharan, Jens Gramm, Till Nierhoff, 2007, Discret. Appl. Math..

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2004, Algorithmica.

Data reduction and exact algorithms for clique cover

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2009, JEAL.

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Rolf Niedermeier, Falk Hüffner, Sebastian Wernicke, 2006, J. Comput. Syst. Sci..

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

Rolf Niedermeier, Falk Hüffner, Sebastian Wernicke, 2005, WADS.

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

Rolf Niedermeier, Peter Rossmanith, Edward A. Hirsch, 2003, Discret. Appl. Math..

Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time

Rolf Niedermeier, Jochen Alber, Jiong Guo, 2002, CPM.

On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model

Roded Sharan, Jens Gramm, Tzvika Hartman, 2006, WABI.

On Exact and Approximation Algorithms for Distinguishing Substring Selection

Rolf Niedermeier, Jiong Guo, Jens Gramm, 2003, FCT.

New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT

Rolf Niedermeier, Peter Rossmanith, Edward A. Hirsch, 2000, Electron. Colloquium Comput. Complex..

Fixed-parameter Algorithms in Phylogenetics

Jens Gramm, Till Tantau, Arfst Nickelsen, 2022 .

Closest Strings, Primer Design, and Motif Search

Rolf Niedermeier, Falk Hüffner, Jens Gramm, 2010 .

Exact Solutions for CLOSEST STRING and Related Problems

Rolf Niedermeier, Peter Rossmanith, Jens Gramm, 2001, ISAAC.

Algorithms for compact letter displays: Comparison and evaluation

Rolf Niedermeier, Falk Hüffner, Hans-Peter Piepho, 2007, Comput. Stat. Data Anal..

Automated Generation of Search Tree Algorithms for Graph Modification Problems

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2003, ESA.

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions

Rolf Niedermeier, Sebastian Wernicke, Jochen Alber, 2006, Int. J. Found. Comput. Sci..

A fixed-parameter algorithm for minimum quartet inconsistency

Rolf Niedermeier, Jens Gramm, R. Niedermeier, 2003, J. Comput. Syst. Sci..

Steiner Tree Problems in the Analysis of Biological Networks

Rolf Niedermeier, Klaus-Jörn Lange, Jens Gramm, 2006 .

Faster exact algorithms for hard problems: A parameterized point of view

Rolf Niedermeier, Jochen Alber, Jens Gramm, 2001, Discret. Math..

Fixed-Parameter Algorithms in Phylogenetics

Jens Gramm, Till Tantau, Arfst Nickelsen, 2007, Comput. J..

Minimum Quartet Inconsistency Is Fixed Parameter Tractable

Rolf Niedermeier, Jens Gramm, R. Niedermeier, 2001, CPM.

Fixed-parameter algorithms for the consensus analysis of genomic data

Jens Gramm, 2003 .

Multiplexing schemes for generic SNP genotyping assays.

Roded Sharan, Jens Gramm, Zohar Yakhini, 2005, Journal of computational biology : a journal of computational molecular cell biology.

Pattern matching for arc-annotated sequences

Rolf Niedermeier, Jiong Guo, Jens Gramm, 2006, TALG.

Avoiding Forbidden Submatrices by Row Deletions

Rolf Niedermeier, Sebastian Wernicke, Jochen Alber, 2004, SOFSEM.

On The Parameterized Intractability Of Motif Search Problems*

Rolf Niedermeier, Michael R. Fellows, Jens Gramm, 2002, Comb..

On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems

Rolf Niedermeier, Michael R. Fellows, Jens Gramm, 2002, STACS.

A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns

Jens Gramm, 2004, IEEE ACM Trans. Comput. Biol. Bioinform..

Closest Substring

Jens Gramm, 2008, Encyclopedia of Algorithms.

Faster Exact Solutions for MAX2SAT

Rolf Niedermeier, Jens Gramm, 2000, CIAC.

Prediction of Phenotype Information from Genotype Data

Roded Sharan, Richard M. Karp, William Stafford Noble, 2010, Commun. Inf. Syst..

Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach

Rolf Niedermeier, Jens Gramm, R. Niedermeier, 2002, ECCB.

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2005, Theory of Computing Systems.

Pattern Matching for Arc-Annotated Sequences

Rolf Niedermeier, Jiong Guo, Jens Gramm, 2002, FSTTCS.

Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2003, CIAC.

Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable

Jens Gramm, Till Nierhoff, Till Tantau, 2004, IWPEC.

Computing the similarity of two sequences with nested arc annotations

Rolf Niedermeier, Jochen Alber, Jiong Guo, 2004, Theor. Comput. Sci..

Parameterized Intractability of Distinguishing Substring Selection

Rolf Niedermeier, Jiong Guo, Jens Gramm, 2006, Theory of Computing Systems.

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2006, ALENEX.

Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems

Rolf Niedermeier, Peter Rossmanith, Jens Gramm, 2003, Algorithmica.

2 00 2 Parameterized Intractability of Motif Search Problems ∗

Rolf Niedermeier, Michael R. Fellows, Jens Gramm, 2002 .