The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract). - Ron Shamir; Dekel Tsur (SODA, 1998)

Faster Subtree Isomorphism. - Ron Shamir; Dekel Tsur (J. Algorithms, 1999)

Large Scale Sequencing by Hybridization. - Ron Shamir; Dekel Tsur (J. Comput. Biol., 2002)

Algorithmic problems in graph theory and molecular biology - Dekel Tsur (2002)

Bounds for Resquencing by Hybridization. - Dekel Tsur (WABI, 2003)

Cluster graph modification problems. - Ron Shamir; Roded Sharan; Dekel Tsur (Discret. Appl. Math., 2004)

Tight Bounds for String Reconstruction Using Substring Queries. - Dekel Tsur (APPROX-RANDOM, 2005)

Two Dimensional Parameterized Matching. - Carmit Hazay; Moshe Lewenstein; Dekel Tsur (CPM, 2005)

Identification of Post-Translational Modifications via Blind Search of Mass-Spectra. - Dekel Tsur; Stephen Tanner; Ebrahim Zandi; Vineet Bafna; Pavel A. Pevzner (CSB, 2005)

Testing Orientation Properties - Shirley Halevy; Oded Lachish; Ilan Newman; Dekel Tsur (Electron. Colloquium Comput. Complex., 2005)

Sequencing by hybridization with errors: handling longer sequences. - Dekel Tsur (Theor. Comput. Sci., 2005)

A New Approach to Protein Identification. - Nuno Bandeira; Dekel Tsur; Ari Frank; Pavel A. Pevzner (RECOMB, 2006)

Optimal Probing Patterns for Sequencing by Hybridization. - Dekel Tsur (WABI, 2006)

Faster two-dimensional pattern matching with rotations. - Amihood Amir; Oren Kapah; Dekel Tsur (Theor. Comput. Sci., 2006)

Tradeoffs in worst-case equilibria. - Baruch Awerbuch; Yossi Azar; Yossi Richter; Dekel Tsur (Theor. Comput. Sci., 2006)

Indexing a Dictionary for Subset Matching Queries. - Gad M. Landau; Dekel Tsur; Oren Weimann (SPIRE, 2007)

Tree-edges deletion problems with bounded diameter obstruction sets. - Dekel Tsur (Discret. Appl. Math., 2007)

Testing Properties of Constraint-Graphs. - Shirley Halevy; Oded Lachish; Ilan Newman; Dekel Tsur (Electron. Colloquium Comput. Complex., 2007)

Optimal spaced seeds for faster approximate string matching. - Martin Farach-Colton; Gad M. Landau; Süleyman Cenk Sahinalp; Dekel Tsur (J. Comput. Syst. Sci., 2007)

Efficient one-dimensional real scaled matching. - Amihood Amir; Ayelet Butman; Moshe Lewenstein; Ely Porat; Dekel Tsur (J. Discrete Algorithms, 2007)

Character sets of strings. - Gilles Didier; Thomas Schmidt 001; Jens Stoye; Dekel Tsur (J. Discrete Algorithms, 2007)

Improved scheduling in rings. - Dekel Tsur (J. Parallel Distributed Comput., 2007)

Protein identification by spectral networks analysis. - Nuno Bandeira; Dekel Tsur; Ari Frank; Pavel A. Pevzner (Proc. Natl. Acad. Sci. USA, 2007)

Improved algorithms for the random cluster graph model. - Ron Shamir; Dekel Tsur (Random Struct. Algorithms, 2007)

Faster algorithms for guided tree edit distance. - Dekel Tsur (Inf. Process. Lett., 2008)

Approximate labelled subtree homeomorphism. - Ron Y. Pinter; Oleg Rokhlenko; Dekel Tsur; Michal Ziv-Ukelson (J. Discrete Algorithms, 2008)

Generalized LCS. - Amihood Amir; Tzvika Hartman; Oren Kapah; B. Riva Shalom; Dekel Tsur (Theor. Comput. Sci., 2008)

Fast algorithms for computing tree LCS. - Shay Mozes; Dekel Tsur; Oren Weimann; Michal Ziv-Ukelson (Theor. Comput. Sci., 2009)

Sequencing by hybridization in few rounds. - Dekel Tsur (J. Comput. Syst. Sci., 2010)

Fast index for approximate string matching. - Dekel Tsur (J. Discrete Algorithms, 2010)

Edit Distance with Duplications and Contractions Revisited. - Tamar Pinhas; Dekel Tsur; Shay Zakov; Michal Ziv-Ukelson (CPM, 2011)

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 (Algorithms Mol. Biol., 2011)

Fast RNA structure alignment for crossing input structures. - Rolf Backofen; Gad M. Landau; Mathias Möhl; Dekel Tsur; Oren Weimann (J. Discrete Algorithms, 2011)

Sparse RNA folding: Time and space efficient algorithms. - Rolf Backofen; Dekel Tsur; Shay Zakov; Michal Ziv-Ukelson (J. Discrete Algorithms, 2011)

Finding witnesses by peeling. - Yonatan Aumann; Moshe Lewenstein; Noa Lewenstein; Dekel Tsur (ACM Trans. Algorithms, 2011)

Efficient edit distance with duplications and contractions. - Tamar Pinhas; Shay Zakov; Dekel Tsur; Michal Ziv-Ukelson (Algorithms Mol. Biol., 2013)

Approximate String Matching using a Bidirectional Index. - Gregory Kucherov; Dekel Tsur (CoRR, 2013)

Top-k document retrieval in optimal space. - Dekel Tsur (Inf. Process. Lett., 2013)

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 (CMSR@ECCB, 2014)

Improved Filters for the Approximate Suffix-Prefix Overlap Problem. - Gregory Kucherov; Dekel Tsur (SPIRE, 2014)

The Worst Case Complexity of Maximum Parsimony. - Amir Carmel; Noa Musa-Lempel; Dekel Tsur; Michal Ziv-Ukelson (J. Comput. Biol., 2014)

Two-Dimensional Parameterized Matching. - Richard Cole 001; Carmit Hazay; Moshe Lewenstein; Dekel Tsur (ACM Trans. Algorithms, 2014)

Efficient all path score computations on grid graphs. - Ury Matarazzo; Dekel Tsur; Michal Ziv-Ukelson (Theor. Comput. Sci., 2014)

Succinct representation of labeled trees. - Dekel Tsur (Theor. Comput. Sci., 2015)

Succinct data-structure for nearest colored node in a tree. - Dekel Tsur (CoRR, 2016)

Approximate string matching using a bidirectional index. - Gregory Kucherov; Kamil Salikhov; Dekel Tsur (Theor. Comput. Sci., 2016)

Dynamic all scores matrices for LCS score. - Amir Carmel; Dekel Tsur; Michal Ziv-Ukelson (CoRR, 2018)

Faster deterministic parameterized algorithm for k-Path. - Dekel Tsur (CoRR, 2018)

Weighted vertex cover on graphs with maximum degree 3. - Dekel Tsur (CoRR, 2018)

An O^*(2.619^k) algorithm for 4-path vertex cover. - Dekel Tsur (CoRR, 2018)

Succinct data structures for nearest colored node in a tree. - Dekel Tsur (Inf. Process. Lett., 2018)

On Almost Monge All Scores Matrices. - Amir Carmel; Dekel Tsur; Michal Ziv-Ukelson (Algorithmica, 2019)

A note on the Split to Block Vertex Deletion problem. - Dekel Tsur (CoRR, 2019)

l-path vertex cover is easier than l-hitting set for small l. - Dekel Tsur (CoRR, 2019)

Kernel for Kt-free edge deletion. - Dekel Tsur (CoRR, 2019)

An algorithm for destroying claws and diamonds. - Dekel Tsur (CoRR, 2019)

Faster parameterized algorithm for Bicluter Editing. - Dekel Tsur (CoRR, 2019)

The effective entropy of next/previous larger/smaller value queries. - Dekel Tsur (Inf. Process. Lett., 2019)

Faster parameterized algorithm for pumpkin vertex deletion set. - Dekel Tsur (Inf. Process. Lett., 2019)

Succinct data structure for dynamic trees with faster queries. - Dekel Tsur (Theor. Comput. Sci., 2019)

Parameterized algorithm for 3-path vertex cover. - Dekel Tsur (Theor. Comput. Sci., 2019)

Faster deterministic parameterized algorithm for k-Path. - Dekel Tsur (Theor. Comput. Sci., 2019)

Faster algorithms for cograph edge modification problems. - Dekel Tsur (Inf. Process. Lett., 2020)

An FPT algorithm for orthogonal buttons and scissors. - Dekel Tsur (Inf. Process. Lett., 2020)

An O∗(2.619k) algorithm for 4-Path Vertex Cover. - Dekel Tsur (Discret. Appl. Math., 2021)

Algorithms for deletion problems on split graphs. - Dekel Tsur (Inf. Process. Lett., 2021)

Kernel for Kt-free Edge Deletion. - Dekel Tsur (Inf. Process. Lett., 2021)

Faster parameterized algorithm for Bicluster Editing. - Dekel Tsur (Inf. Process. Lett., 2021)

Representation of ordered trees with a given degree distribution. - Dekel Tsur (J. Comput. Syst. Sci., 2021)

Faster Parameterized Algorithm for Cluster Vertex Deletion. - Dekel Tsur (Theory Comput. Syst., 2021)

Cluster deletion revisited. - Dekel Tsur (Inf. Process. Lett., 2022)

Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing. - Dekel Tsur (J. Comb. Optim., 2022)

Faster algorithm for pathwidth one vertex deletion. - Dekel Tsur (Theor. Comput. Sci., 2022)

Faster deterministic algorithm for Cactus Vertex Deletion. - Dekel Tsur (Inf. Process. Lett., 2023)

Faster deterministic algorithm for Co-Path Set. - Dekel Tsur (Inf. Process. Lett., 2023)

Above guarantee parameterization for vertex cover on graphs with maximum degree 4. - Dekel Tsur (J. Comb. Optim., 2023)

Faster parameterized algorithms for two vertex deletion problems. - Dekel Tsur (Theor. Comput. Sci., 2023)

Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree. - Dekel Tsur (Theor. Comput. Sci., 2023)

Smaller kernels for two vertex deletion problems. - Dekel Tsur (Inf. Process. Lett., 2024)

Algorithms for 2-club cluster deletion problems using automated generation of branching rules. - Dekel Tsur (Theor. Comput. Sci., 2024)

Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion. - Dekel Tsur (Inf. Process. Lett., 2025)

Faster parameterized algorithm for r-pseudoforest deletion. - Dekel Tsur (Theor. Comput. Sci., 2025)

Smaller kernels for 3-leaf power modifications problems. - Dekel Tsur (Theor. Comput. Sci., 2025)

Faster parameterized algorithm for 3-Hitting Set. - Dekel Tsur (CoRR, 2025)

Faster parameterized algorithms for variants of 3-Hitting Set. - Dekel Tsur (J. Comb. Optim., 2025)