| Publication | Date of Publication | Type |
|---|
| Path partitions of phylogenetic networks | 2024-12-12 | Paper |
| Parameterized complexity of domination problems using restricted modular partitions | 2024-12-03 | Paper |
| Permutation-constrained common string partitions with applications | 2024-12-03 | Paper |
| Improved kernelization and fixed-parameter algorithms for bicluster editing | 2024-11-28 | Paper |
| The longest subsequence-repeated subsequence problem | 2024-09-16 | Paper |
| Predicting horizontal gene transfers with perfect transfer networks | 2024-08-13 | Paper |
| Recognizing \(k\)-leaf powers in polynomial time, for constant \(k\) | 2024-07-19 | Paper |
| How brokers can optimally abuse traders | 2024-05-16 | Paper |
| Classifying the post-duplication fate of paralogous genes | 2023-12-12 | Paper |
| Two strikes against the phage recombination problem | 2023-12-12 | Paper |
| Finding agreement cherry-reduced subnetworks in level-1 networks | 2023-12-12 | Paper |
| Predicting Horizontal Gene Transfers with Perfect Transfer Networks | 2023-12-05 | Paper |
| Recognizing k -Leaf Powers in Polynomial Time, for Constant k | 2023-10-23 | Paper |
| Edge clique covers in graphs with independence number two | 2023-09-29 | Paper |
| Further results on Hendry's Conjecture | 2023-05-31 | Paper |
| On the tractability of covering a graph with 2-clubs | 2023-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874451 | 2023-02-07 | Paper |
| The Tandem Duplication Distance Is NP-Hard | 2023-02-07 | Paper |
| Relative Timing Information and Orthology in Evolutionary Scenarios | 2022-12-05 | Paper |
| The complexity of finding common partitions of genomes with predefined block sizes | 2022-08-11 | Paper |
| Energy Consumption of Group Search on a Line | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090329 | 2022-07-18 | Paper |
| Permutation-constrained common string partitions with applications | 2022-06-15 | Paper |
| Computing the Tandem Duplication Distance is NP-Hard | 2022-01-07 | Paper |
| Novel phylogenetic network distances based on cherry picking | 2021-12-21 | Paper |
| Indirect identification of horizontal gene transfer | 2021-07-13 | Paper |
| Error Detection and Correction of Gene Trees | 2021-06-10 | Paper |
| Even better fixed-parameter algorithms for bicluster editing | 2021-04-21 | Paper |
| Time-energy tradeoffs for evacuation by two robots in the wireless model | 2021-01-25 | Paper |
| The complexity of speedrunning video games | 2020-08-11 | Paper |
| On the Weighted Quartet Consensus problem | 2020-05-25 | Paper |
| Time-energy tradeoffs for evacuation by two robots in the wireless model | 2020-03-03 | Paper |
| Distributed pattern formation in a ring | 2020-03-03 | Paper |
| Weak coverage of a rectangular barrier | 2020-02-28 | Paper |
| Satisfying neighbor preferences on a circle | 2020-02-12 | Paper |
| Whom to befriend to influence people | 2020-02-06 | Paper |
| On the tractability of covering a graph with 2-clubs | 2020-01-30 | Paper |
| Reconstruction of time-consistent species trees | 2019-10-29 | Paper |
| Editing graphs to satisfy diversity requirements | 2019-10-11 | Paper |
| On the weighted quartet consensus problem | 2019-04-23 | Paper |
| The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics | 2019-01-25 | Paper |
| Correction of weighted orthology and paralogy relations -- complexity and algorithmic results | 2018-03-23 | Paper |
| On strongly chordal graphs that are not leaf powers | 2018-01-04 | Paper |
| Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost. | 2017-10-17 | Paper |
| Orthology Relation and Gene Tree Correction: Complexity Results | 2017-07-25 | Paper |
| Weak coverage of a rectangular barrier | 2017-07-21 | Paper |
| Whom to befriend to influence people | 2016-12-01 | Paper |
| Hamiltonian Chordal Graphs are not Cycle Extendable | 2015-06-08 | Paper |
| On Generalizations of Pairwise Compatibility Graphs | N/A | Paper |
