The following pages link to Jens Gramm (Q175574):
Displayed 30 items.
- Graph-modeled data clustering: Exact algorithms for clique generation (Q814914) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- On the parameterized intractability of motif search problems (Q858110) (← links)
- Haplotyping with missing data via perfect path phylogenies (Q876476) (← links)
- Prediction of phenotype information from genotype data (Q966184) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- On the complexity of SNP block partitioning under the perfect phylogeny model (Q1045048) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Fixed-parameter algorithms for CLOSEST STRING and related problems (Q1424248) (← links)
- A fixed-parameter algorithm for minimum quartet inconsistency (Q1877704) (← links)
- Automated generation of search tree algorithms for hard graphs modification problems (Q1882409) (← links)
- Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
- Parameterized intractability of distinguishing substring selection (Q2432546) (← links)
- (Q2728900) (← links)
- Pattern matching for arc-annotated sequences (Q2944505) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- (Q4415254) (← links)
- (Q4437501) (← links)
- (Q4474112) (← links)
- (Q4547754) (← links)
- (Q4736845) (← links)
- (Q4737693) (← links)
- Data Reduction, Exact, and Heuristic Algorithms for Clique Cover (Q5233468) (← links)
- Parameterized and Exact Computation (Q5311510) (← links)
- Algorithms and Data Structures (Q5394246) (← links)
- Data reduction and exact algorithms for clique cover (Q5406188) (← links)
- Algorithms - ESA 2003 (Q5897283) (← links)
- Fundamentals of Computation Theory (Q5900797) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902007) (← links)
- Faster exact algorithms for hard problems: A parameterized point of view (Q5931443) (← links)