| Publication | Date of Publication | Type |
|---|
| Embedding phylogenetic trees in networks of low treewidth | 2024-09-06 | Paper |
| Treewidth-Based Algorithms for the Small Parsimony Problem on Networks | 2023-07-24 | Paper |
| What Is Known About Vertex Cover Kernelization? | 2023-06-30 | Paper |
| Fast exact dynamic time warping on run-length encoded time series | 2023-02-16 | Paper |
| Quantifying hierarchical conflicts in homology statements | 2022-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089244 | 2022-07-18 | Paper |
| Tree containment with soft polytomies | 2022-06-28 | Paper |
| Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds | 2021-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116473 | 2020-08-25 | Paper |
| Linearizing genomes: exact methods and local search | 2020-07-20 | Paper |
| Scanning phylogenetic networks is NP-hard | 2020-07-20 | Paper |
| The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration | 2020-05-27 | Paper |
| Power Edge Set and Zero Forcing Set remain difficult in cubic graphs | 2020-02-25 | Paper |
| New results about the linearization of scaffolds sharing repeated contigs | 2019-10-11 | Paper |
| New polynomial-time algorithm around the scaffolding problem | 2019-07-25 | Paper |
| Complexity and lowers bounds for power edge set problem | 2019-01-18 | Paper |
| On residual approximation in solution extension problems | 2018-12-06 | Paper |
| Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases | 2018-06-01 | Paper |
| On the linearization of scaffolds sharing repeated contigs | 2018-03-26 | Paper |
| New insights for power edge set problem | 2018-02-26 | Paper |
| A polynomial-time algorithm for outerplanar diameter improvement | 2017-09-07 | Paper |
| The complexity of arc routing problems | 2017-07-11 | Paper |
| On Residual Approximation in Solution Extension Problems | 2017-02-01 | Paper |
| Instance guaranteed ratio on greedy heuristic for genome scaffolding | 2017-02-01 | Paper |
| On the fixed parameter tractability of agreement-based phylogenetic distances | 2017-01-25 | Paper |
| Phylogenetic incongruence through the lens of monadic second order logic | 2016-03-03 | Paper |
| Parameterized certificate dispersal and its variants | 2016-02-26 | Paper |
| On the complexity of scaffolding problems: from cliques to sparse graphs | 2016-02-05 | Paper |
| Polynomial-time data reduction for the subset interconnection design problem | 2015-11-27 | Paper |
| Interval scheduling and colorful independent sets | 2015-11-12 | Paper |
| A polynomial-time algorithm for outerplanar diameter improvement | 2015-10-20 | Paper |
| On the complexity of hub labeling (extended abstract) | 2015-09-16 | Paper |
| Constant thresholds can make target set selection tractable | 2015-02-05 | Paper |
| Exploiting a hypergraph model for finding Golomb rulers | 2014-11-14 | Paper |
| On the parameterized complexity of consensus clustering | 2014-06-23 | Paper |
| Effective and efficient data reduction for the subset interconnection design problem | 2014-01-14 | Paper |
| Two-layer planarization parameterized by feedback edge set | 2014-01-10 | Paper |
| Efficient algorithms for Eulerian extension and rural Postman | 2013-06-27 | Paper |
| Constant thresholds can make target set selection tractable | 2013-04-19 | Paper |
| Interval scheduling and colorful independent sets | 2013-03-21 | Paper |
| A new view on rural postman based on Eulerian extension and matching | 2013-01-18 | Paper |
| Exploiting a Hypergraph Model for Finding Golomb Rulers | 2012-11-02 | Paper |
| Linear-time computation of a linear problem kernel for dominating set on planar graphs | 2012-06-15 | Paper |
| On making directed graphs transitive | 2012-05-11 | Paper |
| A new view on rural postman based on Eulerian extension and matching | 2012-01-13 | Paper |
| From few components to an Eulerian graph by adding ARCS | 2011-12-16 | Paper |
| On the parameterized complexity of consensus clustering | 2011-12-16 | Paper |
| On tractable cases of target set selection | 2010-12-09 | Paper |
| Efficient algorithms for Eulerian extension | 2010-11-16 | Paper |
| Extended islands of tractability for parsimony haplotyping | 2010-07-26 | Paper |
| Two-layer planarization parameterized by feedback edge set | 2010-06-17 | Paper |
| On Making Directed Graphs Transitive | 2009-10-20 | Paper |
