default search action
Jens Gramm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [r2]Jens Gramm:
Closest Substring. Encyclopedia of Algorithms 2016: 324-326 - 2014
- [c17]Benjamin Glas, Jens Gramm, Priyamvadha Vembar:
Towards an Information Security Framework for the Automotive Domain. Automotive - Safety & Security 2014: 109-124 - 2010
- [j20]Jens Gramm, Richard M. Karp, William S. Noble, Roded Sharan, Qianfei Wang, Nir Yosef:
Prediction of Phenotype Information from Genotype Data. Commun. Inf. Syst. 10(2): 99-114 (2010)
2000 – 2009
- 2009
- [j19]Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau:
On the complexity of SNP block partitioning under the perfect phylogeny model. Discret. Math. 309(18): 5610-5617 (2009) - 2008
- [j18]Jens Gramm, Arfst Nickelsen, Till Tantau:
Fixed-Parameter Algorithms in Phylogenetics. Comput. J. 51(1): 79-101 (2008) - [j17]Jens Gramm, Jiong Guo, Falk Hüffner
, Rolf Niedermeier:
Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithmics 13 (2008) - [r1]Jens Gramm:
Closest Substring. Encyclopedia of Algorithms 2008 - 2007
- [j16]Jens Gramm, Jiong Guo, Falk Hüffner
Algorithms for compact letter displays: Comparison and evaluation. Comput. Stat. Data Anal. 52(2): 725-736 (2007) - [j15]Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau:
Haplotyping with missing data via perfect path phylogenies. Discret. Appl. Math. 155(6-7): 788-805 (2007) - 2006
- [j14]Michael R. Fellows
On The Parameterized Intractability Of Motif Search Problems. Comb. 26(2): 141-167 (2006) - [j13]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) - [j12]Jiong Guo, Jens Gramm, Falk Hüffner
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8): 1386-1396 (2006) - [j11]Jens Gramm, Jiong Guo, Rolf Niedermeier:
Parameterized Intractability of Distinguishing Substring Selection. Theory Comput. Syst. 39(4): 545-560 (2006) - [j10]Jens Gramm, Jiong Guo, Rolf Niedermeier:
Pattern matching for arc-annotated sequences. ACM Trans. Algorithms 2(1): 44-65 (2006) - [c16]Jens Gramm, Jiong Guo, Falk Hüffner
Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. ALENEX 2006: 86-94 - [c15]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 - 2005
- [j9]Roded Sharan, Jens Gramm, Zohar Yakhini
Multiplexing Schemes for Generic SNP Genotyping Assays. J. Comput. Biol. 12(5): 514-533 (2005) - [j8]Jens Gramm, Jiong Guo, Falk Hüffner
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. Theory Comput. Syst. 38(4): 373-392 (2005) - [c14]Jiong Guo, Jens Gramm, Falk Hüffner
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS 2005: 158-168 - 2004
- [j7]Jens Gramm, Jiong Guo, Falk Hüffner
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. Algorithmica 39(4): 321-347 (2004) - [j6]Jens Gramm:
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. IEEE ACM Trans. Comput. Biol. Bioinform. 1(4): 171-180 (2004) - [j5]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) - [c13]Jens Gramm, Till Nierhoff, Till Tantau:
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. IWPEC 2004: 174-186 - [c12]Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Avoiding Forbidden Submatrices by Row Deletions. SOFSEM 2004: 349-360 - [c11]Jens Gramm:
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. WABI 2004: 38-49 - 2003
- [b1]Jens Gramm:
Fixed-parameter algorithms for the consensus analysis of genomic data. University of Tübingen, Germany, 2003, pp. 1-194 - [j4]Jens Gramm, Rolf Niedermeier, Peter Rossmanith:
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica 37(1): 25-42 (2003) - [j3]Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith:
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discret. Appl. Math. 130(2): 139-155 (2003) - [j2]Jens Gramm, Rolf Niedermeier:
A fixed-parameter algorithm for minimum quartet inconsistency. J. Comput. Syst. Sci. 67(4): 723-741 (2003) - [c10]Jens Gramm, Jiong Guo, Falk Hüffner
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. CIAC 2003: 108-119 - [c9]Jens Gramm, Jiong Guo, Falk Hüffner
Automated Generation of Search Tree Algorithms for Graph Modification Problems. ESA 2003: 642-653 - [c8]Jens Gramm, Jiong Guo, Rolf Niedermeier:
On Exact and Approximation Algorithms for Distinguishing Substring Selection. FCT 2003: 195-209 - 2002
- [c7]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 - [c6]Jens Gramm, Rolf Niedermeier:
Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. ECCB 2002: 128-139 - [c5]Jens Gramm, Jiong Guo, Rolf Niedermeier:
Pattern Matching for Arc-Annotated Sequences. FSTTCS 2002: 182-193 - [c4]Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. STACS 2002: 262-273 - [i2]Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
Parameterized Intractability of Motif Search Problems. CoRR cs.CC/0205056 (2002) - 2001
- [j1]Jochen Alber, Jens Gramm, Rolf Niedermeier:
Faster exact algorithms for hard problems: A parameterized point of view. Discret. Math. 229(1-3): 3-27 (2001) - [c3]Jens Gramm, Rolf Niedermeier:
Minimum Quartet Inconsistency Is Fixed Parameter Tractable. CPM 2001: 241-256 - [c2]Jens Gramm, Rolf Niedermeier, Peter Rossmanith:
Exact Solutions for CLOSEST STRING and Related Problems. ISAAC 2001: 441-453 - 2000
- [c1]Jens Gramm, Rolf Niedermeier:
Faster Exact Solutions for MAX2SAT. CIAC 2000: 174-186 - [i1]Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith:
New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT. Electron. Colloquium Comput. Complex. TR00 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: