| Publication | Date of Publication | Type |
|---|
| Automated design of dynamic programming schemes for RNA folding with pseudoknots | 2024-08-13 | Paper |
| The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings | 2024-07-01 | Paper |
| An algorithmic framework for locally constrained homomorphisms | 2024-05-08 | Paper |
| An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions | 2024-05-06 | Paper |
| Permutation pattern matching for doubly partially ordered patterns | 2024-05-06 | Paper |
| Reordering a tree according to an order on its leaves | 2024-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192479 | 2024-02-12 | Paper |
| Decomposing subcubic graphs into claws, paths or triangles | 2023-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6133868 | 2023-07-24 | Paper |
| The tree-child network problem for line trees and the shortest common supersequences for permutations | 2023-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098781 | 2023-06-14 | Paper |
| An algorithmic framework for locally constrained homomorphisms | 2023-05-05 | Paper |
| Sequence graphs realizations and ambiguity in language models | 2023-03-30 | Paper |
| On shuffled-square-free words | 2023-01-04 | Paper |
| Finding a Small Number of Colourful Components | 2022-07-18 | Paper |
| Sorting by multi-cut rearrangements | 2022-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005095 | 2021-08-04 | Paper |
| Your rugby mates don't need to know your colleagues: triadic closure with edge colors | 2021-06-30 | Paper |
| Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation | 2021-05-25 | Paper |
| Multi-Player Diffusion Games on Graph Classes | 2021-03-26 | Paper |
| Tight Hardness Results for Consensus Problems on Circular Strings and Time Series | 2020-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110893 | 2020-05-25 | Paper |
| Consensus strings with small maximum distance and small distance sum | 2020-04-01 | Paper |
| The clever shopper problem | 2020-02-27 | Paper |
| Your rugby mates don't need to know your colleagues: triadic closure with edge colors | 2020-02-06 | Paper |
| Recognizing binary shuffle squares is \textsf{NP}-hard | 2020-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967170 | 2019-07-03 | Paper |
| Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable | 2019-06-20 | Paper |
| Co-clustering under the maximum norm | 2019-03-26 | Paper |
| The clever shopper problem | 2018-11-28 | Paper |
| Pattern matching for \(k\)-track permutations | 2018-09-06 | Paper |
| Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width | 2018-02-13 | Paper |
| Star Partitions of Perfect Graphs | 2017-07-05 | Paper |
| The complexity of finding effectors | 2017-03-31 | Paper |
| Triangle counting in dynamic graph streams | 2016-11-01 | Paper |
| Computing an evolutionary ordering is hard | 2016-10-17 | Paper |
| Decomposing Cubic Graphs into Connected Subgraphs of Size Three | 2016-09-02 | Paper |
| (Prefix) reversal distance for (signed) strings with few blocks or small alphabets | 2016-07-15 | Paper |
| Fixed-Parameter Algorithms for Scaffold Filling | 2015-10-16 | Paper |
| The complexity of finding effectors | 2015-09-30 | Paper |
| Multi-player Diffusion Games on Graph Classes | 2015-09-30 | Paper |
| Co-Clustering Under the Maximum Norm | 2015-09-11 | Paper |
| Pancake flipping is hard | 2015-08-31 | Paper |
| Combinatorial voter control in elections | 2015-06-01 | Paper |
| Fixed-parameter algorithms for scaffold filling | 2015-01-28 | Paper |
| Some algorithmic results for [2]-sumset covers | 2014-10-07 | Paper |
| Triangle counting in dynamic graph streams | 2014-09-02 | Paper |
| Star Partitions of Perfect Graphs | 2014-07-01 | Paper |
| Reversal Distances for Strings with Few Blocks or Small Alphabets | 2014-06-30 | Paper |
| Maximal strip recovery problem with gaps: hardness and approximation algorithms | 2014-02-03 | Paper |
| Revisiting the minimum breakpoint linearization problem | 2014-01-10 | Paper |
| Sorting by Transpositions Is Difficult | 2013-01-04 | Paper |
| Pancake flipping is hard | 2012-09-25 | Paper |
| Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths | 2012-08-14 | Paper |
| Tractability and approximability of maximal strip recovery | 2012-08-08 | Paper |
| Sorting by Transpositions Is Difficult | 2011-07-06 | Paper |
| Tractability and Approximability of Maximal Strip Recovery | 2011-06-29 | Paper |
| Revisiting the Minimum Breakpoint Linearization Problem | 2010-06-17 | Paper |
| Maximal strip recovery problem with gaps: hardness and approximation algorithms | 2009-12-17 | Paper |
