Jens Gramm

According to our database1, Jens Gramm authored at least 37 papers between 2000 and 2016.

Collaborative distances:



In proceedings 
PhD thesis 




Closest Substring.
Encyclopedia of Algorithms, 2016

Towards an Information Security Framework for the Automotive Domain.
Proceedings of the Automotive, 2014

On the complexity of SNP block partitioning under the perfect phylogeny model.
Discret. Math., 2009

Closest Substring.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Data reduction and exact algorithms for clique cover.
ACM Journal of Experimental Algorithmics, 2008

Fixed-Parameter Algorithms in Phylogenetics.
Comput. J., 2008

Haplotyping with missing data via perfect path phylogenies.
Discret. Appl. Math., 2007

Algorithms for compact letter displays: Comparison and evaluation.
Comput. Stat. Data Anal., 2007

Pattern matching for arc-annotated sequences.
ACM Trans. Algorithms, 2006

Parameterized Intractability of Distinguishing Substring Selection.
Theory Comput. Syst., 2006

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization.
J. Comput. Syst. Sci., 2006

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.
Int. J. Found. Comput. Sci., 2006

On The Parameterized Intractability Of Motif Search Problems.
Combinatorica, 2006

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.
Theory Comput. Syst., 2005

Multiplexing Schemes for Generic SNP Genotyping Assays.
Journal of Computational Biology, 2005

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Computing the similarity of two sequences with nested arc annotations.
Theor. Comput. Sci., 2004

A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns.
IEEE/ACM Trans. Comput. Biology Bioinform., 2004

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

Avoiding Forbidden Submatrices by Row Deletions.
Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Fixed-parameter algorithms for the consensus analysis of genomic data.
PhD thesis, 2003

A fixed-parameter algorithm for minimum quartet inconsistency.
J. Comput. Syst. Sci., 2003

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
Discret. Appl. Math., 2003

Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems.
Algorithmica, 2003

On Exact and Approximation Algorithms for Distinguishing Substring Selection.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Automated Generation of Search Tree Algorithms for Graph Modification Problems.
Proceedings of the Algorithms, 2003

Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems.
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.
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.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Faster exact algorithms for hard problems: A parameterized point of view.
Discret. Math., 2001

Exact Solutions for CLOSEST STRING and Related Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Minimum Quartet Inconsistency Is Fixed Parameter Tractable.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC), 2000

Faster Exact Solutions for MAX2SAT.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000