Dekel Tsur

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 47

Top Venues

Publications

Dekel Tsur
Algorithms for 2-club cluster deletion problems using automated generation of branching rules. Theor. Comput. Sci. 984 (2024)
Dekel Tsur
Faster deterministic algorithm for Co-Path Set. Inf. Process. Lett. 180 (2023)
Dekel Tsur
Faster deterministic algorithm for Cactus Vertex Deletion. Inf. Process. Lett. 179 (2023)
Dekel Tsur
Above guarantee parameterization for vertex cover on graphs with maximum degree 4. J. Comb. Optim. 45 (1) (2023)
Dekel Tsur
Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree. Theor. Comput. Sci. 953 (2023)
Dekel Tsur
Faster parameterized algorithms for two vertex deletion problems. Theor. Comput. Sci. 940 (Part) (2023)
Dekel Tsur
Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing. J. Comb. Optim. 44 (5) (2022)
Dekel Tsur
Faster algorithm for pathwidth one vertex deletion. Theor. Comput. Sci. 921 (2022)
Dekel Tsur
Cluster deletion revisited. Inf. Process. Lett. 173 (2022)
Dekel Tsur
Faster Parameterized Algorithm for Cluster Vertex Deletion. Theory Comput. Syst. 65 (2) (2021)
Dekel Tsur
-free Edge Deletion. Inf. Process. Lett. 167 (2021)
Dekel Tsur
Algorithms for deletion problems on split graphs. Inf. Process. Lett. 167 (2021)
Dekel Tsur
An O∗(2.619k) algorithm for 4-Path Vertex Cover. Discret. Appl. Math. 291 (2021)
Dekel Tsur
Representation of ordered trees with a given degree distribution. J. Comput. Syst. Sci. 118 (2021)
Dekel Tsur
Faster parameterized algorithm for Bicluster Editing. Inf. Process. Lett. 168 (2021)
Dekel Tsur
An FPT algorithm for orthogonal buttons and scissors. Inf. Process. Lett. 163 (2020)
Dekel Tsur
Faster algorithms for cograph edge modification problems. Inf. Process. Lett. 158 (2020)
Dekel Tsur
A note on the Split to Block Vertex Deletion problem. CoRR (2019)
Dekel Tsur
Faster parameterized algorithm for pumpkin vertex deletion set. CoRR (2019)
Dekel Tsur
Faster algorithms for cograph edge modification problems. CoRR (2019)
Dekel Tsur
l-path vertex cover is easier than l-hitting set for small l. CoRR (2019)
Dekel Tsur
Kernel for Kt-free edge deletion. CoRR (2019)
Dekel Tsur
-Path. Theor. Comput. Sci. 790 (2019)
Dekel Tsur
Succinct data structure for dynamic trees with faster queries. Theor. Comput. Sci. 780 (2019)
Dekel Tsur
The effective entropy of next/previous larger/smaller value queries. Inf. Process. Lett. 145 (2019)
Dekel Tsur
Faster parameterized algorithm for pumpkin vertex deletion set. Inf. Process. Lett. 147 (2019)
Dekel Tsur
An FPT algorithm for orthogonal buttons and scissors. CoRR (2019)
Dekel Tsur
An algorithm for destroying claws and diamonds. CoRR (2019)
Dekel Tsur
Faster parameterized algorithm for Bicluter Editing. CoRR (2019)
Dekel Tsur
Cluster deletion revisited. CoRR (2019)
Dekel Tsur
Parameterized algorithm for 3-path vertex cover. Theor. Comput. Sci. 783 (2019)
Dekel Tsur
Faster parameterized algorithm for Cluster Vertex Deletion. CoRR (2019)
Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson
On Almost Monge All Scores Matrices. Algorithmica 81 (1) (2019)
Dekel Tsur
Representation of ordered trees with a given degree distribution. CoRR (2018)
Dekel Tsur
Faster deterministic parameterized algorithm for k-Path. CoRR (2018)
Dekel Tsur
Parameterized algorithm for 3-path vertex cover. CoRR (2018)
Dekel Tsur
An O^*(2.619^k) algorithm for 4-path vertex cover. CoRR (2018)
Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson
Dynamic all scores matrices for LCS score. CoRR (2018)
Dekel Tsur
Succinct data structure for dynamic trees with faster queries. CoRR (2018)
Dekel Tsur
Weighted vertex cover on graphs with maximum degree 3. CoRR (2018)
Dekel Tsur
Succinct data structures for nearest colored node in a tree. Inf. Process. Lett. 132 (2018)
Dekel Tsur
The effective entropy of next/previous larger/smaller value queries. CoRR (2018)
Dekel Tsur
Above guarantee parameterization for vertex cover on graphs with maximum degree 4. CoRR (2018)
Gregory Kucherov, Kamil Salikhov, Dekel Tsur
Approximate string matching using a bidirectional index. Theor. Comput. Sci. 638 (2016)
Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson
On Almost Monge All Scores Matrices. CPM (2016)
Dekel Tsur
Succinct data-structure for nearest colored node in a tree. CoRR (2016)
Dekel Tsur
Succinct representation of labeled trees. Theor. Comput. Sci. 562 (2015)
Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson
The Worst Case Complexity of Maximum Parsimony. CPM (2014)
Shay Zakov, Nimrod Milo, Tamar Pinhas, Sivan Yogev, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Dekel Tsur, Michal Ziv-Ukelson
Recent Results on Three Problems in Comparative Structural RNAomics. CMSR@ECCB (2014)
Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson
Efficient all path score computations on grid graphs. Theor. Comput. Sci. 525 (2014)
Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson
The Worst Case Complexity of Maximum Parsimony. J. Comput. Biol. 21 (11) (2014)
Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur
Two-Dimensional Parameterized Matching. ACM Trans. Algorithms 11 (2) (2014)
Gregory Kucherov, Dekel Tsur
Improved Filters for the Approximate Suffix-Prefix Overlap Problem. SPIRE (2014)
Gregory Kucherov, Kamil Salikhov, Dekel Tsur
Approximate String Matching Using a Bidirectional Index. CPM (2014)
Dekel Tsur
Succinct representation of labeled trees. CoRR (2013)
Gregory Kucherov, Dekel Tsur
Approximate String Matching using a Bidirectional Index. CoRR (2013)
Tamar Pinhas, Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
Efficient edit distance with duplications and contractions. Algorithms Mol. Biol. 8 (2013)
Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson
Efficient All Path Score Computations on Grid Graphs. CPM (2013)
Dekel Tsur
Top-k document retrieval in optimal space. Inf. Process. Lett. 113 (12) (2013)
Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms 9 (1) (2011)
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Finding witnesses by peeling. ACM Trans. Algorithms 7 (2) (2011)
Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
Edit Distance with Duplications and Contractions Revisited. CPM (2011)
Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. Algorithms Mol. Biol. 6 (2011)
Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
Sparse RNA folding: Time and space efficient algorithms. J. Discrete Algorithms 9 (1) (2011)
Dekel Tsur
Fast index for approximate string matching. J. Discrete Algorithms 8 (4) (2010)
Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. WABI (2010)
Dekel Tsur
Sequencing by hybridization in few rounds. J. Comput. Syst. Sci. 76 (8) (2010)
Gad M. Landau, Dekel Tsur, Oren Weimann
Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications (2010)
Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
Fast RNA Structure Alignment for Crossing Input Structures. CPM (2009)
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
Fast algorithms for computing tree LCS. Theor. Comput. Sci. 410 (43) (2009)
Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
Sparse RNA Folding: Time and Space Efficient Algorithms. CPM (2009)
Dekel Tsur
Faster algorithms for guided tree edit distance. Inf. Process. Lett. 108 (4) (2008)
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson
Approximate labelled subtree homeomorphism. J. Discrete Algorithms 6 (3) (2008)
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
Fast Algorithms for Computing Tree LCS. CPM (2008)
Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur
Generalized LCS. Theor. Comput. Sci. 409 (3) (2008)
Dekel Tsur
Tree-edges deletion problems with bounded diameter obstruction sets. Discret. Appl. Math. 155 (10) (2007)
Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner
Protein identification by spectral networks analysis. Proc. Natl. Acad. Sci. USA 104 (15) (2007)
Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5 (2) (2007)
Ron Shamir, Dekel Tsur
Improved algorithms for the random cluster graph model. Random Struct. Algorithms 31 (4) (2007)
Dekel Tsur
Improved scheduling in rings. J. Parallel Distributed Comput. 67 (5) (2007)
Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur
Generalized LCS. SPIRE (2007)
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
Testing Properties of Constraint-Graphs. Electron. Colloquium Comput. Complex. 14 (054) (2007)
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
Testing Properties of Constraint-Graphs. Computational Complexity Conference (2007)
Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur
Character sets of strings. J. Discrete Algorithms 5 (2) (2007)
Gad M. Landau, Dekel Tsur, Oren Weimann
Indexing a Dictionary for Subset Matching Queries. SPIRE (2007)
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Finding Witnesses by Peeling. CPM (2007)
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) (2007)
Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur
Tradeoffs in worst-case equilibria. Theor. Comput. Sci. 361 (2-3) (2006)
Dekel Tsur
Optimal Probing Patterns for Sequencing by Hybridization. WABI (2006)
Amihood Amir, Oren Kapah, Dekel Tsur
Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. 368 (3) (2006)
Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner
A New Approach to Protein Identification. RECOMB (2006)
Dekel Tsur
Tight Bounds for String Reconstruction Using Substring Queries. APPROX-RANDOM (2005)
Dekel Tsur
Sequencing by hybridization with errors: handling longer sequences. Theor. Comput. Sci. 332 (1-3) (2005)
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
Testing Orientation Properties Electron. Colloquium Comput. Complex. (153) (2005)
Dekel Tsur, Stephen Tanner, Ebrahim Zandi, Vineet Bafna, Pavel A. Pevzner
Identification of Post-Translational Modifications via Blind Search of Mass-Spectra. CSB (2005)
Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
Optimal Spaced Seeds for Faster Approximate String Matching. ICALP (2005)
Carmit Hazay, Moshe Lewenstein, Dekel Tsur
Two Dimensional Parameterized Matching. CPM (2005)
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson
Approximate Labelled Subtree Homeomorphism. CPM (2004)
Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
Efficient One Dimensional Real Scaled Matching. SPIRE (2004)
Amihood Amir, Oren Kapah, Dekel Tsur
Faster Two Dimensional Pattern Matching with Rotations. CPM (2004)

Dekel Tsur.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dekel Tsur