Jens Gramm

According to our database, Jens Gramm authored at least 38 papers between 2000 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2016

Closest Substring.

Jens Gramm

Encyclopedia of Algorithms, 2016

2014

Towards an Information Security Framework for the Automotive Domain.

Benjamin Glas, Jens Gramm, Priyamvadha Vembar

Proceedings of the Automotive, 2014

2010

Prediction of Phenotype Information from Genotype Data.

Jens Gramm, Richard M. Karp, William S. Noble, Roded Sharan, Qianfei Wang, Nir Yosef

Commun. Inf. Syst., 2010

2009

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

Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau

Discret. Math., 2009

2008

Closest Substring.

Jens Gramm

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Data reduction and exact algorithms for clique cover.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

ACM J. Exp. Algorithmics, 2008

Fixed-Parameter Algorithms in Phylogenetics.

Jens Gramm, Arfst Nickelsen, Till Tantau

Comput. J., 2008

2007

Haplotyping with missing data via perfect path phylogenies.

Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau

Discret. Appl. Math., 2007

Algorithms for compact letter displays: Comparison and evaluation.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, Ramona Schmid

Comput. Stat. Data Anal., 2007

2006

Pattern matching for arc-annotated sequences.

Jens Gramm, Jiong Guo, Rolf Niedermeier

ACM Trans. Algorithms, 2006

Parameterized Intractability of Distinguishing Substring Selection.

Jens Gramm, Jiong Guo, Rolf Niedermeier

Theory Comput. Syst., 2006

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

Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke

J. Comput. Syst. Sci., 2006

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.

Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

Int. J. Found. Comput. Sci., 2006

On The Parameterized Intractability Of Motif Search Problems.

Michael R. Fellows, Jens Gramm, Rolf Niedermeier

Comb., 2006

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Theory Comput. Syst., 2005

Multiplexing Schemes for Generic SNP Genotyping Assays.

Roded Sharan, Jens Gramm, Zohar Yakhini, Amir Ben-Dor

J. Comput. Biol., 2005

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.

Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004

Computing the similarity of two sequences with nested arc annotations.

Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

Theor. Comput. Sci., 2004

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

Jens Gramm

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

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Algorithmica, 2004

Avoiding Forbidden Submatrices by Row Deletions.

Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

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

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

Jens Gramm, Till Nierhoff, Till Tantau

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003

Fixed-parameter algorithms for the consensus analysis of genomic data.

Jens Gramm

PhD thesis, 2003

A fixed-parameter algorithm for minimum quartet inconsistency.

Jens Gramm, Rolf Niedermeier

J. Comput. Syst. Sci., 2003

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

Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith

Discret. Appl. Math., 2003

Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems.

Jens Gramm, Rolf Niedermeier, Peter Rossmanith

Algorithmica, 2003

On Exact and Approximation Algorithms for Distinguishing Substring Selection.

Jens Gramm, Jiong Guo, Rolf Niedermeier

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Automated Generation of Search Tree Algorithms for Graph Modification Problems.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms, 2003

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

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems.

Michael R. Fellows, Jens Gramm, Rolf Niedermeier

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach.

Jens Gramm, Rolf Niedermeier

Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

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

Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

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

Jochen Alber, Jens Gramm, Rolf Niedermeier

Discret. Math., 2001

Exact Solutions for CLOSEST STRING and Related Problems.

Jens Gramm, Rolf Niedermeier, Peter Rossmanith

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Minimum Quartet Inconsistency Is Fixed Parameter Tractable.

Jens Gramm, Rolf Niedermeier

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

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

Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith

Electron. Colloquium Comput. Complex., 2000

Faster Exact Solutions for MAX2SAT.

Jens Gramm, Rolf Niedermeier

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000