| Publication | Date of Publication | Type |
|---|
Faster parameterized algorithm for \(r\)-pseudoforest deletion
Theoretical Computer Science | 2025-01-16 | Paper |
Smaller kernels for two vertex deletion problems
Information Processing Letters | 2024-06-07 | Paper |
Algorithms for 2-club cluster deletion problems using automated generation of branching rules
Theoretical Computer Science | 2024-01-02 | Paper |
Faster parameterized algorithms for two vertex deletion problems
Theoretical Computer Science | 2023-04-20 | Paper |
Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}
Theoretical Computer Science | 2023-03-24 | Paper |
Faster deterministic algorithm for \textsc{Co-Path Set}
Information Processing Letters | 2023-01-30 | Paper |
Above guarantee parameterization for vertex cover on graphs with maximum degree 4
Journal of Combinatorial Optimization | 2022-12-23 | Paper |
Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Faster deterministic algorithm for cactus vertex deletion
Information Processing Letters | 2022-10-28 | Paper |
Faster algorithm for pathwidth one vertex deletion
Theoretical Computer Science | 2022-05-23 | Paper |
Cluster deletion revisited
Information Processing Letters | 2021-10-19 | Paper |
Faster parameterized algorithm for cluster vertex deletion
Theory of Computing Systems | 2021-06-24 | Paper |
An \(O^\ast ( 2 . 61 9^k )\) algorithm for 4-path vertex cover
Discrete Applied Mathematics | 2021-03-25 | Paper |
Faster parameterized algorithm for Bicluster Editing
Information Processing Letters | 2021-03-11 | Paper |
Algorithms for deletion problems on split graphs
Information Processing Letters | 2021-03-11 | Paper |
Kernel for \(K_t\)\textsc-free Edge Deletion
Information Processing Letters | 2021-03-11 | Paper |
Representation of ordered trees with a given degree distribution
Journal of Computer and System Sciences | 2021-03-10 | Paper |
An FPT algorithm for orthogonal buttons and scissors
Information Processing Letters | 2020-10-07 | Paper |
Faster algorithms for cograph edge modification problems
Information Processing Letters | 2020-04-03 | Paper |
Faster deterministic parameterized algorithm for \(k\)-path
Theoretical Computer Science | 2019-09-10 | Paper |
Parameterized algorithm for 3-path vertex cover
Theoretical Computer Science | 2019-08-13 | Paper |
Succinct data structure for dynamic trees with faster queries
Theoretical Computer Science | 2019-06-06 | Paper |
Faster parameterized algorithm for pumpkin vertex deletion set
Information Processing Letters | 2019-05-10 | Paper |
The effective entropy of next/previous larger/smaller value queries
Information Processing Letters | 2019-03-11 | Paper |
On almost Monge all scores matrices
Algorithmica | 2019-01-11 | Paper |
Two-dimensional parameterized matching
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Succinct data structures for nearest colored node in a tree
Information Processing Letters | 2018-03-16 | Paper |
scientific article; zbMATH DE number 6792426 (Why is no real title available?)
| 2017-10-17 | Paper |
Approximate string matching using a bidirectional index
Theoretical Computer Science | 2016-06-16 | Paper |
Succinct representation of labeled trees
Theoretical Computer Science | 2014-12-02 | Paper |
Finding witnesses by peeling
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Top-\(k\) document retrieval in optimal space
Information Processing Letters | 2014-08-13 | Paper |
Approximate String Matching Using a Bidirectional Index
Combinatorial Pattern Matching | 2014-06-30 | Paper |
The Worst Case Complexity of Maximum Parsimony
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Efficient all path score computations on grid graphs
Theoretical Computer Science | 2014-03-13 | Paper |
Efficient all path score computations on grid graphs
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Edit distance with duplications and contractions revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Fast RNA structure alignment for crossing input structures
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Sparse RNA folding: time and space efficient algorithms
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Fast index for approximate string matching
Journal of Discrete Algorithms | 2011-01-20 | Paper |
Sequencing by hybridization in few rounds
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Faster algorithms for guided tree edit distance
Information Processing Letters | 2010-06-09 | Paper |
Indexing a Dictionary for Subset Matching Queries
Algorithms and Applications | 2010-05-04 | Paper |
Sequencing by hybridization in few rounds
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Fast algorithms for computing tree LCS
Theoretical Computer Science | 2009-10-09 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Fast RNA Structure Alignment for Crossing Input Structures
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Sparse RNA Folding: Time and Space Efficient Algorithms
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms | 2009-05-13 | Paper |
Generalized LCS
Theoretical Computer Science | 2009-01-08 | Paper |
Finding Witnesses by Peeling
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Fast Algorithms for Computing Tree LCS
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Improved algorithms for the random cluster graph model
Random Structures \& Algorithms | 2008-01-08 | Paper |
Efficient one-dimensional real scaled matching
Journal of Discrete Algorithms | 2007-10-30 | Paper |
A New Approach to Protein Identification
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics | 2007-06-26 | Paper |
Improved scheduling in rings
Journal of Parallel and Distributed Computing | 2007-05-23 | Paper |
Faster two-dimensional pattern matching with rotations
Theoretical Computer Science | 2007-01-22 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Tradeoffs in worst-case equilibria
Theoretical Computer Science | 2006-09-14 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Sequencing by hybridization with errors: handling longer sequences
Theoretical Computer Science | 2005-04-06 | Paper |
Cluster graph modification problems
Discrete Applied Mathematics | 2004-11-12 | Paper |
scientific article; zbMATH DE number 2089226 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 1953109 (Why is no real title available?)
| 2003-07-25 | Paper |
Faster Subtree Isomorphism
Journal of Algorithms | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1303580 (Why is no real title available?)
| 1999-06-17 | Paper |
