| Publication | Date of Publication | Type |
|---|
| A Sankoff-Rousseau-like algorithm for minimizing lateral gene transfers and losses on single origin characters | 2026-02-26 | Paper |
| Whole-genome duplication detection with phylogenomics reconciliation: a scalable approach | 2026-02-26 | Paper |
| The path-label reconciliation (PLR) dissimilarity measure for gene trees | 2026-02-13 | Paper |
| Finding maximum common contractions between phylogenetic networks | 2026-02-13 | Paper |
| The two-squirrel problem and its relatives | 2026-01-28 | Paper |
Preprocessing complexity for some graph problems parameterized by structural parameters
Procedia Computer Science | 2025-12-11 | Paper |
On the complexity of temporal arborescence reconfiguration
Theoretical Computer Science | 2025-11-01 | Paper |
| An FPT algorithm for temporal graph untangling | 2025-09-24 | Paper |
The longest subsequence-duplicated subsequence and related problems
Information and Computation | 2025-09-09 | Paper |
An FPT algorithm for timeline cover
Journal of Computer and System Sciences | 2025-08-21 | Paper |
Path partitions of phylogenetic networks
Theoretical Computer Science | 2024-12-12 | Paper |
| Parameterized complexity of domination problems using restricted modular partitions | 2024-12-03 | Paper |
Permutation-constrained common string partitions with applications
Algorithmica | 2024-12-03 | Paper |
Improved kernelization and fixed-parameter algorithms for bicluster editing
Journal of Combinatorial Optimization | 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
Comparative Genomics | 2023-12-12 | Paper |
Two strikes against the phage recombination problem
Comparative Genomics | 2023-12-12 | Paper |
Finding agreement cherry-reduced subnetworks in level-1 networks
Comparative Genomics | 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
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Edge clique covers in graphs with independence number two
Journal of Graph Theory | 2023-09-29 | Paper |
Further results on Hendry's Conjecture
Discrete Mathematics & Theoretical Computer Science | 2023-05-31 | Paper |
On the tractability of covering a graph with 2-clubs
Algorithmica | 2023-04-11 | Paper |
scientific article; zbMATH DE number 7651113 (Why is no real title available?)
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2022-07-21 | Paper |
Reconciling multiple genes trees via segmental duplications and losses
(available as arXiv preprint) | 2022-07-18 | Paper |
| Permutation-constrained common string partitions with applications | 2022-06-15 | Paper |
Computing the tandem duplication distance is NP-hard
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
| Novel phylogenetic network distances based on cherry picking | 2021-12-21 | Paper |
Indirect identification of horizontal gene transfer
Journal of Mathematical Biology | 2021-07-13 | Paper |
Error detection and correction of gene trees
Models and Algorithms for Genome Evolution | 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
Theoretical Computer Science | 2021-01-25 | Paper |
| The complexity of speedrunning video games | 2020-08-11 | Paper |
| On the weighted quartet consensus problem | 2020-05-25 | Paper |
Distributed pattern formation in a ring
(available as arXiv preprint) | 2020-03-03 | Paper |
Time-energy tradeoffs for evacuation by two robots in the wireless model
Lecture Notes in Computer Science | 2020-03-03 | Paper |
Weak coverage of a rectangular barrier
Algorithmica | 2020-02-28 | Paper |
| Satisfying neighbor preferences on a circle | 2020-02-12 | Paper |
Whom to befriend to influence people
Theoretical Computer Science | 2020-02-06 | Paper |
On the tractability of covering a graph with 2-clubs
Fundamentals of Computation Theory | 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
Theoretical Computer Science | 2019-04-23 | Paper |
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
Theoretical Computer Science | 2019-01-25 | Paper |
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
Theoretical Computer Science | 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
(available as arXiv preprint) | 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
Lecture Notes in Computer Science | 2017-07-25 | Paper |
Weak coverage of a rectangular barrier
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Whom to befriend to influence people
Lecture Notes in Computer Science | 2016-12-01 | Paper |
Hamiltonian chordal graphs are not cycle extendable
SIAM Journal on Discrete Mathematics | 2015-06-08 | Paper |
On Generalizations of Pairwise Compatibility Graphs
(available as arXiv preprint) | N/A | Paper |
