Jens Gramm

Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau: On the complexity of SNP block partitioning under the perfect phylogeny model. Discrete Mathematics 309(18): 5610-5617 (2009)

Jens Gramm, Arfst Nickelsen, Till Tantau: Fixed-Parameter Algorithms in Phylogenetics. Comput. J. 51(1): 79-101 (2008)

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics 13 (2008)

Jens Gramm: Closest Substring. Encyclopedia of Algorithms 2008

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, Ramona Schmid: Algorithms for compact letter displays: Comparison and evaluation. Computational Statistics & Data Analysis 52(2): 725-736 (2007)

Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau: Haplotyping with missing data via perfect path phylogenies. Discrete Applied Mathematics 155(6-7): 788-805 (2007)

Michael R. Fellows, Jens Gramm, Rolf Niedermeier: On The Parameterized Intractability Of Motif Search Problems. Combinatorica 26(2): 141-167 (2006)

Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier: The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. Int. J. Found. Comput. Sci. 17(6): 1467-1484 (2006)

Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8): 1386-1396 (2006)

Jens Gramm, Jiong Guo, Rolf Niedermeier: Parameterized Intractability of Distinguishing Substring Selection. Theory Comput. Syst. 39(4): 545-560 (2006)

Jens Gramm, Jiong Guo, Rolf Niedermeier: Pattern matching for arc-annotated sequences. ACM Transactions on Algorithms 2(1): 44-65 (2006)

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. ALENEX 2006: 86-94

Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau: On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. WABI 2006: 92-102

Roded Sharan, Jens Gramm, Zohar Yakhini, Amir Ben-Dor: Multiplexing Schemes for Generic SNP Genotyping Assays. Journal of Computational Biology 12(5): 514-533 (2005)

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. Theory Comput. Syst. 38(4): 373-392 (2005)

Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke: Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS 2005: 158-168

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. Algorithmica 39(4): 321-347 (2004)

Jens Gramm: A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. IEEE/ACM Trans. Comput. Biology Bioinform. 1(4): 171-180 (2004)

Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier: Computing the similarity of two sequences with nested arc annotations. Theor. Comput. Sci. 312(2-3): 337-358 (2004)

Jens Gramm, Till Nierhoff, Till Tantau: Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. IWPEC 2004: 174-186

Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier: Avoiding Forbidden Submatrices by Row Deletions. SOFSEM 2004: 349-360

Jens Gramm: A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. WABI 2004: 38-49

Jens Gramm: Fixed-parameter algorithms for the consensus analysis of genomic data. Eberhard Karls University of Tübingen 2003, pp. 1-194

Jens Gramm, Rolf Niedermeier, Peter Rossmanith: Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica 37(1): 25-42 (2003)

Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics 130(2): 139-155 (2003)

Jens Gramm, Rolf Niedermeier: A fixed-parameter algorithm for minimum quartet inconsistency. J. Comput. Syst. Sci. 67(4): 723-741 (2003)

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. CIAC 2003: 108-119

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Automated Generation of Search Tree Algorithms for Graph Modification Problems. ESA 2003: 642-653

Jens Gramm, Jiong Guo, Rolf Niedermeier: On Exact and Approximation Algorithms for Distinguishing Substring Selection. FCT 2003: 195-209

Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier: Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. CPM 2002: 99-114

Jens Gramm, Rolf Niedermeier: Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. ECCB 2002: 128-139

Jens Gramm, Jiong Guo, Rolf Niedermeier: Pattern Matching for Arc-Annotated Sequences. FSTTCS 2002: 182-193

Michael R. Fellows, Jens Gramm, Rolf Niedermeier: On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. STACS 2002: 262-273

Michael R. Fellows, Jens Gramm, Rolf Niedermeier: Parameterized Intractability of Motif Search Problems. CoRR cs.CC/0205056 (2002)

Jochen Alber, Jens Gramm, Rolf Niedermeier: Faster exact algorithms for hard problems: A parameterized point of view. Discrete Mathematics 229(1-3): 3-27 (2001)

Jens Gramm, Rolf Niedermeier: Minimum Quartet Inconsistency Is Fixed Parameter Tractable. CPM 2001: 241-256

Jens Gramm, Rolf Niedermeier, Peter Rossmanith: Exact Solutions for CLOSEST STRING and Related Problems. ISAAC 2001: 441-453

Jens Gramm, Rolf Niedermeier: Faster Exact Solutions for MAX2SAT. CIAC 2000: 174-186

Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith: New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT. Electronic Colloquium on Computational Complexity (ECCC) 7(37) (2000)