Dekel Tsur

J. Comb. Optim., May, 2025

Faster parameterized algorithm for 3-Hitting Set.

[BibT_eX]

[DOI]

CoRR, January, 2025

Smaller kernels for 3-leaf power modifications problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2025

Faster parameterized algorithm for r-pseudoforest deletion.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2025

Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2025

2024

Algorithms for 2-club cluster deletion problems using automated generation of branching rules.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2024

Smaller kernels for two vertex deletion problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2024

2023

Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., April, 2023

Faster parameterized algorithms for two vertex deletion problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Above guarantee parameterization for vertex cover on graphs with maximum degree 4.

[BibT_eX]

[DOI]

J. Comb. Optim., 2023

Faster deterministic algorithm for Co-Path Set.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

Faster deterministic algorithm for Cactus Vertex Deletion.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

2022

Faster algorithm for pathwidth one vertex deletion.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Cluster deletion revisited.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

2021

Faster Parameterized Algorithm for Cluster Vertex Deletion.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Representation of ordered trees with a given degree distribution.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

Faster parameterized algorithm for Bicluster Editing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Kernel for Kt-free Edge Deletion.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Algorithms for deletion problems on split graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

An O∗(2.619k) algorithm for 4-Path Vertex Cover.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

An FPT algorithm for orthogonal buttons and scissors.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Faster algorithms for cograph edge modification problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

2019

Faster deterministic parameterized algorithm for k-Path.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Parameterized algorithm for 3-path vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Succinct data structure for dynamic trees with faster queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Faster parameterized algorithm for pumpkin vertex deletion set.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

The effective entropy of next/previous larger/smaller value queries.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Faster parameterized algorithm for Bicluter Editing.

[BibT_eX]

[DOI]

CoRR, 2019

An algorithm for destroying claws and diamonds.

[BibT_eX]

[DOI]

CoRR, 2019

Kernel for Kt-free edge deletion.

[BibT_eX]

[DOI]

CoRR, 2019

l-path vertex cover is easier than l-hitting set for small l.

[BibT_eX]

[DOI]

CoRR, 2019

A note on the Split to Block Vertex Deletion problem.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Succinct data structures for nearest colored node in a tree.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

An O^*(2.619^k) algorithm for 4-path vertex cover.

[BibT_eX]

[DOI]

CoRR, 2018

Weighted vertex cover on graphs with maximum degree 3.

[BibT_eX]

[DOI]

CoRR, 2018

Faster deterministic parameterized algorithm for k-Path.

[BibT_eX]

[DOI]

CoRR, 2018

Dynamic all scores matrices for LCS score.

[BibT_eX]

[DOI]

Amir Carmel

CoRR, 2018

2016

Succinct data-structure for nearest colored node in a tree.

[BibT_eX]

[DOI]

CoRR, 2016

On Almost Monge All Scores Matrices.

[BibT_eX]

[DOI]

Amir Carmel

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Succinct representation of labeled trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2014

Two-Dimensional Parameterized Matching.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Improved Filters for the Approximate Suffix-Prefix Overlap Problem.

[BibT_eX]

[DOI]

Gregory Kucherov

Proceedings of the String Processing and Information Retrieval, 2014

Recent Results on Three Problems in Comparative Structural RNAomics.

[BibT_eX]

[DOI]

Proceedings of the 1st Workshop on Computational Methods for Structural RNAs (CMSR 2014), 2014

Approximate String Matching Using a Bidirectional Index.

[BibT_eX]

[DOI]

Gregory Kucherov

Kamil Salikhov

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

The Worst Case Complexity of Maximum Parsimony.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Top-k document retrieval in optimal space.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Approximate String Matching using a Bidirectional Index.

[BibT_eX]

[DOI]

Gregory Kucherov

CoRR, 2013

Efficient edit distance with duplications and contractions.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2013

Efficient All Path Score Computations on Grid Graphs.

[BibT_eX]

[DOI]

Ury Matarazzo

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2011

Edit Distance with Duplications and Contractions Revisited.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Fast index for approximate string matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach.

[BibT_eX]

[DOI]

Shay Zakov

Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

2009

Sparse RNA Folding: Time and Space Efficient Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

Fast RNA Structure Alignment for Crossing Input Structures.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

Faster algorithms for guided tree edit distance.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Fast Algorithms for Computing Tree LCS.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Protein identification by spectral networks analysis.

[BibT_eX]

[DOI]

Proc. Natl. Acad. Sci. USA, 2007

Improved scheduling in rings.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

Character sets of strings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Tree-edges deletion problems with bounded diameter obstruction sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Indexing a Dictionary for Subset Matching Queries.

[BibT_eX]

[DOI]

Gad M. Landau

Oren Weimann

Proceedings of the String Processing and Information Retrieval, 2007

Generalized LCS.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2007

Finding Witnesses by Peeling.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Testing Properties of Constraint-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

2006

Optimal Probing Patterns for Sequencing by Hybridization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

A New Approach to Protein Identification.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2006

2005

Sequencing by hybridization with errors: handling longer sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Testing Orientation Properties

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Optimal Spaced Seeds for Faster Approximate String Matching.

[BibT_eX]

[DOI]

Martin Farach-Colton

Gad M. Landau

Süleyman Cenk Sahinalp

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Identification of Post-Translational Modifications via Blind Search of Mass-Spectra.

[BibT_eX]

[DOI]

Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, 2005

Two Dimensional Parameterized Matching.

[BibT_eX]

[DOI]

Carmit Hazay

Moshe Lewenstein

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Tight Bounds for String Reconstruction Using Substring Queries.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2005

2004

Efficient One Dimensional Real Scaled Matching.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2004

Approximate Labelled Subtree Homeomorphism.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Faster Two Dimensional Pattern Matching with Rotations.

[BibT_eX]

[DOI]

Amihood Amir

Oren Kapah

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

Tradeoffs in Worst-Case Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Bounds for Resquencing by Hybridization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Sequencing by Hybridization in Few Rounds.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Algorithmic problems in graph theory and molecular biology

[BibT_eX]

[DOI]

PhD thesis, 2002

Cluster Graph Modification Problems.

[BibT_eX]

[DOI]

Roded Sharan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Improved Algorithms for the Random Cluster Graph Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

2001

Large scale sequencing by hybridization.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

1998

The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Faster subtree isomorphism.

[BibT_eX]

[DOI]