Danny Hermelin
Danny Hermelin
Ben-Gurion University of the Negev
Aucune adresse e-mail validée - Page d'accueil
Citée par
Citée par
On problems without polynomial kernels
HL Bodlaender, RG Downey, MR Fellows, D Hermelin
Journal of Computer and System Sciences 75 (8), 423-434, 2009
On the parameterized complexity of multiple-interval graph problems
MR Fellows, D Hermelin, F Rosamond, S Vialette
Theoretical Computer Science 410 (1), 53-61, 2009
Upper and lower bounds for finding connected motifs in vertex-colored graphs
MR Fellows, G Fertin, D Hermelin, S Vialette
Journal of Computer and System Sciences 77 (4), 799-811, 2011
Treewidth governs the complexity of target set selection
O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman
Discrete Optimization 8 (1), 87-96, 2011
Unified compression-based acceleration of edit-distance computation
D Hermelin, GM Landau, S Landau, O Weimann
Algorithmica, 1-15, 2010
Optimization problems in multiple-interval graphs
A Butman, D Hermelin, M Lewenstein, D Rawitz
ACM Transactions on Algorithms (TALG) 6 (2), 1-18, 2010
Weak compositions and their applications to polynomial lower bounds for kernelization
D Hermelin, X Wu
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
Approximating the 2-interval pattern problem
M Crochemore, D Hermelin, GM Landau, D Rawitz, S Vialette
Theoretical Computer Science 395 (2), 283-297, 2008
A completeness theory for polynomial (Turing) kernelization
D Hermelin, S Kratsch, K Sołtys, M Wahlström, X Wu
Algorithmica 71 (3), 702-730, 2015
Constrained LCS: hardness and approximation
Z Gotthilf, D Hermelin, M Lewenstein
Annual Symposium on Combinatorial Pattern Matching, 255-262, 2008
Restricted lcs
Z Gotthilf, D Hermelin, GM Landau, M Lewenstein
International Symposium on String Processing and Information Retrieval, 250-257, 2010
SETH-based lower bounds for subset sum and bicriteria path
A Abboud, K Bringmann, D Hermelin, D Shabtay
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Binary jumbled pattern matching on trees and tree-like structures
T Gagie, D Hermelin, GM Landau, O Weimann
Algorithmica 73 (3), 571-588, 2015
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
G Blin, G Fertin, D Hermelin, S Vialette
Journal of Discrete Algorithms 6 (4), 618-626, 2008
Domination when the stars are out
D Hermelin, M Mnich, EJ Van Leeuwen, GJ Woeginger
International Colloquium on Automata, Languages, and Programming, 462-473, 2011
Locality and gaps in RNA comparison
R Backofen, S Chen, D Hermelin, GM Landau, MA Roytberg, O Weimann, ...
Journal of Computational Biology 14 (8), 1074-1087, 2007
The minimum substring cover problem
D Hermelin, D Rawitz, R Rizzi, S Vialette
Information and Computation 206 (11), 1303-1312, 2008
Distance oracles for vertex-labeled graphs
D Hermelin, A Levy, O Weimann, R Yuster
International Colloquium on Automata, Languages, and Programming, 490-501, 2011
Constraint satisfaction problems: Convexity makes alldifferent constraints tractable
M Fellows, T Friedrich, D Hermelin, N Narodytska, F Rosamond
Theoretical Computer Science 472, 81-89, 2013
Well-quasi-orders in subclasses of bounded treewidth graphs
MR Fellows, D Hermelin, FA Rosamond
International Workshop on Parameterized and Exact Computation, 149-160, 2009
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20