| Publication | Date of Publication | Type |
|---|
| Quasi-kernels in split graphs | 2025-01-06 | Paper |
| Recognizing unit multiple interval graphs is hard | 2024-12-04 | Paper |
| The \textsc{maximum zero-sum partition} problem | 2024-11-06 | Paper |
| Parity permutation pattern matching | 2024-08-13 | Paper |
| Permutation pattern matching for doubly partially ordered patterns | 2024-05-06 | Paper |
| Parity permutation pattern matching | 2023-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098781 | 2023-06-14 | Paper |
| Algorithmic aspects of small quasi-kernels | 2023-05-05 | Paper |
| On recognising words that are squares for the shuffle product | 2023-04-26 | Paper |
| On shuffled-square-free words | 2023-01-04 | Paper |
| Finding a Small Number of Colourful Components | 2022-07-18 | Paper |
| Sorting with forbidden intermediates | 2020-05-18 | Paper |
| The clever shopper problem | 2020-02-27 | Paper |
| Recognizing binary shuffle squares is \textsf{NP}-hard | 2020-01-16 | Paper |
| Unshuffling permutations: trivial bijections and compositions | 2019-10-15 | Paper |
| The clever shopper problem | 2018-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4557834 | 2018-11-26 | Paper |
| Pattern matching for separable permutations | 2018-10-17 | Paper |
| Pattern matching for \(k\)-track permutations | 2018-09-06 | Paper |
| The \(S\)-\textsc{labeling} problem: an algorithmic tour | 2018-06-27 | Paper |
| Solving the tree containment problem in linear time for nearly stable phylogenetic networks | 2018-06-27 | Paper |
| Algorithmic and algebraic aspects of unshuffling permutations | 2018-05-17 | Paper |
| Sorting with forbidden intermediates | 2016-10-06 | Paper |
| Locating a Tree in a Phylogenetic Network in Quadratic Time | 2016-06-22 | Paper |
| Unshuffling Permutations | 2016-05-03 | Paper |
| Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time | 2016-04-04 | Paper |
| Algorithmic Aspects of the S-Labeling Problem | 2016-04-04 | Paper |
| Obtaining a Triangular Matrix by Independent Row-Column Permutations | 2016-01-11 | Paper |
| Some algorithmic results for [2]-sumset covers | 2014-10-07 | Paper |
| On the combinatorics of suffix arrays | 2014-04-14 | Paper |
| Single and Multiple Consecutive Permutation Motif Search | 2014-01-14 | Paper |
| Finding approximate and constrained motifs in graphs | 2014-01-09 | Paper |
| On the \(S\)-\textsc{Labeling} problem | 2013-10-10 | Paper |
| Minimum mosaic inference of a set of recombinants | 2013-07-30 | Paper |
| On Recognizing Words That Are Squares for the Shuffle Product | 2013-06-14 | Paper |
| Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph | 2013-03-21 | Paper |
| A faster algorithm for finding minimum Tucker submatrices | 2012-12-07 | Paper |
| Medians of an odd number of permutations | 2012-09-18 | Paper |
| Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths | 2012-08-14 | Paper |
| Approximation of RNA multiple structural alignment | 2012-01-04 | Paper |
| Algorithmic Aspects of Heterogeneous Biological Networks Comparison | 2011-08-12 | Paper |
| Finding Approximate and Constrained Motifs in Graphs | 2011-06-29 | Paper |
| A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row | 2011-06-17 | Paper |
| Complexity issues in vertex-colored graph pattern matching | 2011-05-03 | Paper |
| Upper and lower bounds for finding connected motifs in vertex-colored graphs | 2011-04-28 | Paper |
| A Faster Algorithm for Finding Minimum Tucker Submatrices | 2010-07-29 | Paper |
| Finding common structured patterns in linear graphs | 2010-06-07 | Paper |
| Complexity issues in color-preserving graph embeddings | 2010-02-09 | Paper |
| Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions | 2010-02-09 | Paper |
| Pattern Matching for 321-Avoiding Permutations | 2009-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3393448 | 2009-08-26 | Paper |
| On Finding Small 2-Generating Sets | 2009-07-23 | Paper |
| Maximum Motif Problem in Vertex-Colored Graphs | 2009-07-07 | Paper |
| On the Approximability of Comparing Genomes with Duplicates | 2009-05-19 | Paper |
| Finding occurrences of protein complexes in protein-protein interaction graphs | 2009-04-16 | Paper |
| The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated | 2009-02-24 | Paper |
| Fixed-parameter algorithms for protein similarity search under mRNA structure constraints | 2009-02-23 | Paper |
| On the parameterized complexity of multiple-interval graph problems | 2009-02-19 | Paper |
| Genomes Containing Duplicates Are Hard to Compare | 2008-12-09 | Paper |
| Exemplar Longest Common Subsequence | 2008-12-09 | Paper |
| The minimum substring cover problem | 2008-12-03 | Paper |
| Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs | 2008-08-08 | Paper |
| Approximating the 2-interval pattern problem | 2008-07-10 | Paper |
| On Restrictions of Balanced 2-Interval Graphs | 2008-07-01 | Paper |
| Longest Common Separable Pattern Among Permutations | 2008-06-17 | Paper |
| Common Structured Patterns in Linear Graphs: Approximation and Combinatorics | 2008-06-17 | Paper |
| What Makes the Arc-Preserving Subsequence Problem Hard? | 2008-03-19 | Paper |
| Pattern Matching in Protein-Protein Interaction Graphs | 2008-02-26 | Paper |
| The Minimum Substring Cover Problem | 2008-02-20 | Paper |
| Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs | 2007-11-28 | Paper |
| Extracting constrained 2-interval subsets in 2-interval sets | 2007-10-18 | Paper |
| Approximation of RNA Multiple Structural Alignment | 2007-09-14 | Paper |
| Packing of (0, 1)-matrices | 2007-02-20 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| On the computational complexity of 2-interval pattern matching problems | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737689 | 2004-08-11 | Paper |
| Quasi-kernels in split graphs | N/A | Paper |
