Jens Lagergren

From MaRDI portal
Person:293218

Available identifiers

zbMath Open lagergren.jensMaRDI QIDQ293218

List of research outcomes





PublicationDate of PublicationType
On the approximability of the Steiner tree problem in phylogeny2023-01-25Paper
Recognizable sets of graphs of bounded tree-width2022-08-16Paper
The size of an intertwine2019-04-29Paper
Hypothesis testing in perfect phylogeny for a bounded number of characters2017-11-16Paper
Approximate Max \(k\)-Cut with subgraph guarantee2016-06-09Paper
The gene evolution model and computing its associated probabilities2015-11-11Paper
Fast neighbor joining2009-05-28Paper
Motif Yggdrasil: Sampling from a Tree Mixture Model2007-08-30Paper
Compatibility of unrooted phylogenetic trees is FPT2006-04-06Paper
Automata, Languages and Programming2006-01-10Paper
Algorithms for RH Mapping: New Ideas and Improved Analysis2005-02-21Paper
Fitting points on the real line and its application to RH mapping2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48188752004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q44724682004-08-04Paper
A Polynomial-Time Algorithm for Near-Perfect Phylogeny2003-09-28Paper
https://portal.mardi4nfdi.de/entity/Q42520431999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42599871999-09-08Paper
Upper bounds on the size of obstructions and intertwines1999-06-22Paper
On the approximability of the Steiner tree problem in phylogeny1998-01-01Paper
Approximability of maximum splitting of k-sets and some other Apx-complete problems1997-02-27Paper
Equivalent definitions of recognizability for sets of graphs of bounded tree-width1996-09-12Paper
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width1996-02-20Paper
The nonexistence of reduction rules giving an embedding into a \(k\)-tree1995-02-01Paper
https://portal.mardi4nfdi.de/entity/Q42738731994-06-28Paper
https://portal.mardi4nfdi.de/entity/Q40365911993-05-18Paper
Easy problems for tree-decomposable graphs1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38122221988-01-01Paper

Research outcomes over time

This page was built for person: Jens Lagergren