| Publication | Date of Publication | Type |
|---|
| Untangling temporal graphs of bounded degree | 2023-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098785 | 2023-06-14 | Paper |
| On the tractability of covering a graph with 2-clubs | 2023-04-11 | Paper |
| Computing the \(k\) densest subgraphs of a graph | 2022-10-28 | Paper |
| Finding colorful paths in temporal graphs | 2022-10-25 | Paper |
| MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms | 2022-10-24 | Paper |
| On the complexity of approximately matching a string to a directed graph | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090329 | 2022-07-18 | Paper |
| Complexity and algorithms for MUL-tree pruning | 2022-03-22 | Paper |
| Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem | 2021-06-16 | Paper |
| Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity | 2021-05-11 | Paper |
| Complexity issues of string to graph approximate matching | 2020-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110878 | 2020-05-25 | Paper |
| On the tractability of covering a graph with 2-clubs | 2020-01-30 | Paper |
| Comparing incomplete sequences via longest common subsequence | 2019-11-13 | Paper |
| On the tractability of finding disjoint clubs in a network | 2019-06-18 | Paper |
| Covering a Graph with Clubs | 2019-05-24 | Paper |
| Maximum disjoint paths on edge-colored graphs: approximability and tractability | 2019-03-26 | Paper |
| Finding disjoint paths on edge-colored graphs: more tractability results | 2018-12-06 | Paper |
| Covering with clubs: complexity and approximability | 2018-09-06 | Paper |
| Parameterized complexity and approximation issues for the colorful components problems | 2018-06-18 | Paper |
| Correction of weighted orthology and paralogy relations -- complexity and algorithmic results | 2018-03-23 | Paper |
| Finding disjoint paths on edge-colored graphs: more tractability results | 2017-02-01 | Paper |
| Corrigendum to: ``Parameterized tractability of the maximum-duo preservation string mapping problem. | 2016-10-21 | Paper |
| Parameterized tractability of the maximum-duo preservation string mapping problem | 2016-08-31 | Paper |
| Parameterized complexity and approximation issues for the colorful components problems | 2016-08-17 | Paper |
| Correcting gene trees by leaf insertions: complexity and approximation | 2016-08-05 | Paper |
| Fixed-Parameter Algorithms for Scaffold Filling | 2015-10-16 | Paper |
| Restricted and swap common superstring: a multivariate algorithmic perspective | 2015-09-02 | Paper |
| On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem | 2015-08-20 | Paper |
| Correcting gene tree by removal and modification: tractability and approximability | 2015-08-18 | Paper |
| Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability | 2015-02-25 | Paper |
| Fixed-parameter algorithms for scaffold filling | 2015-01-28 | Paper |
| The constrained shortest common supersequence problem | 2014-08-13 | Paper |
| When and How the Perfect Phylogeny Model Explains Evolution | 2014-06-23 | Paper |
| Gene tree correction for reconciliation and species tree inference: complexity and algorithms | 2014-04-01 | Paper |
| Covering Pairs in Directed Acyclic Graphs | 2014-03-31 | Paper |
| Complexity insights of the minimum duplication problem | 2014-03-27 | Paper |
| The \(l\)-diversity problem: tractability and approximability | 2014-01-13 | Paper |
| Finding approximate and constrained motifs in graphs | 2014-01-09 | Paper |
| Parameterized complexity of \(k\)-anonymity: hardness and tractability | 2013-08-09 | Paper |
| Aligning and Labeling Genomes under the Duplication-Loss Model | 2013-08-05 | Paper |
| Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs | 2013-05-28 | Paper |
| Duplication-Loss Genome Alignment: Complexity and Algorithm | 2013-03-18 | Paper |
| Restricted and Swap Common Superstring: A Parameterized View | 2013-01-07 | Paper |
| The binary perfect phylogeny with persistent characters | 2012-10-11 | Paper |
| Minimum Leaf Removal for Reconciliation: Complexity and Algorithms | 2012-08-14 | Paper |
| Complexity Insights of the Minimum Duplication Problem | 2012-06-15 | Paper |
| A randomized PTAS for the minimum consensus clustering with a fixed number of clusters | 2012-05-30 | Paper |
| New results for the longest haplotype reconstruction problem | 2012-05-30 | Paper |
| On the parameterized complexity of the repetition free longest common subsequence problem | 2012-05-04 | Paper |
| Variants of constrained longest common subsequence | 2012-03-27 | Paper |
| On the Complexity of the l-diversity Problem | 2011-08-17 | Paper |
| Finding Approximate and Constrained Motifs in Graphs | 2011-06-29 | Paper |
| Anonymizing binary and small tables is hard to approximate | 2011-06-17 | Paper |
| Parameterized Complexity of k-Anonymity: Hardness and Tractability | 2011-05-19 | Paper |
| Complexity issues in vertex-colored graph pattern matching | 2011-05-03 | Paper |
| Fingerprint clustering with bounded number of missing values | 2010-09-16 | Paper |
| Beyond evolutionary trees | 2010-09-16 | Paper |
| The k-Anonymity Problem Is Hard | 2009-10-20 | Paper |
| The Longest Haplotype Reconstruction Problem Revisited | 2009-10-20 | Paper |
| Maximum Motif Problem in Vertex-Colored Graphs | 2009-07-07 | Paper |
| Exemplar Longest Common Subsequence | 2008-12-09 | Paper |
| Inferring (biological) signal transduction networks via transitive reductions of directed graphs | 2008-07-01 | Paper |
| On the approximation of correlation clustering and consensus clustering | 2008-06-26 | Paper |
| Fingerprint Clustering with Bounded Number of Missing Values | 2007-09-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Reconciling a gene tree to a species tree under the duplication cost model | 2005-12-29 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| The haplotyping problem: an overview of computational models and solutions | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437502 | 2003-12-02 | Paper |
