| 2016 | CPM | On Almost Monge All Scores Matrices. | Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson |
| 2014 | CPM | The Worst Case Complexity of Maximum Parsimony. | Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson |
| 2014 | CPM | Approximate String Matching Using a Bidirectional Index. | Gregory Kucherov, Kamil Salikhov, Dekel Tsur |
| 2014 | ECCB | Recent Results on Three Problems in Comparative Structural RNAomics. | Shay Zakov, Nimrod Milo, Tamar Pinhas, Sivan Yogev, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Dekel Tsur, Michal Ziv-Ukelson |
| 2014 | SPIRE | Improved Filters for the Approximate Suffix-Prefix Overlap Problem. | Gregory Kucherov, Dekel Tsur |
| 2013 | CPM | Efficient All Path Score Computations on Grid Graphs. | Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson |
| 2011 | CPM | Edit Distance with Duplications and Contractions Revisited. | Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson |
| 2010 | WABI | Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. | Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson |
| 2009 | CPM | Fast RNA Structure Alignment for Crossing Input Structures. | Rolf Backofen, Gad M. Landau, Mathias Mhl, Dekel Tsur, Oren Weimann |
| 2009 | CPM | Sparse RNA Folding: Time and Space Efficient Algorithms. | Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson |
| 2008 | CPM | Fast Algorithms for Computing Tree LCS. | Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson |
| 2007 | CPM | Finding Witnesses by Peeling. | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur |
| 2007 | SPIRE | Generalized LCS. | Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur |
| 2007 | SPIRE | Indexing a Dictionary for Subset Matching Queries. | Gad M. Landau, Dekel Tsur, Oren Weimann |
| 2006 | RECOMB | A New Approach to Protein Identification. | Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner |
| 2006 | WABI | Optimal Probing Patterns for Sequencing by Hybridization. | Dekel Tsur |
| 2005 | CPM | Two Dimensional Parameterized Matching. | Carmit Hazay, Moshe Lewenstein, Dekel Tsur |
| 2005 | ICALP | Optimal Spaced Seeds for Faster Approximate String Matching. | Martin Farach-Colton, Gad M. Landau, Sleyman Cenk Sahinalp, Dekel Tsur |
| 2004 | CPM | Faster Two Dimensional Pattern Matching with Rotations. | Amihood Amir, Oren Kapah, Dekel Tsur |
| 2004 | CPM | Approximate Labelled Subtree Homeomorphism. | Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson |
| 2004 | SPIRE | Efficient One Dimensional Real Scaled Matching. | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur |
| 2003 | ESA | Sequencing by Hybridization in Few Rounds. | Dekel Tsur |
| 2003 | WABI | Bounds for Resquencing by Hybridization. | Dekel Tsur |
| 2003 | WAOA | Tradeoffs in Worst-Case Equilibria. | Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur |
| 2002 | WG | Cluster Graph Modification Problems. | Ron Shamir, Roded Sharan, Dekel Tsur |
| 2001 | RECOMB | Large scale sequencing by hybridization. | Ron Shamir, Dekel Tsur |
| 1998 | SODA | The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract). | Ron Shamir, Dekel Tsur |