|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 23 occurrences of 16 keywords
|
|
|
|
|
Results
Found 38 publication records. Showing 38 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau |
On the complexity of SNP block partitioning under the perfect phylogeny model.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Arfst Nickelsen, Till Tantau |
Fixed-Parameter Algorithms in Phylogenetics. |
Comput. J. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier |
Data reduction and exact algorithms for clique cover. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Clique cover, data reduction, fixed-parameter tractability |
| 1 | Jens Gramm |
Closest Substring. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau |
Haplotyping with missing data via perfect path phylogenies. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Jiong Guo, Rolf Niedermeier |
Pattern matching for arc-annotated sequences. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Arc-annotated sequences, dynamic programming, pattern matching, RNA secondary structure |
| 1 | Michael R. Fellows, Jens Gramm, Rolf Niedermeier |
On The Parameterized Intractability Of Motif Search Problems. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 03D15, 68Q17, 68Q25 |
| 1 | Jens Gramm, Jiong Guo, Rolf Niedermeier |
Parameterized Intractability of Distinguishing Substring Selection. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau |
On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. |
WABI |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Roded Sharan, Jens Gramm, Zohar Yakhini, Amir Ben-Dor |
Multiplexing Schemes for Generic SNP Genotyping Assays. |
Journal of Computational Biology |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier |
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke |
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier |
Computing the similarity of two sequences with nested arc annotations. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier |
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Graph modification, Search tree algorithms, Automated development and analysis of algorithms, Exact algorithms, NP-hard problems, Algorithm engineering |
| 1 | Jens Gramm |
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2004 |
DBLP DOI BibTeX RDF |
Pattern matching, biology and genetics, algorithm design and analysis |
| 1 | Jens Gramm, Till Nierhoff, Till Tantau |
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm |
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. |
WABI |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier |
Avoiding Forbidden Submatrices by Row Deletions. |
SOFSEM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm |
Fixed-parameter algorithms for the consensus analysis of genomic data. |
|
2003 |
RDF |
|
| 1 | Jens Gramm, Rolf Niedermeier, Peter Rossmanith |
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Consensus word analysis, NP-complete, Exact algorithms, Fixed-parameter tractability |
| 1 | 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 |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Rolf Niedermeier |
A fixed-parameter algorithm for minimum quartet inconsistency. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier |
Automated Generation of Search Tree Algorithms for Graph Modification Problems. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Jiong Guo, Rolf Niedermeier |
On Exact and Approximation Algorithms for Distinguishing Substring Selection. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier |
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
edge modification problems, data clustering, NP-complete problems, exact algorithms, fixed-parameter tractability |
| 1 | Michael R. Fellows, Jens Gramm, Rolf Niedermeier |
Parameterized Intractability of Motif Search Problems |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Jens Gramm, Rolf Niedermeier |
Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. |
ECCB |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Jens Gramm, Rolf Niedermeier |
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Jiong Guo, Rolf Niedermeier |
Pattern Matching for Arc-Annotated Sequences. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Alber, Jens Gramm, Rolf Niedermeier |
Faster exact algorithms for hard problems: A parameterized point of view. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Rolf Niedermeier |
Minimum Quartet Inconsistency Is Fixed Parameter Tractable. |
CPM |
2001 |
DBLP BibTeX RDF |
|
| 1 | Jens Gramm, Rolf Niedermeier, Peter Rossmanith |
Exact Solutions for CLOSEST STRING and Related Problems. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Jens Gramm, Rolf Niedermeier |
Faster Exact Solutions for MAX2SAT. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
MAX2SAT, Maximum Cut, NP-complete problems, exact algorithms, parameterized complexity |
Displaying result #1 - #38 of 38 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")