The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Danny Hermelin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
    Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:246-257 [Conf]
  2. Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette
    Approximating the 2-Interval Pattern Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:426-437 [Conf]
  3. Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
    Normalized Similarity of RNA Sequences. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:360-369 [Conf]
  4. Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
    Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:271-282 [Conf]
  5. Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
    Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:241-252 [Conf]
  6. Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
    Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:340-351 [Conf]
  7. Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz
    Optimization problems in multiple-interval graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:268-277 [Conf]

  8. Constrained LCS: Hardness and Approximation. [Citation Graph (, )][DBLP]


  9. Haplotype Inference Constrained by Plausible Haplotype Data. [Citation Graph (, )][DBLP]


  10. Mod/Resc Parsimony Inference. [Citation Graph (, )][DBLP]


  11. Minimum Vertex Cover in Rectangle Graphs. [Citation Graph (, )][DBLP]


  12. On Problems without Polynomial Kernels (Extended Abstract). [Citation Graph (, )][DBLP]


  13. A Purely Democratic Characterization of W[1]. [Citation Graph (, )][DBLP]


  14. Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. [Citation Graph (, )][DBLP]


  15. An exact almost optimal algorithm for target set selection in social networks. [Citation Graph (, )][DBLP]


  16. A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. [Citation Graph (, )][DBLP]


  17. The Minimum Substring Cover Problem. [Citation Graph (, )][DBLP]


  18. Optimization Problems in Multiple Subtree Graphs. [Citation Graph (, )][DBLP]


  19. Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. [Citation Graph (, )][DBLP]


  20. A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression [Citation Graph (, )][DBLP]


  21. Minimum Vertex Cover in Rectangle Graphs [Citation Graph (, )][DBLP]


  22. Mod/Resc Parsimony Inference [Citation Graph (, )][DBLP]


  23. Unified Compression-Based Acceleration of Edit-Distance Computation [Citation Graph (, )][DBLP]


  24. Parameterized Two-Player Nash Equilibrium [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.042secs
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