Danny Hermelin - Scientific Publications (names by alphabetic order)
(a) Authored books
N/A
(b) Editorship of collective volumes
N/A
(c) Chapters in collective volumes - Conference proceedings, Festschrifte, etc. consecutive numbers
1. (*) D. Hermelin, and L. Leventhal, Parameterized Complexity Analysis for the
Closest String with Wildcards Problem, Proc. of the 25th annual symposium on
Combinatorial Pattern Matching (CPM), to appear, 2014.
2. (*) T. Gagie, D. Hermelin, G.M. Landau, O. Weimann, Binary Jumbled Pattern
Matching on Trees and Tree-Like Structures, Proc. of the 21th annual European
Symposium on Algorithms (ESA), 517-528, 2013.
3. (*) M.R. Fellows, D. Hermelin, F.A. Rosamond, H. Shachnai, Tractable
Parameterizations for the Minimum Linear Arrangement Problem, Proc. of the
21th annual European Symposium on Algorithms (ESA), 457-468, 2013.
4. (*) M. Cygan, F. Grandoni, D. Hermelin, Tight Kernel Bounds for Problems on
Graphs with Small Degeneracy - (Extended Abstract), Proc. of the 21th annual
European Symposium on Algorithms (ESA), 361-372, 2013.
5. (*) J. Guo, D. Hermelin, C. Komusiewicz, Local Search for String Problems: Brute
Force Is Essentially Optimal, Proc. of the 24th annual symposium on
Combinatorial Pattern Matching (CPM), 130-141, 2013.
6. (*) D. Hermelin, M. Mnich, E.J. van Leeuwen, Parameterized Complexity of
Induced H-Matching on Claw-Free Graphs, Proc. of the 20th annual European
Symposium on Algorithms (ESA), LNCS, 624-635, 2012.
7. (*) D. Hermelin, R. Rizzi, S. Vialette, Algorithmic Aspects of the Intersection and
Overlap Numbers of a Graph, Proc. of the 23rd International Symposium,
(ISAAC) , LNCS, 465-474, 2012.
8. D. Hermelin, J. Mestre, D. Rawitz, Optimization Problems in Dotted Interval
Graphs, Proc. of the 38th Workshop on Graph-theoretic concepts in computer
science (WG), LNCS, 46-56, 2012.
9. D. Hermelin and X. Wu, Weak Compositions and Their Applications to
Polynomial Lower-Bounds for Kernelization, Proc. of the 23rd annual
ACM/SIAM Symposium On Discrete Algorithms (SODA), LNCS, 104-113,
2012.
10. D. Hermelin, C.-C. Huang, S. Kratsch, and M. Wahlstrom, Parameterized TwoPlayer Nash Equilibrium, Proc. of the 37th Workshop on Graph-theoretic concepts
in computer science (WG), LNCS, 215-226, 2011.
11. D. Hermelin, M. Mnich, E.J. Van Leeuwen and G.J. Woeginger, Domination
when the Stars Are Out, Proc. of the 34th International Colloquium on Automata,
Languages and Programming (ICALP), LNCS, 462-473, 2011.
12. D. Hermelin, A. Levy, O.Weimann, and R. Yuster, Distance Oracles for VertexLabeled Graphs, Proc. of the 34th International Colloquium on Automata,
Languages and Programming (ICALP), LNCS, 490-501, 2011.
D. Hermelin, N. Narodytska, F.A. Rosamond: Constraint Satisfaction Problems,
Convexity Makes AllDifferent Constraints Tractable, Proc. of the 22nd
International Joint Conference on Artificial Intelligence (IJCAI), LNCS, 522-527,
2011.
14. Z. Gotthilf, D. Hermelin, G.M. Landau, and M. Lewenstein, Restricted LCS, Proc.
of the 17th international conference on String Processing and Information
REtrieval (SPIRE), LNCS, 250-257, 2010.
15. R. Bar-Yehuda, D. Hermelin, and D. Rawitz, Minimum Vertex Cover in
Rectangle Graphs, Proc. of the 18th annual European Symposium on Algorithms
(ESA), LNCS, 255-266, 2010.
16. I. Nor, D. Hermelin, S. Charlat, J. Engelstadter, M. Reuter, O. Duron, M.-F.
Sagot, Mod/Resc Parsimony Inference, Proc. of the 21th annual symposium on
Combinatorial Pattern Matching (CPM), LNCS, 202-213, 2010.
17. D. Hermelin and D. Rawitz, Optimization Problems in Multiple Subtree Graphs,
Proc. of the 7th Workshop on Approximation and Online Algorithms (WAOA),
LNCS, 194-204, 2009.
18. R. Bar-Yehuda, D. Hermelin, and D. Rawitz, An Extension of The
Nemhauser&Trotter Theorem to Generalized Vertex Cover with Applications,
Proc. of the 7th Workshop on Approximation and Online Algorithms (WAOA),
LNCS, 13-24, 2009.
19. O. Ben-Zwi, D. Hermelin, D. Lokshtanov, and I. Newman, An Exact Almost
Optimal Algorithm for Target Set Selection in Social Networks, Proc. of the 10th
ACM conference on Electronic Commerce (ACM-EC), LNCS, 355-362, 2009.
20. M.R. Fellows, D. Hermelin, and F.A. Rosamond, Well-Quasi-Orders in
Subclasses of Bounded Treewidth Graphs, Proc. of the 4th International
Workshop on Parameterized and Exact Computation (IWPEC), LNCS, 149-160,
2009.
21. M.R. Fellows, T.Hartman, D. Hermelin, G.M. Landau, L. Leventhal, and F.
Rosamond, Haplotype Inference Constrained by Plausible Haplotype Data, Proc.
of the 20th annual symposium on Combinatorial Pattern Matching (CPM), LNCS,
339-352, 2009.
22. D. Hermelin, O. Weimann, G. Landau, S. Landau, A Uni_ed Algorithm for
Accelerating Edit-Distance Computation via Text-Compression, Proc. of the 26th
international Symposium on Theoretical Aspects of Computer Science (STACS),
LNCS, 529-540, 2009.
23. H. Bodlaender, R.G. Downey, M.R. Fellows, and D. Hermelin, On Problems
without Polynomial Kernels (Extended Abstract), Proc. of the 35th International
Colloquium on Automata, Languages and Programming (ICALP), LNCS, 563574, 2008.
24. Z. Gotthilf, D. Hermelin, and M. Lewenstein, Constrained LCS: Hardness and
Approximation, Proc. of the 19th Combinatorial Pattern Matching conference
(CPM), LNCS, 255-262, 2008.
25. M.R. Fellows, D. Hermelin, M. Muller, and F.A. Rosamond, A Purely Democratic
Characterization of W[1], Proc. of the 3rd International Workshop on
Parameterized and Exact Computation (IWPEC), LNCS, 103-114, 2008.
26. D. Hermelin, D. Rawitz, R. Rizzi, and S. Vialette, The Minimum Substring Cover
Problem, Proc. of the 5th Workshop on Approximation and Online Algorithms
(WAOA), LNCS, 170-183, 2007.
27. M.R. Fellows, G. Fertin, D. Hermelin, and S. Vialette, Sharp Tractability
Borderlines for Finding Connected Motifs in Vertex-Colored Graphs, Proc. of the
13.
34th International Colloquium on Automata, Languages and Programming
(ICALP), LNCS, 340-351,2007.
28. A. Butman, D. Hermelin, M. Lewenstien, and D. Ravitz, Optimization Problems
in Multiple-Interval Graphs, Proc. of the 18th annual ACM/SIAM Symposium On
Discrete Algorithms (SODA), LNCS, 268-277, 2007.
29. G. Fertin, D. Hermelin, R. Rizzi, and S. Vialette, Common Structured Patterns of
Linear Graphs: Approximations and Combinatorics, Proc. of the 18th
Combinatorial Pattern Matching conference (CPM), LNCS, 241-252, 2007.
30. R. Backofen, D. Hermelin, G.M. Landau, and O. Weimann, Local Alignment of
RNA Sequences with Arbitrary Scoring Schemes, Proc. of the 17th Combinatorial
PatternMatching conference (CPM), LNCS, 246-257, 2006.
31. R. Backofen, D. Hermelin, G.M. Landau, and O. Weimann, Normalized
Similarity of RNA Sequences, Proc. of the 12th international conference on String
Processing and Information REtrieval (SPIRE), LNCS, 360-369, 2005.
32. G. Blin, G. Fertin, D. Hermelin, and S. Vialette, Fixed-Parameter Algorithms for
Protein Similarity Search Under mRNA Structure Constraints, Proc. of the 31st
Workshop on Graph-theoretic concepts in computer science (WG), LNCS, 271282, 2005.
33. M. Crochemore, D. Hermelin, G.M. Landau, and S. Vialette, Approximating the
2-Interval Pattern Problem, Proc. of the 13th annual European Symposium on
Algorithms (ESA), LNCS, 426-437, 2005.
(a) Refereed articles and refereed letters in scientific journals
h-index = 4
(IF=ISI 2013 impact factor, JR=ISI 2010 journal ranking, CI=non-self ISI reported citation, CORE
= CORE 2014 ranking).
1. (*) D. Hermelin, M. Mnich, E.J. van Leeuwen, Parameterized Complexity of
2.
3.
4.
5.
6.
7.
Induced H-Matching on Claw-Free Graphs, Algorithmica, accepted. (IF= 1.239,
JR= 54/236, CI=0, CORE = A*).
(*) J. Guo, D. Hermelin, C. Komusiewicz, Local Search for String Problems: Brute
Force Is Essentially Optimal, Theoretical Computer Science, 30-41, 2014. (IF=
0.838, JR= 58/97, CI=0, CORE = A).
(*) M.R. Fellows, T. Friedrich, D. Hermelin, N. Narodytska, F.A. Rosamond,
Constraint satisfaction problems: Convexity makes AllDifferent constraints
tractable, Theoretical Computer Science, 472: 81-89, 2013. (IF= 0.838, JR=
58/97, CI=0, CORE = A).
D. Hermelin, O. Weimann, G. Landau, S. Landau, Unified Compression-Based
Acceleration of Edit-Distance Computation, Algorithmica, 65(2): 339-353, 2013.
(IF= 1.239, JR= 54/236, CI=0, CORE = A*).
D. Hermelin, C.-C. Huang, S. Kratsch, and M. Wahlstrom, Parameterized TwoPlayer Nash Equilibrium, Algorithmica, 65(4): 802-816, 2013. (IF= 1.239, JR=
54/236, CI=0, CORE = A*).
M.R. Fellows, D. Hermelin, F.A. Rosamond, Well-Quasi-Orders in Subclasses of
Bounded Treewidth Graphs and their Algorithmic Applications, Algorithmica,
64(1), :3-18, 2012. (IF= 1.239, JR= 54/236, CI=0, CORE = A*).
I. Nor, D. Hermelin, S. Charlat, J. Engelstadter, M. Reuter, O. Duron, M.-F.
Sagot, Mod/Resc Parsimony Inference: Theory and application, Information and
Computation, 213: 23-32, 2012. (IF= 0.825, JR= 61/97, CI=0, CORE = B).
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
M.R. Fellows, T. Hartman, D. Hermelin, G.M. Landau, L. Leventhal, and F.A.
Rosamond, Haplotype Inference Constrained by Plausible Haplotype Data,
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(6):
1692-1699, 2011. (IF= 1.664, JR= 30/97, CI=0, CORE = C).
O. Ben-Zwi, D. Hermelin, D. Lokshtanov, and I. Newman, Treewidth Governs
the Complexity of Target Set Selection, Discrete Optimization, 8(1): 87-96, 2011.
(IF= 0.766, JR= 120/236, CI=0, CORE = N/A).
D. Hermelin and D. Rawitz, Optimization Problems in Multiple Subtree Graphs,
Discrete Applied Mathematics, 159(7): 588-594, 2011. (IF= 0.822, JR= 107/236,
CI=0, CORE= N/A).
M.R. Fellows, G. Fertin, D. Hermelin, S. Vialette, Upper and lower bounds for
finding connected motifs in vertex-colored graphs, Journal of Computer and
System Sciences, 77(4): 799-811, 2011. (IF= 1.631, JR= 22/97, CI=1, CORE =
A*).
R. Bar-Yehuda, D. Hermelin, D. Rawitz, Minimum vertex cover in rectangle
graphs. Computational Geometry 44(6-7): 356-364, 2011. (IF= 1.328, JR=
46/279, CI=0, CORE = N/A).
A. Butman, D. Hermelin, M. Lewenstien, and D. Ravitz, Optimization Problems
in Multiple-Interval Graphs, ACM Transactions on Algorithms, 6(2), 2010. (IF=
0.932, JR= 52/97, CI=2, CORE = A).
R. Bar-Yehuda, D. Hermelin, and D. Rawitz, An Extension of The
Nemhauser&Trotter Theorem to Generalized Vertex Cover with Applications,
SIAM Journal on Discrete Mathematics, 24(1): 287-300, 2010. (IF= 0.668, JR=
151/238, CI=1, CORE = A).
G. Fertin, D. Hermelin, R. Rizzi, and S. Vialette, Finding common structured
patterns in linear graphs, Theoretical Computer Science, 411(26-28): 2475-2486,
2010. (IF= 0.838, JR= 58/97, CI=0, CORE = A).
M.R. Fellows, J. Flum, D. Hermelin, M. M¨uller and F. Rosamond, W-Hierarchies
Defined by Symmetric Gates, Theory of Computing Systems, 46(2): 311-339,
2010. (IF= 0.6, JR= 72/97, CI=0, CORE= C).
H. Bodlaender, R.G. Downey, M.R. Fellows, and D. Hermelin, On Problems
Without Polynomial Kernels, Journal of Computer and System Sciences, 75(8):
423-434, 2009. (IF= 1.631, JR= 22/97, CI=27, CORE = A*).
M. Fellows, D. Hermelin, F. Rosamond, and S. Vialette, On the Parameterized
Complexity of Multiple-Interval Graph Problems, Theoretical Computer Science,
410(1): 53-61, 2009. (IF= 0.838, JR= 58/97, CI=25, CORE = A).
D. Hermelin, D. Ravitz, R. Rizzi, and S. Vialette, The Minimum Substring Cover
Problem, Information and Computation, 206(11): 1303-1312, 2008. (IF= 0.825,
JR= 61/97, CI=1, CORE = B).
G. Blin, G. Fertin, D. Hermelin and S. Vialette, Fixed-Parameter Algorithms for
Protein Similarity Search Under mRNA Structure Constraints, Journal of Discrete
Algorithms, 6(4): 618-626, 2008. (IF= N/A, JR= N/A, CI=N/A, CORE= N/A).
M. Crochemore, D. Hermelin, G.M. Landau, D. Rawitz and S. Vialette,
Approximating the 2-Interval Pattern Problem, Theoretical Computer Science,
395(2-3): 283-297, 2008. (IF= 0.838, JR= 58/97, CI=7, CORE= A).
R. Backofen , S.Chen, D. Hermelin, G.M. Landau, M.A. Roytberg, O. Weimann,
and K. Zhang, Locality and Gaps in RNA Comparison, Journal of Computational
Biology, 14(8): 1074-1087, 2007. (IF= 1.6, JR= 33/97, CI=3, CORE = N/A).
G. Blin, E. Blais, D. Hermelin, P. Guillon, M. Blanchette, and N. El-Mabrouk,
Gene Maps Linearization Using Genomic Rearrangement Distances, Journal of
Computational Biology, 14(4): 394-407, 2007. (IF= 1.6, JR= 33/97, CI=8, CORE
= N/A).
(b) Published scientific reports and technical papers
N/A
(f) Unrefereed professional articles and publications
N/A
(g) Classified articles and reports
N/A