Danny Hermelin

	2012
51		Danny Hermelin, Xi Wu: Weak compositions and their applications to polynomial lower bounds for kernelization. SODA 2012: 104-113
50		Michael R. Fellows, Danny Hermelin, Frances A. Rosamond: Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica 64(1): 3-18 (2012)
49		Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot: Mod/Resc Parsimony Inference: Theory and application. Inf. Comput. 213: 23-32 (2012)
	2011
48		Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger: Domination When the Stars Are Out. ICALP (1) 2011: 462-473
47		Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster: Distance Oracles for Vertex-Labeled Graphs. ICALP (2) 2011: 490-501
46		Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond: Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011: 522-527
45		Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium. WG 2011: 215-226
44		Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu: Hierarchies of Inefficient Kernelizability CoRR abs/1110.0976: (2011)
43		Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum vertex cover in rectangle graphs. Comput. Geom. 44(6-7): 356-364 (2011)
42		Danny Hermelin, Dror Rawitz: Optimization problems in multiple subtree graphs. Discrete Applied Mathematics 159(7): 588-594 (2011)
41		Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman: Treewidth governs the complexity of target set selection. Discrete Optimization 8(1): 87-96 (2011)
40		Danny Hermelin, Xi Wu: Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization. Electronic Colloquium on Computational Complexity (ECCC) 18: 72 (2011)
39		Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg: Haplotype Inference Constrained by Plausible Haplotype Data. IEEE/ACM Trans. Comput. Biology Bioinform. 8(6): 1692-1699 (2011)
38		Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4): 799-811 (2011)
	2010
37		Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot: Mod/Resc Parsimony Inference. CPM 2010: 202-213
36		Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum Vertex Cover in Rectangle Graphs. ESA (1) 2010: 255-266
35		Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein: Restricted LCS. SPIRE 2010: 250-257
34		Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz: Optimization problems in multiple-interval graphs. ACM Transactions on Algorithms 6(2): (2010)
33		Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum Vertex Cover in Rectangle Graphs CoRR abs/1001.3332: (2010)
32		Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot: Mod/Resc Parsimony Inference CoRR abs/1002.1292: (2010)
31		Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: Unified Compression-Based Acceleration of Edit-Distance Computation CoRR abs/1004.1194: (2010)
30		Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium CoRR abs/1006.2063: (2010)
29		Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger: Domination When the Stars Are Out CoRR abs/1012.0012: (2010)
28		Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discrete Math. 24(1): 287-300 (2010)
27		Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411(26-28): 2475-2486 (2010)
26		Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond: W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. 46(2): 311-339 (2010)
	2009
25		Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman: An exact almost optimal algorithm for target set selection in social networks. ACM Conference on Electronic Commerce 2009: 355-362
24		Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg: Haplotype Inference Constrained by Plausible Haplotype Data. CPM 2009: 339-352
23		Michael R. Fellows, Danny Hermelin, Frances A. Rosamond: Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC 2009: 149-160
22		Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS 2009: 529-540
21		Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. WAOA 2009: 13-24
20		Danny Hermelin, Dror Rawitz: Optimization Problems in Multiple Subtree Graphs. WAOA 2009: 194-204
19		Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression CoRR abs/0902.2649: (2009)
18		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009)
17		Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1): 53-61 (2009)
	2008
16		Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein: Constrained LCS: Hardness and Approximation. CPM 2008: 255-262
15		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574
14		Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond: A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114
13		Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette: The Minimum Substring Cover problem. Inf. Comput. 206(11): 1303-1312 (2008)
12		Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms 6(4): 618-626 (2008)
11		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
10		Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252
9		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
8		Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz: Optimization problems in multiple-interval graphs. SODA 2007: 268-277
7		Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette: The Minimum Substring Cover Problem. WAOA 2007: 170-183
6		Guillaume Blin, Eric Blais, Danny Hermelin, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk: Gene Maps Linearization Using Genomic Rearrangement Distances. Journal of Computational Biology 14(4): 394-407 (2007)
5		Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang: Locality and Gaps in RNA Comparison. Journal of Computational Biology 14(8): 1074-1087 (2007)
	2006
4		Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann: Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM 2006: 246-257
	2005
3		Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette: Approximating the 2-Interval Pattern Problem. ESA 2005: 426-437
2		Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann: Normalized Similarity of RNA Sequences. SPIRE 2005: 360-369
1		Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282

Coauthor Index

1	Rolf Backofen	[2] [4] [5]
2	Reuven Bar-Yehuda	[21] [28] [33] [36] [43]
3	Oren Ben-Zwi	[25] [41]
4	Eric Blais	[6]
5	Mathieu Blanchette	[6]
6	Guillaume Blin	[1] [6] [12]
7	Hans L. Bodlaender	[15] [18]
8	Ayelet Butman	[8] [34]
9	Sylvain Charlat	[32] [37] [49]
10	Shihyen Chen	[5]
11	Maxime Crochemore	[3] [11]
12	Rodney G. Downey (Rod Downey)	[15] [18]
13	Olivier Duron	[32] [37] [49]
14	Nadia El-Mabrouk	[6]
15	Jan Engelstadter	[32] [37] [49]
16	Michael R. Fellows (Mike Fellows)	[9] [14] [15] [17] [18] [23] [24] [26] [38] [39] [46] [50]
17	Guillaume Fertin	[1] [9] [10] [12] [27] [38]
18	Jörg Flum	[26]
19	Tobias Friedrich	[46]
20	Zvi Gotthilf	[16] [35]
21	Pierre Guillon	[6]
22	Tzvika Hartman	[24] [39]
23	Chien-Chung Huang	[30] [45]
24	Stefan Kratsch	[30] [44] [45]
25	Gad M. Landau	[2] [3] [4] [5] [11] [19] [22] [24] [31] [35] [39]
26	Shir Landau	[19] [22] [31]
27	Erik Jan van Leeuwen	[29] [48]
28	Avivit Levy (Avivit Kapah-Levy)	[47]
29	Moshe Lewenstein	[8] [16] [34] [35]
30	Daniel Lokshtanov	[25] [41]
31	Matthias Mnich	[29] [48]
32	Moritz Müller	[14] [26]
33	Nina Narodytska	[46]
34	Ilan Newman	[25] [41]
35	Igor Nor	[32] [37] [49]
36	Dror Rawitz	[7] [8] [11] [13] [20] [21] [28] [33] [34] [36] [42] [43]
37	Max Reuter	[32] [37] [49]
38	Romeo Rizzi	[7] [10] [13] [27]
39	Frances A. Rosamond	[14] [17] [23] [24] [26] [39] [46] [50]
40	Mikhail A. Roytberg	[5]
41	Liat Rozenberg	[24] [39]
42	Marie-France Sagot	[32] [37] [49]
43	Karolina Soltys	[44]
44	Stéphane Vialette	[1] [3] [7] [9] [10] [11] [12] [13] [17] [27] [38]
45	Magnus Wahlström	[30] [44] [45]
46	Oren Weimann	[2] [4] [5] [19] [22] [31] [47]
47	Gerhard J. Woeginger	[29] [48]
48	Xi Wu	[40] [44] [51]
49	Raphael Yuster	[47]
50	Kaizhong Zhang	[5]

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page