| Publication | Date of Publication | Type |
|---|
Parameterized covering in semi-ladder-free hypergraphs
ACM Transactions on Computation Theory | 2025-08-01 | Paper |
Finding small patterns in permutations in linear time
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Linear time 3-approximation for the MAST problem
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Fixed-Parameter Algorithms for Finding Agreement Supertrees
SIAM Journal on Computing | 2015-06-02 | Paper |
A faster FPT algorithm for bipartite contraction
Information Processing Letters | 2014-04-14 | Paper |
Kernel and fast algorithm for dense triplet inconsistency
Theoretical Computer Science | 2014-01-10 | Paper |
A faster FPT algorithm for bipartite contraction
Lecture Notes in Computer Science | 2013-12-10 | Paper |
Finding and counting vertex-colored subtrees
Algorithmica | 2013-05-16 | Paper |
On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
Algorithmica | 2013-05-16 | Paper |
FPT algorithms for path-transversal and cycle-transversal problems
Discrete Optimization | 2012-10-16 | Paper |
Parameterized complexity and approximability of the longest compatible sequence problem
Discrete Optimization | 2012-10-16 | Paper |
Fixed-parameter algorithms for finding agreement supertrees
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Parameterized algorithms for inclusion of linear matchings
Algorithms and Computation | 2011-12-16 | Paper |
Robustness of phylogenetic inference based on minimum evolution
Bulletin of Mathematical Biology | 2010-12-15 | Paper |
On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
Parameterized and Exact Computation | 2010-12-07 | Paper |
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics | 2010-10-11 | Paper |
Finding and counting vertex-colored subtrees
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Kernel and fast algorithm for dense triplet inconsistency
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Pattern matching for 321-avoiding permutations
Algorithms and Computation | 2009-12-17 | Paper |
Computing a smallest multi-labeled phylogenetic tree from rooted triplets
Algorithms and Computation | 2009-12-17 | Paper |
On the approximability of the maximum agreement subtree and maximum compatible tree problems
Discrete Applied Mathematics | 2009-06-30 | Paper |
New Results on Optimizing Rooted Triplets Consistency
Algorithms and Computation | 2009-01-29 | Paper |
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Parameterized Complexity and Approximability of the SLCS Problem
Parameterized and Exact Computation | 2008-06-05 | Paper |
FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
Parameterized and Exact Computation | 2008-06-05 | Paper |
Parameterized Problems on Coincidence Graphs
Algorithms and Computation | 2008-04-24 | Paper |
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
