The SCEAS System
| |||||||

## Search the dblp DataBase
Danny Hermelin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - 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] - 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] - 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] **Constrained LCS: Hardness and Approximation.**[Citation Graph (, )][DBLP]**Haplotype Inference Constrained by Plausible Haplotype Data.**[Citation Graph (, )][DBLP]**Mod/Resc Parsimony Inference.**[Citation Graph (, )][DBLP]**Minimum Vertex Cover in Rectangle Graphs.**[Citation Graph (, )][DBLP]**On Problems without Polynomial Kernels (Extended Abstract).**[Citation Graph (, )][DBLP]**A Purely Democratic Characterization of W[1].**[Citation Graph (, )][DBLP]**Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.**[Citation Graph (, )][DBLP]**An exact almost optimal algorithm for target set selection in social networks.**[Citation Graph (, )][DBLP]**A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression.**[Citation Graph (, )][DBLP]**The Minimum Substring Cover Problem.**[Citation Graph (, )][DBLP]**Optimization Problems in Multiple Subtree Graphs.**[Citation Graph (, )][DBLP]**Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.**[Citation Graph (, )][DBLP]**A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression**[Citation Graph (, )][DBLP]**Minimum Vertex Cover in Rectangle Graphs**[Citation Graph (, )][DBLP]**Mod/Resc Parsimony Inference**[Citation Graph (, )][DBLP]**Unified Compression-Based Acceleration of Edit-Distance Computation**[Citation Graph (, )][DBLP]**Parameterized Two-Player Nash Equilibrium**[Citation Graph (, )][DBLP]
Search in 0.041secs, Finished in 0.042secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |