| 2008 |
|---|
| 12 | EE | Zvi Gotthilf,
Danny Hermelin,
Moshe Lewenstein:
Constrained LCS: Hardness and Approximation.
CPM 2008: 255-262 |
| 11 | EE | Hans L. Bodlaender,
Rodney G. Downey,
Michael R. Fellows,
Danny Hermelin:
On Problems without Polynomial Kernels (Extended Abstract).
ICALP (1) 2008: 563-574 |
| 10 | EE | Michael R. Fellows,
Danny Hermelin,
Moritz Müller,
Frances A. Rosamond:
A Purely Democratic Characterization of W[1].
IWPEC 2008: 103-114 |
| 9 | EE | Maxime Crochemore,
Danny Hermelin,
Gad M. Landau,
Dror Rawitz,
Stéphane Vialette:
Approximating the 2-interval pattern problem.
Theor. Comput. Sci. 395(2-3): 283-297 (2008) |
| 2007 |
|---|
| 8 | EE | Guillaume Fertin,
Danny Hermelin,
Romeo Rizzi,
Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.
CPM 2007: 241-252 |
| 7 | EE | Michael R. Fellows,
Guillaume Fertin,
Danny Hermelin,
Stéphane Vialette:
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.
ICALP 2007: 340-351 |
| 6 | EE | Ayelet Butman,
Danny Hermelin,
Moshe Lewenstein,
Dror Rawitz:
Optimization problems in multiple-interval graphs.
SODA 2007: 268-277 |
| 5 | EE | Danny Hermelin,
Dror Rawitz,
Romeo Rizzi,
Stéphane Vialette:
The Minimum Substring Cover Problem.
WAOA 2007: 170-183 |
| 2006 |
|---|
| 4 | EE | Rolf Backofen,
Danny Hermelin,
Gad M. Landau,
Oren Weimann:
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.
CPM 2006: 246-257 |
| 2005 |
|---|
| 3 | EE | Maxime Crochemore,
Danny Hermelin,
Gad M. Landau,
Stéphane Vialette:
Approximating the 2-Interval Pattern Problem.
ESA 2005: 426-437 |
| 2 | EE | Rolf Backofen,
Danny Hermelin,
Gad M. Landau,
Oren Weimann:
Normalized Similarity of RNA Sequences.
SPIRE 2005: 360-369 |
| 1 | EE | Guillaume Blin,
Guillaume Fertin,
Danny Hermelin,
Stéphane Vialette:
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints.
WG 2005: 271-282 |
