default search action
Dekel Tsur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2002
- [b1]Dekel Tsur:
Algorithmic problems in graph theory and molecular biology. Tel Aviv University, Israel, 2002
Journal Articles
- 2024
- [j55]Dekel Tsur
:
Smaller kernels for two vertex deletion problems. Inf. Process. Lett. 186: 106493 (2024) - [j54]Dekel Tsur
Algorithms for 2-club cluster deletion problems using automated generation of branching rules. Theor. Comput. Sci. 984: 114321 (2024) - 2023
- [j53]Dekel Tsur
Faster deterministic algorithm for Cactus Vertex Deletion. Inf. Process. Lett. 179: 106317 (2023) - [j52]Dekel Tsur
Faster deterministic algorithm for Co-Path Set. Inf. Process. Lett. 180: 106335 (2023) - [j51]Dekel Tsur
Above guarantee parameterization for vertex cover on graphs with maximum degree 4. J. Comb. Optim. 45(1): 34 (2023) - [j50]Dekel Tsur
Faster parameterized algorithms for two vertex deletion problems. Theor. Comput. Sci. 940(Part): 112-123 (2023) - [j49]Dekel Tsur
Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree. Theor. Comput. Sci. 953: 113796 (2023) - 2022
- [j48]Dekel Tsur:
Cluster deletion revisited. Inf. Process. Lett. 173: 106171 (2022) - [j47]Dekel Tsur
Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing. J. Comb. Optim. 44(5): 3701-3710 (2022) - [j46]Dekel Tsur
Faster algorithm for pathwidth one vertex deletion. Theor. Comput. Sci. 921: 63-74 (2022) - 2021
- [j45]Dekel Tsur
An O∗(2.619k) algorithm for 4-Path Vertex Cover. Discret. Appl. Math. 291: 1-14 (2021) - [j44]Dekel Tsur:
Algorithms for deletion problems on split graphs. Inf. Process. Lett. 167: 106066 (2021) - [j43]Dekel Tsur:
Kernel for Kt-free Edge Deletion. Inf. Process. Lett. 167: 106082 (2021) - [j42]Dekel Tsur:
Faster parameterized algorithm for Bicluster Editing. Inf. Process. Lett. 168: 106095 (2021) - [j41]Dekel Tsur:
Representation of ordered trees with a given degree distribution. J. Comput. Syst. Sci. 118: 119-130 (2021) - [j40]Dekel Tsur
Faster Parameterized Algorithm for Cluster Vertex Deletion. Theory Comput. Syst. 65(2): 323-343 (2021) - 2020
- [j39]Dekel Tsur:
Faster algorithms for cograph edge modification problems. Inf. Process. Lett. 158: 105946 (2020) - [j38]Dekel Tsur:
An FPT algorithm for orthogonal buttons and scissors. Inf. Process. Lett. 163: 105997 (2020) - 2019
- [j37]Amir Carmel
On Almost Monge All Scores Matrices. Algorithmica 81(1): 47-68 (2019) - [j36]Dekel Tsur
The effective entropy of next/previous larger/smaller value queries. Inf. Process. Lett. 145: 39-43 (2019) - [j35]Dekel Tsur
Faster parameterized algorithm for pumpkin vertex deletion set. Inf. Process. Lett. 147: 74-76 (2019) - [j34]Dekel Tsur
Succinct data structure for dynamic trees with faster queries. Theor. Comput. Sci. 780: 12-19 (2019) - [j33]Dekel Tsur
Parameterized algorithm for 3-path vertex cover. Theor. Comput. Sci. 783: 1-8 (2019) - [j32]Dekel Tsur
Faster deterministic parameterized algorithm for k-Path. Theor. Comput. Sci. 790: 96-104 (2019) - 2018
- [j31]Dekel Tsur
Succinct data structures for nearest colored node in a tree. Inf. Process. Lett. 132: 6-10 (2018) - 2016
- [j30]Gregory Kucherov
Approximate string matching using a bidirectional index. Theor. Comput. Sci. 638: 145-158 (2016) - 2015
- [j29]Dekel Tsur
Succinct representation of labeled trees. Theor. Comput. Sci. 562: 320-329 (2015) - 2014
- [j28]Amir Carmel, Noa Musa-Lempel, Dekel Tsur
The Worst Case Complexity of Maximum Parsimony. J. Comput. Biol. 21(11): 799-808 (2014) - [j27]Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur
Two-Dimensional Parameterized Matching. ACM Trans. Algorithms 11(2): 12:1-12:30 (2014) - [j26]Ury Matarazzo, Dekel Tsur
Efficient all path score computations on grid graphs. Theor. Comput. Sci. 525: 138-149 (2014) - 2013
- [j25]Tamar Pinhas, Shay Zakov, Dekel Tsur
Efficient edit distance with duplications and contractions. Algorithms Mol. Biol. 8: 27 (2013) - [j24]Dekel Tsur
Top-k document retrieval in optimal space. Inf. Process. Lett. 113(12): 440-443 (2013) - 2011
- [j23]Shay Zakov, Dekel Tsur
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. Algorithms Mol. Biol. 6: 20 (2011) - [j22]Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur
Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms 9(1): 2-11 (2011) - [j21]Rolf Backofen, Dekel Tsur
Sparse RNA folding: Time and space efficient algorithms. J. Discrete Algorithms 9(1): 12-31 (2011) - [j20]Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Finding witnesses by peeling. ACM Trans. Algorithms 7(2): 24:1-24:15 (2011) - 2010
- [j19]Dekel Tsur
Sequencing by hybridization in few rounds. J. Comput. Syst. Sci. 76(8): 751-758 (2010) - [j18]Dekel Tsur
Fast index for approximate string matching. J. Discrete Algorithms 8(4): 339-345 (2010) - 2009
- [j17]Shay Mozes
Fast algorithms for computing tree LCS. Theor. Comput. Sci. 410(43): 4303-4314 (2009) - 2008
- [j16]Dekel Tsur
Faster algorithms for guided tree edit distance. Inf. Process. Lett. 108(4): 251-254 (2008) - [j15]Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur
Approximate labelled subtree homeomorphism. J. Discrete Algorithms 6(3): 480-496 (2008) - [j14]Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur
Generalized LCS. Theor. Comput. Sci. 409(3): 438-449 (2008) - 2007
- [j13]Dekel Tsur
Tree-edges deletion problems with bounded diameter obstruction sets. Discret. Appl. Math. 155(10): 1275-1293 (2007) - [j12]Martin Farach-Colton
Optimal spaced seeds for faster approximate string matching. J. Comput. Syst. Sci. 73(7): 1035-1044 (2007) - [j11]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007) - [j10]Gilles Didier
Character sets of strings. J. Discrete Algorithms 5(2): 330-340 (2007) - [j9]Dekel Tsur
Improved scheduling in rings. J. Parallel Distributed Comput. 67(5): 531-535 (2007) - [j8]Nuno Bandeira, Dekel Tsur
Protein identification by spectral networks analysis. Proc. Natl. Acad. Sci. USA 104(15): 6140-6145 (2007) - [j7]Ron Shamir
Improved algorithms for the random cluster graph model. Random Struct. Algorithms 31(4): 418-449 (2007) - 2006
- [j6]Baruch Awerbuch, Yossi Azar
Tradeoffs in worst-case equilibria. Theor. Comput. Sci. 361(2-3): 200-209 (2006) - [j5]Amihood Amir, Oren Kapah, Dekel Tsur
Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. 368(3): 196-204 (2006) - 2005
- [j4]Dekel Tsur
Sequencing by hybridization with errors: handling longer sequences. Theor. Comput. Sci. 332(1-3): 559-566 (2005) - 2004
- [j3]Ron Shamir
Cluster graph modification problems. Discret. Appl. Math. 144(1-2): 173-182 (2004) - 2002
- [j2]Ron Shamir
Large Scale Sequencing by Hybridization. J. Comput. Biol. 9(2): 413-428 (2002) - 1999
- [j1]Ron Shamir
Faster Subtree Isomorphism. J. Algorithms 33(2): 267-280 (1999)
Conference and Workshop Papers
- 2016
- [c33]Amir Carmel, Dekel Tsur
On Almost Monge All Scores Matrices. CPM 2016: 17:1-17:12 - 2014
- [c32]Amir Carmel, Noa Musa-Lempel, Dekel Tsur
The Worst Case Complexity of Maximum Parsimony. CPM 2014: 79-88 - [c31]Gregory Kucherov
Approximate String Matching Using a Bidirectional Index. CPM 2014: 222-231 - [c30]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: 58-58 - [c29]Gregory Kucherov, Dekel Tsur:
Improved Filters for the Approximate Suffix-Prefix Overlap Problem. SPIRE 2014: 139-148 - 2013
- [c28]Ury Matarazzo, Dekel Tsur
Efficient All Path Score Computations on Grid Graphs. CPM 2013: 211-222 - 2011
- [c27]Tamar Pinhas, Dekel Tsur
Edit Distance with Duplications and Contractions Revisited. CPM 2011: 441-454 - 2010
- [c26]Gad M. Landau, Dekel Tsur
Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications 2010: 158-169 - [c25]Shay Zakov, Dekel Tsur
Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. WABI 2010: 65-77 - 2009
- [c24]Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur
Fast RNA Structure Alignment for Crossing Input Structures. CPM 2009: 236-248 - [c23]Rolf Backofen, Dekel Tsur
Sparse RNA Folding: Time and Space Efficient Algorithms. CPM 2009: 249-262 - 2008
- [c22]Shay Mozes
Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243 - 2007
- [c21]Shirley Halevy, Oded Lachish
Testing Properties of Constraint-Graphs. CCC 2007: 264-277 - [c20]Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding Witnesses by Peeling. CPM 2007: 28-39 - [c19]Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur:
Generalized LCS. SPIRE 2007: 50-61 - [c18]Gad M. Landau, Dekel Tsur, Oren Weimann
Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204 - 2006
- [c17]Nuno Bandeira, Dekel Tsur
A New Approach to Protein Identification. RECOMB 2006: 363-378 - [c16]Dekel Tsur:
Optimal Probing Patterns for Sequencing by Hybridization. WABI 2006: 366-375 - 2005
- [c15]Dekel Tsur:
Tight Bounds for String Reconstruction Using Substring Queries. APPROX-RANDOM 2005: 448-459 - [c14]Carmit Hazay
Two Dimensional Parameterized Matching. CPM 2005: 266-279 - [c13]Dekel Tsur
Identification of Post-Translational Modifications via Blind Search of Mass-Spectra. CSB 2005: 157-166 - [c12]Martin Farach-Colton
Optimal Spaced Seeds for Faster Approximate String Matching. ICALP 2005: 1251-1262 - 2004
- [c11]Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson:
Approximate Labelled Subtree Homeomorphism. CPM 2004: 59-73 - [c10]Amihood Amir, Oren Kapah, Dekel Tsur:
Faster Two Dimensional Pattern Matching with Rotations. CPM 2004: 409-419 - [c9]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9 - 2003
- [c8]Dekel Tsur:
Sequencing by Hybridization in Few Rounds. ESA 2003: 506-516 - [c7]Dekel Tsur:
Bounds for Resquencing by Hybridization. WABI 2003: 498-511 - [c6]Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur:
Tradeoffs in Worst-Case Equilibria. WAOA 2003: 41-52 - 2002
- [c5]Ron Shamir, Dekel Tsur:
Improved Algorithms for the Random Cluster Graph Model. SWAT 2002: 230-239 - [c4]Ron Shamir, Roded Sharan, Dekel Tsur:
Cluster Graph Modification Problems. WG 2002: 379-390 - 2001
- [c3]Ron Shamir, Dekel Tsur:
Large scale sequencing by hybridization. RECOMB 2001: 269-277 - 1998
- [c2]Ron Shamir, Dekel Tsur:
The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract). SODA 1998: 394-399 - 1997
- [c1]Ron Shamir, Dekel Tsur:
Faster subtree isomorphism. ISTCS 1997: 126-131
Informal and Other Publications
- 2019
- [i24]Dekel Tsur:
Faster parameterized algorithm for pumpkin vertex deletion set. CoRR abs/1901.02491 (2019) - [i23]Dekel Tsur:
Faster parameterized algorithm for Cluster Vertex Deletion. CoRR abs/1901.07609 (2019) - [i22]Dekel Tsur:
A note on the Split to Block Vertex Deletion problem. CoRR abs/1906.10012 (2019) - [i21]Dekel Tsur:
l-path vertex cover is easier than l-hitting set for small l. CoRR abs/1906.10523 (2019) - [i20]Dekel Tsur:
Cluster deletion revisited. CoRR abs/1907.08399 (2019) - [i19]Dekel Tsur:
An FPT algorithm for orthogonal buttons and scissors. CoRR abs/1907.10230 (2019) - [i18]Dekel Tsur:
Faster algorithms for cograph edge modification problems. CoRR abs/1908.01223 (2019) - [i17]Dekel Tsur:
Kernel for Kt-free edge deletion. CoRR abs/1908.03600 (2019) - [i16]Dekel Tsur:
An algorithm for destroying claws and diamonds. CoRR abs/1908.07318 (2019) - [i15]Dekel Tsur:
Faster parameterized algorithm for Bicluter Editing. CoRR abs/1910.07944 (2019) - 2018
- [i14]Dekel Tsur:
Succinct data structure for dynamic trees with faster queries. CoRR abs/1805.11255 (2018) - [i13]Dekel Tsur:
Representation of ordered trees with a given degree distribution. CoRR abs/1807.00371 (2018) - [i12]Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson:
Dynamic all scores matrices for LCS score. CoRR abs/1808.03553 (2018) - [i11]Dekel Tsur:
The effective entropy of next/previous larger/smaller value queries. CoRR abs/1808.03658 (2018) - [i10]Dekel Tsur:
Faster deterministic parameterized algorithm for k-Path. CoRR abs/1808.04185 (2018) - [i9]Dekel Tsur:
Parameterized algorithm for 3-path vertex cover. CoRR abs/1809.02636 (2018) - [i8]Dekel Tsur:
Weighted vertex cover on graphs with maximum degree 3. CoRR abs/1810.12982 (2018) - [i7]Dekel Tsur:
An O^*(2.619^k) algorithm for 4-path vertex cover. CoRR abs/1811.03592 (2018) - [i6]Dekel Tsur:
Above guarantee parameterization for vertex cover on graphs with maximum degree 4. CoRR abs/1812.10808 (2018) - 2016
- [i5]Dekel Tsur:
Succinct data-structure for nearest colored node in a tree. CoRR abs/1609.01400 (2016) - 2013
- [i4]Gregory Kucherov, Dekel Tsur:
Approximate String Matching using a Bidirectional Index. CoRR abs/1310.1440 (2013) - [i3]Dekel Tsur:
Succinct representation of labeled trees. CoRR abs/1312.6039 (2013) - 2007
- [i2]Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur:
Testing Properties of Constraint-Graphs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2005
- [i1]Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur:
Testing Orientation Properties. Electron. Colloquium Comput. Complex. TR05 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: