Остановите войну!
for scientists:
default search action
Dekel Tsur
- > Home > Persons > Dekel Tsur
Publications
- 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
- [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) - [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
- [j31]Dekel Tsur:
Succinct data structures for nearest colored node in a tree. Inf. Process. Lett. 132: 6-10 (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) - [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) - 2015
- [j29]Dekel Tsur:
Succinct representation of labeled trees. Theor. Comput. Sci. 562: 320-329 (2015) - 2013
- [j24]Dekel Tsur:
Top-k document retrieval in optimal space. Inf. Process. Lett. 113(12): 440-443 (2013) - [i3]Dekel Tsur:
Succinct representation of labeled trees. CoRR abs/1312.6039 (2013) - 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) - 2008
- [j16]Dekel Tsur:
Faster algorithms for guided tree edit distance. Inf. Process. Lett. 108(4): 251-254 (2008) - 2007
- [j13]Dekel Tsur:
Tree-edges deletion problems with bounded diameter obstruction sets. Discret. Appl. Math. 155(10): 1275-1293 (2007) - [j9]Dekel Tsur:
Improved scheduling in rings. J. Parallel Distributed Comput. 67(5): 531-535 (2007) - 2006
- [c16]Dekel Tsur:
Optimal Probing Patterns for Sequencing by Hybridization. WABI 2006: 366-375 - 2005
- [j4]Dekel Tsur:
Sequencing by hybridization with errors: handling longer sequences. Theor. Comput. Sci. 332(1-3): 559-566 (2005) - [c15]Dekel Tsur:
Tight Bounds for String Reconstruction Using Substring Queries. APPROX-RANDOM 2005: 448-459 - 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 - 2002
- [b1]Dekel Tsur:
Algorithmic problems in graph theory and molecular biology. Tel Aviv University, Israel, 2002
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-04-25 01:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint