Dekel Tsur - RankMe

119 papers A* 2A 2B 16C 7Journal 85Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion. Inf. Process. Lett. Dekel Tsur
2025	J	`jnl`	Faster algorithms for 3-leaf power modification problems. J. Comb. Optim. Dekel Tsur
2025	J	`jnl`	Faster parameterized algorithm for 3-Hitting Set. CoRR Dekel Tsur
2025	J	`jnl`	Faster parameterized algorithm for r-pseudoforest deletion. Theor. Comput. Sci. Dekel Tsur
2025	J	`jnl`	Faster parameterized algorithms for variants of 3-Hitting Set. J. Comb. Optim. Dekel Tsur
2025	J	`jnl`	Smaller kernels for 3-leaf power modifications problems. Theor. Comput. Sci. Dekel Tsur
2024	J	`jnl`	Algorithms for 2-club cluster deletion problems using automated generation of branching rules. Theor. Comput. Sci. Dekel Tsur
2024	J	`jnl`	Smaller kernels for two vertex deletion problems. Inf. Process. Lett. Dekel Tsur
2023	J	`jnl`	Above guarantee parameterization for vertex cover on graphs with maximum degree 4. J. Comb. Optim. Dekel Tsur
2023	J	`jnl`	Faster deterministic algorithm for Cactus Vertex Deletion. Inf. Process. Lett. Dekel Tsur
2023	J	`jnl`	Faster deterministic algorithm for Co-Path Set. Inf. Process. Lett. Dekel Tsur
2023	J	`jnl`	Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree. Theor. Comput. Sci. Dekel Tsur
2023	J	`jnl`	Faster parameterized algorithms for two vertex deletion problems. Theor. Comput. Sci. Dekel Tsur
2022	J	`jnl`	Cluster deletion revisited. Inf. Process. Lett. Dekel Tsur
2022	J	`jnl`	Faster algorithm for pathwidth one vertex deletion. Theor. Comput. Sci. Dekel Tsur
2022	J	`jnl`	Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing. J. Comb. Optim. Dekel Tsur
2021	J	`jnl`	Algorithms for deletion problems on split graphs. Inf. Process. Lett. Dekel Tsur
2021	J	`jnl`	An O∗(2.619k) algorithm for 4-Path Vertex Cover. Discret. Appl. Math. Dekel Tsur
2021	J	`jnl`	Faster Parameterized Algorithm for Cluster Vertex Deletion. Theory Comput. Syst. Dekel Tsur
2021	J	`jnl`	Faster parameterized algorithm for Bicluster Editing. Inf. Process. Lett. Dekel Tsur
2021	J	`jnl`	Kernel for Inf. Process. Lett. Dekel Tsur
2021	J	`jnl`	Representation of ordered trees with a given degree distribution. J. Comput. Syst. Sci. Dekel Tsur
2020	J	`jnl`	An FPT algorithm for orthogonal buttons and scissors. Inf. Process. Lett. Dekel Tsur
2020	J	`jnl`	Faster algorithms for cograph edge modification problems. Inf. Process. Lett. Dekel Tsur
2019	J	`jnl`	A note on the Split to Block Vertex Deletion problem. CoRR Dekel Tsur
2019	J	`jnl`	An FPT algorithm for orthogonal buttons and scissors. CoRR Dekel Tsur
2019	J	`jnl`	An algorithm for destroying claws and diamonds. CoRR Dekel Tsur
2019	J	`jnl`	Cluster deletion revisited. CoRR Dekel Tsur
2019	J	`jnl`	Faster algorithms for cograph edge modification problems. CoRR Dekel Tsur
2019	J	`jnl`	Faster deterministic parameterized algorithm for Theor. Comput. Sci. Dekel Tsur
2019	J	`jnl`	Faster parameterized algorithm for Bicluter Editing. CoRR Dekel Tsur
2019	J	`jnl`	Faster parameterized algorithm for Cluster Vertex Deletion. CoRR Dekel Tsur
2019	J	`jnl`	Faster parameterized algorithm for pumpkin vertex deletion set. CoRR Dekel Tsur
2019	J	`jnl`	Faster parameterized algorithm for pumpkin vertex deletion set. Inf. Process. Lett. Dekel Tsur
2019	J	`jnl`	Kernel for Kt-free edge deletion. CoRR Dekel Tsur
2019	J	`jnl`	On Almost Monge All Scores Matrices. Algorithmica Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson
2019	J	`jnl`	Parameterized algorithm for 3-path vertex cover. Theor. Comput. Sci. Dekel Tsur
2019	J	`jnl`	Succinct data structure for dynamic trees with faster queries. Theor. Comput. Sci. Dekel Tsur
2019	J	`jnl`	The effective entropy of next/previous larger/smaller value queries. Inf. Process. Lett. Dekel Tsur
2019	J	`jnl`	l-path vertex cover is easier than l-hitting set for small l. CoRR Dekel Tsur
2018	J	`jnl`	Above guarantee parameterization for vertex cover on graphs with maximum degree 4. CoRR Dekel Tsur
2018	J	`jnl`	An O^*(2.619^k) algorithm for 4-path vertex cover. CoRR Dekel Tsur
2018	J	`jnl`	Dynamic all scores matrices for LCS score. CoRR Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson
2018	J	`jnl`	Faster deterministic parameterized algorithm for k-Path. CoRR Dekel Tsur
2018	J	`jnl`	Parameterized algorithm for 3-path vertex cover. CoRR Dekel Tsur
2018	J	`jnl`	Representation of ordered trees with a given degree distribution. CoRR Dekel Tsur
2018	J	`jnl`	Succinct data structure for dynamic trees with faster queries. CoRR Dekel Tsur
2018	J	`jnl`	Succinct data structures for nearest colored node in a tree. Inf. Process. Lett. Dekel Tsur
2018	J	`jnl`	The effective entropy of next/previous larger/smaller value queries. CoRR Dekel Tsur
2018	J	`jnl`	Weighted vertex cover on graphs with maximum degree 3. CoRR Dekel Tsur
2016	J	`jnl`	Approximate string matching using a bidirectional index. Theor. Comput. Sci. Gregory Kucherov, Kamil Salikhov, Dekel Tsur
2016	B	`conf`	On Almost Monge All Scores Matrices. CPM Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson
2016	J	`jnl`	Succinct data-structure for nearest colored node in a tree. CoRR Dekel Tsur
2015	J	`jnl`	Succinct representation of labeled trees. Theor. Comput. Sci. Dekel Tsur
2014	B	`conf`	Approximate String Matching Using a Bidirectional Index. CPM Gregory Kucherov, Kamil Salikhov, Dekel Tsur
2014	J	`jnl`	Efficient all path score computations on grid graphs. Theor. Comput. Sci. Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson
2014	C	`conf`	Improved Filters for the Approximate Suffix-Prefix Overlap Problem. SPIRE Gregory Kucherov, Dekel Tsur
2014	—	`conf`	Recent Results on Three Problems in Comparative Structural RNAomics. CMSR@ECCB Shay Zakov, Nimrod Milo, Tamar Pinhas, Sivan Yogev, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Dekel Tsur, Michal Ziv-Ukelson
2014	B	`conf`	The Worst Case Complexity of Maximum Parsimony. CPM Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson
2014	J	`jnl`	The Worst Case Complexity of Maximum Parsimony. J. Comput. Biol. Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson
2014	J	`jnl`	Two-Dimensional Parameterized Matching. ACM Trans. Algorithms Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur
2013	J	`jnl`	Approximate String Matching using a Bidirectional Index. CoRR Gregory Kucherov, Dekel Tsur
2013	B	`conf`	Efficient All Path Score Computations on Grid Graphs. CPM Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson
2013	J	`jnl`	Efficient edit distance with duplications and contractions. Algorithms Mol. Biol. Tamar Pinhas, Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
2013	J	`jnl`	Succinct representation of labeled trees. CoRR Dekel Tsur
2013	J	`jnl`	Top-k document retrieval in optimal space. Inf. Process. Lett. Dekel Tsur
2011	B	`conf`	Edit Distance with Duplications and Contractions Revisited. CPM Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
2011	J	`jnl`	Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
2011	J	`jnl`	Finding witnesses by peeling. ACM Trans. Algorithms Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
2011	J	`jnl`	Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. Algorithms Mol. Biol. Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
2011	J	`jnl`	Sparse RNA folding: Time and space efficient algorithms. J. Discrete Algorithms Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
2010	J	`jnl`	Fast index for approximate string matching. J. Discrete Algorithms Dekel Tsur
2010	—	`conf`	Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications Gad M. Landau, Dekel Tsur, Oren Weimann
2010	C	`conf`	Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. WABI Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
2010	J	`jnl`	Sequencing by hybridization in few rounds. J. Comput. Syst. Sci. Dekel Tsur
2009	B	`conf`	Fast RNA Structure Alignment for Crossing Input Structures. CPM Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
2009	J	`jnl`	Fast algorithms for computing tree LCS. Theor. Comput. Sci. Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
2009	B	`conf`	Sparse RNA Folding: Time and Space Efficient Algorithms. CPM Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
2008	J	`jnl`	Approximate labelled subtree homeomorphism. J. Discrete Algorithms Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson
2008	B	`conf`	Fast Algorithms for Computing Tree LCS. CPM Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
2008	J	`jnl`	Faster algorithms for guided tree edit distance. Inf. Process. Lett. Dekel Tsur
2008	J	`jnl`	Generalized LCS. Theor. Comput. Sci. Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur
2007	J	`jnl`	Character sets of strings. J. Discrete Algorithms Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur
2007	J	`jnl`	Efficient one-dimensional real scaled matching. J. Discrete Algorithms Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
2007	B	`conf`	Finding Witnesses by Peeling. CPM Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
2007	C	`conf`	Generalized LCS. SPIRE Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur
2007	J	`jnl`	Improved algorithms for the random cluster graph model. Random Struct. Algorithms Ron Shamir, Dekel Tsur
2007	J	`jnl`	Improved scheduling in rings. J. Parallel Distributed Comput. Dekel Tsur
2007	C	`conf`	Indexing a Dictionary for Subset Matching Queries. SPIRE Gad M. Landau, Dekel Tsur, Oren Weimann
2007	J	`jnl`	Optimal spaced seeds for faster approximate string matching. J. Comput. Syst. Sci. Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
2007	J	`jnl`	Protein identification by spectral networks analysis. Proc. Natl. Acad. Sci. USA Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner
2007	A	`conf`	Testing Properties of Constraint-Graphs. CCC Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
2007	J	`jnl`	Testing Properties of Constraint-Graphs. Electron. Colloquium Comput. Complex. Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
2007	J	`jnl`	Tree-edges deletion problems with bounded diameter obstruction sets. Discret. Appl. Math. Dekel Tsur
2006	B	`conf`	A New Approach to Protein Identification. RECOMB Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner
2006	J	`jnl`	Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. Amihood Amir, Oren Kapah, Dekel Tsur
2006	C	`conf`	Optimal Probing Patterns for Sequencing by Hybridization. WABI Dekel Tsur
2006	J	`jnl`	Tradeoffs in worst-case equilibria. Theor. Comput. Sci. Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur
2005	—	`conf`	Identification of Post-Translational Modifications via Blind Search of Mass-Spectra. CSB Dekel Tsur, Stephen Tanner, Ebrahim Zandi, Vineet Bafna, Pavel A. Pevzner
2005	A*	`conf`	Optimal Spaced Seeds for Faster Approximate String Matching. ICALP Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
2005	J	`jnl`	Sequencing by hybridization with errors: handling longer sequences. Theor. Comput. Sci. Dekel Tsur
2005	J	`jnl`	Testing Orientation Properties Electron. Colloquium Comput. Complex. Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
2005	—	`conf`	Tight Bounds for String Reconstruction Using Substring Queries. APPROX-RANDOM Dekel Tsur
2005	B	`conf`	Two Dimensional Parameterized Matching. CPM Carmit Hazay, Moshe Lewenstein, Dekel Tsur
2004	B	`conf`	Approximate Labelled Subtree Homeomorphism. CPM Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson
2004	J	`jnl`	Cluster graph modification problems. Discret. Appl. Math. Ron Shamir, Roded Sharan, Dekel Tsur
2004	C	`conf`	Efficient One Dimensional Real Scaled Matching. SPIRE Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
2004	B	`conf`	Faster Two Dimensional Pattern Matching with Rotations. CPM Amihood Amir, Oren Kapah, Dekel Tsur
2003	C	`conf`	Bounds for Resquencing by Hybridization. WABI Dekel Tsur
2003	A	`conf`	Sequencing by Hybridization in Few Rounds. ESA Dekel Tsur
2003	B	`conf`	Tradeoffs in Worst-Case Equilibria. WAOA Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur
2002	—	`—`	Algorithmic problems in graph theory and molecular biology Dekel Tsur
2002	B	`conf`	Cluster Graph Modification Problems. WG Ron Shamir, Roded Sharan, Dekel Tsur
2002	—	`conf`	Improved Algorithms for the Random Cluster Graph Model. SWAT Ron Shamir, Dekel Tsur
2002	J	`jnl`	Large Scale Sequencing by Hybridization. J. Comput. Biol. Ron Shamir, Dekel Tsur
2001	B	`conf`	Large scale sequencing by hybridization. RECOMB Ron Shamir, Dekel Tsur
1999	J	`jnl`	Faster Subtree Isomorphism. J. Algorithms Ron Shamir, Dekel Tsur
1998	A*	`conf`	The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract). SODA Ron Shamir, Dekel Tsur
1997	—	`conf`	Faster subtree isomorphism. ISTCS Ron Shamir, Dekel Tsur