2024
Algorithms for 2-club cluster deletion problems using automated generation of branching rules.
Theor. Comput. Sci., February, 2024
Smaller kernels for two vertex deletion problems.
Inf. Process. Lett., 2024
2023
Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree.
Theor. Comput. Sci., April, 2023
Faster parameterized algorithms for two vertex deletion problems.
Theor. Comput. Sci., 2023
Above guarantee parameterization for vertex cover on graphs with maximum degree 4.
J. Comb. Optim., 2023
Faster deterministic algorithm for Co-Path Set.
Inf. Process. Lett., 2023
Faster deterministic algorithm for Cactus Vertex Deletion.
Inf. Process. Lett., 2023
2022
Faster algorithm for pathwidth one vertex deletion.
Theor. Comput. Sci., 2022
Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing.
J. Comb. Optim., 2022
Cluster deletion revisited.
Inf. Process. Lett., 2022
2021
Faster Parameterized Algorithm for Cluster Vertex Deletion.
Theory Comput. Syst., 2021
Representation of ordered trees with a given degree distribution.
J. Comput. Syst. Sci., 2021
Faster parameterized algorithm for Bicluster Editing.
Inf. Process. Lett., 2021
Kernel for <i>K</i><sub><i>t</i></sub>-free Edge Deletion.
Inf. Process. Lett., 2021
Algorithms for deletion problems on split graphs.
Inf. Process. Lett., 2021
An O∗(2.619k) algorithm for 4-Path Vertex Cover.
Discret. Appl. Math., 2021
2020
An FPT algorithm for orthogonal buttons and scissors.
Inf. Process. Lett., 2020
Faster algorithms for cograph edge modification problems.
Inf. Process. Lett., 2020
2019
Faster deterministic parameterized algorithm for <i>k</i>-Path.
Theor. Comput. Sci., 2019
Parameterized algorithm for 3-path vertex cover.
Theor. Comput. Sci., 2019
Succinct data structure for dynamic trees with faster queries.
Theor. Comput. Sci., 2019
Faster parameterized algorithm for pumpkin vertex deletion set.
Inf. Process. Lett., 2019
The effective entropy of next/previous larger/smaller value queries.
Inf. Process. Lett., 2019
Faster parameterized algorithm for Bicluter Editing.
CoRR, 2019
An algorithm for destroying claws and diamonds.
CoRR, 2019
Kernel for Kt-free edge deletion.
CoRR, 2019
l-path vertex cover is easier than l-hitting set for small l.
CoRR, 2019
A note on the Split to Block Vertex Deletion problem.
CoRR, 2019
On Almost Monge All Scores Matrices.
Algorithmica, 2019
2018
Succinct data structures for nearest colored node in a tree.
Inf. Process. Lett., 2018
An O^*(2.619^k) algorithm for 4-path vertex cover.
CoRR, 2018
Weighted vertex cover on graphs with maximum degree 3.
CoRR, 2018
Faster deterministic parameterized algorithm for k-Path.
CoRR, 2018
Dynamic all scores matrices for LCS score.
CoRR, 2018
2016
Approximate string matching using a bidirectional index.
Theor. Comput. Sci., 2016
Succinct data-structure for nearest colored node in a tree.
CoRR, 2016
2015
Succinct representation of labeled trees.
Theor. Comput. Sci., 2015
2014
Efficient all path score computations on grid graphs.
Theor. Comput. Sci., 2014
Two-Dimensional Parameterized Matching.
ACM Trans. Algorithms, 2014
The Worst Case Complexity of Maximum Parsimony.
J. Comput. Biol., 2014
Improved Filters for the Approximate Suffix-Prefix Overlap Problem.
Proceedings of the String Processing and Information Retrieval, 2014
Recent Results on Three Problems in Comparative Structural RNAomics.
Proceedings of the 1st Workshop on Computational Methods for Structural RNAs (CMSR 2014), 2014
2013
Top-k document retrieval in optimal space.
Inf. Process. Lett., 2013
Approximate String Matching using a Bidirectional Index.
CoRR, 2013
Efficient edit distance with duplications and contractions.
Algorithms Mol. Biol., 2013
2011
Finding witnesses by peeling.
ACM Trans. Algorithms, 2011
Sparse RNA folding: Time and space efficient algorithms.
J. Discrete Algorithms, 2011
Fast RNA structure alignment for crossing input structures.
J. Discrete Algorithms, 2011
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach.
Algorithms Mol. Biol., 2011
Edit Distance with Duplications and Contractions Revisited.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011
2010
Fast index for approximate string matching.
J. Discrete Algorithms, 2010
Sequencing by hybridization in few rounds.
J. Comput. Syst. Sci., 2010
2009
Fast algorithms for computing tree LCS.
Theor. Comput. Sci., 2009
2008
Theor. Comput. Sci., 2008
Approximate labelled subtree homeomorphism.
J. Discrete Algorithms, 2008
Faster algorithms for guided tree edit distance.
Inf. Process. Lett., 2008
2007
Improved algorithms for the random cluster graph model.
Random Struct. Algorithms, 2007
Protein identification by spectral networks analysis.
Proc. Natl. Acad. Sci. USA, 2007
Improved scheduling in rings.
J. Parallel Distributed Comput., 2007
Character sets of strings.
J. Discrete Algorithms, 2007
Efficient one-dimensional real scaled matching.
J. Discrete Algorithms, 2007
Optimal spaced seeds for faster approximate string matching.
J. Comput. Syst. Sci., 2007
Testing Properties of Constraint-Graphs.
Electron. Colloquium Comput. Complex., 2007
Tree-edges deletion problems with bounded diameter obstruction sets.
Discret. Appl. Math., 2007
Indexing a Dictionary for Subset Matching Queries.
Proceedings of the String Processing and Information Retrieval, 2007
2006
Tradeoffs in worst-case equilibria.
Theor. Comput. Sci., 2006
Faster two-dimensional pattern matching with rotations.
Theor. Comput. Sci., 2006
Optimal Probing Patterns for Sequencing by Hybridization.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006
A New Approach to Protein Identification.
Proceedings of the Research in Computational Molecular Biology, 2006
2005
Sequencing by hybridization with errors: handling longer sequences.
Theor. Comput. Sci., 2005
Testing Orientation Properties
Electron. Colloquium Comput. Complex., 2005
Identification of Post-Translational Modifications via Blind Search of Mass-Spectra.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, 2005
Two Dimensional Parameterized Matching.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005
Tight Bounds for String Reconstruction Using Substring Queries.
Proceedings of the Approximation, 2005
2004
Cluster graph modification problems.
Discret. Appl. Math., 2004
2003
Bounds for Resquencing by Hybridization.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003
2002
Algorithmic problems in graph theory and molecular biology
PhD thesis, 2002
Large Scale Sequencing by Hybridization.
J. Comput. Biol., 2002
1999
Faster Subtree Isomorphism.
J. Algorithms, 1999
1998
The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
