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