The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:108-119 [Conf]
  2. Jens Gramm, Rolf Niedermeier
    Faster Exact Solutions for MAX2SAT. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:174-186 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:99-114 [Conf]
  4. Jens Gramm, Rolf Niedermeier
    Minimum Quartet Inconsistency Is Fixed Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:241-256 [Conf]
  5. Jens Gramm, Rolf Niedermeier
    Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. [Citation Graph (0, 0)][DBLP]
    ECCB, 2002, pp:128-139 [Conf]
  6. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Automated Generation of Search Tree Algorithms for Graph Modification Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:642-653 [Conf]
  7. Jens Gramm, Jiong Guo, Rolf Niedermeier
    On Exact and Approximation Algorithms for Distinguishing Substring Selection. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:195-209 [Conf]
  8. Jens Gramm, Jiong Guo, Rolf Niedermeier
    Pattern Matching for Arc-Annotated Sequences. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:182-193 [Conf]
  9. Jens Gramm, Rolf Niedermeier, Peter Rossmanith
    Exact Solutions for CLOSEST STRING and Related Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:441-453 [Conf]
  10. Jens Gramm, Till Nierhoff, Till Tantau
    Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:174-186 [Conf]
  11. Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
    Avoiding Forbidden Submatrices by Row Deletions. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2004, pp:349-360 [Conf]
  12. Michael R. Fellows, Jens Gramm, Rolf Niedermeier
    On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:262-273 [Conf]
  13. Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau
    On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:92-102 [Conf]
  14. Jens Gramm
    A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:38-49 [Conf]
  15. Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
    Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:158-168 [Conf]
  16. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:4, pp:321-347 [Journal]
  17. Jens Gramm, Rolf Niedermeier, Peter Rossmanith
    Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:1, pp:25-42 [Journal]
  18. Michael R. Fellows, Jens Gramm, Rolf Niedermeier
    On The Parameterized Intractability Of Motif Search Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:2, pp:141-167 [Journal]
  19. Michael R. Fellows, Jens Gramm, Rolf Niedermeier
    Parameterized Intractability of Motif Search Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  20. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
    Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:139-155 [Journal]
  21. Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau
    Haplotyping with missing data via perfect path phylogenies. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:788-805 [Journal]
  22. Jochen Alber, Jens Gramm, Rolf Niedermeier
    Faster exact algorithms for hard problems: A parameterized point of view. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:3-27 [Journal]
  23. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
    New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:37, pp:- [Journal]
  24. Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
    The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1467-1484 [Journal]
  25. Roded Sharan, Jens Gramm, Zohar Yakhini, Amir Ben-Dor
    Multiplexing Schemes for Generic SNP Genotyping Assays. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2005, v:12, n:5, pp:514-533 [Journal]
  26. Jens Gramm, Rolf Niedermeier
    A fixed-parameter algorithm for minimum quartet inconsistency. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:723-741 [Journal]
  27. Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
    Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1386-1396 [Journal]
  28. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:4, pp:373-392 [Journal]
  29. Jens Gramm, Jiong Guo, Rolf Niedermeier
    Parameterized Intractability of Distinguishing Substring Selection. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:4, pp:545-560 [Journal]
  30. Jens Gramm, Jiong Guo, Rolf Niedermeier
    Pattern matching for arc-annotated sequences. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:44-65 [Journal]
  31. Jens Gramm
    A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:4, pp:171-180 [Journal]
  32. Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
    Computing the similarity of two sequences with nested arc annotations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:337-358 [Journal]

  33. Fixed-Parameter Algorithms in Phylogenetics. [Citation Graph (, )][DBLP]


  34. On the complexity of SNP block partitioning under the perfect phylogeny model. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
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