The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jens Lagergren: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stefan Arnborg, Jens Lagergren, Detlef Seese
    Easy Problems for Tree-Decomposable Graphs. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:2, pp:308-340 [Journal]
  2. Bruno Courcelle, Jens Lagergren
    Recognizable Sets of Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Graph Transformations in Computer Science, 1993, pp:138-152 [Conf]
  3. Johan Håstad, Lars Ivansson, Jens Lagergren
    Fitting Points on the Real Line and Its Application to RH Mapping. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:465-476 [Conf]
  4. Jens Lagergren
    Efficient Parallel Algorithms for Tree-Decomposition and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:173-182 [Conf]
  5. Michael T. Hallett, Jens Lagergren
    Hunting for Functionally Analogous Genes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:465-476 [Conf]
  6. Jens Lagergren
    An upper bound on the size of an obstruction. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:601-622 [Conf]
  7. Stefan Arnborg, Jens Lagergren, Detlef Seese
    Problems Easy for Tree-Decomposable Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:38-51 [Conf]
  8. Isaac Elias, Jens Lagergren
    Fast Neighbor Joining. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1263-1274 [Conf]
  9. David Fernández-Baca, Jens Lagergren
    A Polynomial-Time Algorithm for Near-Perfect Phylogeny. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:670-680 [Conf]
  10. Jens Lagergren
    The Size of an Interwine. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:520-531 [Conf]
  11. Jens Lagergren, Stefan Arnborg
    Finding Minimal Forbidden Minors Using a Finite Congruence. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:532-543 [Conf]
  12. David Fernández-Baca, Jens Lagergren
    On the Approximability of the Steiner Tree Problem in Phylogeny. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:65-74 [Conf]
  13. Lars Arvestad, Ann-Charlotte Berglund, Jens Lagergren, Bengt Sennblad
    Bayesian gene/species tree reconciliation and orthology analysis using MCMC. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2003, pp:7-15 [Conf]
  14. Öjvind Johansson, Wynand Alkema, Wyeth W. Wasserman, Jens Lagergren
    Identification of functional clusters of transcription factor binding motifs in genome sequences: the MSCAN algorithm. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2003, pp:169-176 [Conf]
  15. Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi
    On the Hardness of Approximating Max k-Cut and Its Dual. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:61-67 [Conf]
  16. Louigi Addario-Berry, Michael T. Hallett, Jens Lagergren
    Towards Identifying Lateral Gene Transfer Events. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2003, pp:279-290 [Conf]
  17. Samuel A. Andersson, Jens Lagergren
    Motif Yggdrasil: Sampling from a Tree Mixture Model. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2006, pp:458-472 [Conf]
  18. Lars Arvestad, Ann-Charlotte Berglund, Jens Lagergren, Bengt Sennblad
    Gene tree reconstruction and orthology analysis based on an integrated model for duplications and sequence evolution. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2004, pp:326-335 [Conf]
  19. Michael T. Hallett, Jens Lagergren
    New algorithms for the duplication-loss model. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2000, pp:138-146 [Conf]
  20. Michael T. Hallett, Jens Lagergren
    Efficient algorithms for lateral gene transfer problems. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:149-156 [Conf]
  21. Michael T. Hallett, Jens Lagergren, Ali Tofigh
    Simultaneous identification of duplications and lateral transfers. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2004, pp:347-356 [Conf]
  22. Jens Lagergren
    Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:605-616 [Conf]
  23. Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
    Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:202-215 [Conf]
  24. Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi
    On the Hardness of Approximating Max k-Cut and its Dual. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1997, v:1997, n:, pp:- [Journal]
  25. David Fernández-Baca, Jens Lagergren
    On the Approximability of the Steiner Tree Problem in Phylogeny. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:129-145 [Journal]
  26. Jens Lagergren
    The Nonexistence of Reduction Rules Giving an Embedding into a K-tree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:2-3, pp:219-223 [Journal]
  27. Viggo Kann, Jens Lagergren, Alessandro Panconesi
    Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:58, n:3, pp:105-110 [Journal]
  28. Viggo Kann, Jens Lagergren, Alessandro Panconesi
    Approximate Max k-Cut with Subgraph Guarantee. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:3, pp:145-150 [Journal]
  29. Johan Håstad, Lars Ivansson, Jens Lagergren
    Fitting points on the real line and its application to RH mapping. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:42-62 [Journal]
  30. Jens Lagergren
    Efficient Parallel Algorithms for Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:1, pp:20-44 [Journal]
  31. Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
    Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2004, v:2, n:2, pp:257-272 [Journal]
  32. Jens Lagergren
    Combining polynomial running time and fast convergence for the disk-covering method. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:481-493 [Journal]
  33. Jens Lagergren
    Upper Bounds on the Size of Obstructions and Intertwines. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:73, n:1, pp:7-40 [Journal]
  34. Bruno Courcelle, Jens Lagergren
    Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1996, v:6, n:2, pp:141-165 [Journal]
  35. Wynand Alkema, Öjvind Johansson, Jens Lagergren, Wyeth W. Wasserman
    MSCAN: identification of functional clusters of transcription factor binding sites. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2004, v:32, n:Web-Server-Issue, pp:195-198 [Journal]
  36. Jens Lagergren, Peter Bro Miltersen
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:2, pp:135-136 [Journal]
  37. David Fernández-Baca, Jens Lagergren
    A Polynomial-Time Algorithm for Near-Perfect Phylogeny. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1115-1127 [Journal]
  38. Lars Ivansson, Jens Lagergren
    Algorithms for RH Mapping: New Ideas and Improved Analysis. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:89-108 [Journal]
  39. David Bryant, Jens Lagergren
    Compatibility of unrooted phylogenetic trees is FPT. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:296-302 [Journal]

  40. Fast computation of distance estimators. [Citation Graph (, )][DBLP]


  41. primetv: a viewer for reconciled trees. [Citation Graph (, )][DBLP]


  42. A computational screen for site selective A-to-I editing detects novel sites in neuron specific Hu proteins. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002