| 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 |
| https://portal.mardi4nfdi.de/entity/Q5111890 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5271449 | 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 |
