Dekel Tsur

2008
39	EE	Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243
38	EE	Dekel Tsur: Faster algorithms for guided tree edit distance. Inf. Process. Lett. 108(4): 251-254 (2008)
37	EE	Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate labelled subtree homeomorphism. J. Discrete Algorithms 6(3): 480-496 (2008)
36	EE	Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. Theor. Comput. Sci. 409(3): 438-449 (2008)
2007
35	EE	Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding Witnesses by Peeling. CPM 2007: 28-39
34	EE	Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. IEEE Conference on Computational Complexity 2007: 264-277
33	EE	Gad M. Landau, Dekel Tsur, Oren Weimann: Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204
32	EE	Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. SPIRE 2007: 50-61
31	EE	Dekel Tsur: Tree-edges deletion problems with bounded diameter obstruction sets. Discrete Applied Mathematics 155(10): 1275-1293 (2007)
30	EE	Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(054): (2007)
29	EE	Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur: Optimal spaced seeds for faster approximate string matching. J. Comput. Syst. Sci. 73(7): 1035-1044 (2007)
28	EE	Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007)
27	EE	Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur: Character sets of strings. J. Discrete Algorithms 5(2): 330-340 (2007)
26	EE	Dekel Tsur: Improved scheduling in rings. J. Parallel Distrib. Comput. 67(5): 531-535 (2007)
25	EE	Ron Shamir, Dekel Tsur: Improved algorithms for the random cluster graph model. Random Struct. Algorithms 31(4): 418-449 (2007)
2006
24	EE	Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner: A New Approach to Protein Identification. RECOMB 2006: 363-378
23	EE	Dekel Tsur: Optimal Probing Patterns for Sequencing by Hybridization. WABI 2006: 366-375
22	EE	Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in worst-case equilibria. Theor. Comput. Sci. 361(2-3): 200-209 (2006)
21	EE	Amihood Amir, Oren Kapah, Dekel Tsur: Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. 368(3): 196-204 (2006)
2005
20	EE	Dekel Tsur: Tight Bounds for String Reconstruction Using Substring Queries. APPROX-RANDOM 2005: 448-459
19	EE	Carmit Hazay, Moshe Lewenstein, Dekel Tsur: Two Dimensional Parameterized Matching. CPM 2005: 266-279
18	EE	Dekel Tsur, Stephen Tanner, Ebrahim Zandi, Vineet Bafna, Pavel A. Pevzner: Identification of Post-Translational Modifications via Blind Search of Mass-Spectra. CSB 2005: 157-166
17	EE	Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur: Optimal Spaced Seeds for Faster Approximate String Matching. ICALP 2005: 1251-1262
16	EE	Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Orientation Properties Electronic Colloquium on Computational Complexity (ECCC)(153): (2005)
15	EE	Dekel Tsur: Sequencing by hybridization with errors: handling longer sequences. Theor. Comput. Sci. 332(1-3): 559-566 (2005)
2004
14	EE	Amihood Amir, Oren Kapah, Dekel Tsur: Faster Two Dimensional Pattern Matching with Rotations. CPM 2004: 409-419
13	EE	Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate Labelled Subtree Homeomorphism. CPM 2004: 59-73
12	EE	Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9
11	EE	Ron Shamir, Roded Sharan, Dekel Tsur: Cluster graph modification problems. Discrete Applied Mathematics 144(1-2): 173-182 (2004)
2003
10	EE	Dekel Tsur: Sequencing by Hybridization in Few Rounds. ESA 2003: 506-516
9	EE	Dekel Tsur: Bounds for Resquencing by Hybridization. WABI 2003: 498-511
8	EE	Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in Worst-Case Equilibria. WAOA 2003: 41-52
2002
7	EE	Ron Shamir, Dekel Tsur: Improved Algorithms for the Random Cluster Graph Model. SWAT 2002: 230-239
6	EE	Ron Shamir, Roded Sharan, Dekel Tsur: Cluster Graph Modification Problems. WG 2002: 379-390
5		Ron Shamir, Dekel Tsur: Large Scale Sequencing by Hybridization. Journal of Computational Biology 9(2): 413-428 (2002)
2001
4	EE	Ron Shamir, Dekel Tsur: Large scale sequencing by hybridization. RECOMB 2001: 269-277
1999
3		Ron Shamir, Dekel Tsur: Faster Subtree Isomorphism. J. Algorithms 33(2): 267-280 (1999)
1998
2		Ron Shamir, Dekel Tsur: The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract). SODA 1998: 394-399
1997
1	EE	Ron Shamir, Dekel Tsur: Faster subtree isomorphism. ISTCS 1997: 126-131

Coauthor Index

1	Amihood Amir	[12] [14] [21] [28] [32] [36]
2	Yonatan Aumann	[35]
3	Baruch Awerbuch	[8] [22]
4	Yossi Azar	[8] [22]
5	Vineet Bafna	[18]
6	Nuno Bandeira	[24]
7	Ayelet Butman	[12] [28]
8	Gilles Didier	[27]
9	Martin Farach-Colton (Martin Farach)	[17] [29]
10	Ari Frank	[24]
11	Shirley Halevy	[16] [30] [34]
12	Tzvika Hartman	[32] [36]
13	Carmit Hazay	[19]
14	Oren Kapah	[14] [21] [32] [36]
15	Oded Lachish	[16] [30] [34]
16	Gad M. Landau	[17] [29] [33]
17	Moshe Lewenstein	[12] [19] [28] [35]
18	Noa Lewenstein	[35]
19	Shay Mozes	[39]
20	Ilan Newman	[16] [30] [34]
21	Pavel A. Pevzner	[18] [24]
22	Ron Y. Pinter	[13] [37]
23	Ely Porat	[12] [28]
24	Yossi Richter	[8] [22]
25	Oleg Rokhlenko	[13] [37]
26	Süleyman Cenk Sahinalp	[17] [29]
27	Thomas Schmidt	[27]
28	B. Riva Shalom	[32] [36]
29	Ron Shamir	[1] [2] [3] [4] [5] [6] [7] [11] [25]
30	Roded Sharan	[6] [11]
31	Jens Stoye	[27]
32	Stephen Tanner	[18]
33	Oren Weimann	[33] [39]
34	Ebrahim Zandi	[18]
35	Michal Ziv-Ukelson	[13] [37] [39]

Colors in the list of coauthors