| The Longest Run Subsequence Problem: Further Complexity Results | 0 | 0.34 | 2021 |
| Finding Colorful Paths in Temporal Graphs | 0 | 0.34 | 2021 |
| Top-K Overlapping Densest Subgraphs: Approximation Algorithms And Computational Complexity | 0 | 0.34 | 2021 |
| Hardness and tractability of the γ-Complete Subgraph problem | 0 | 0.34 | 2021 |
| Genetic Algorithms for Finding Episodes in Temporal Networks. | 0 | 0.34 | 2020 |
| Complexity Issues of String to Graph Approximate Matching. | 0 | 0.34 | 2020 |
| On the Tractability of Covering a Graph with 2-Clubs. | 0 | 0.34 | 2019 |
| Optimized Social Explanation for Educational Platforms | 0 | 0.34 | 2019 |
| On the tractability of finding disjoint clubs in a network | 1 | 0.36 | 2019 |
| Covering a Graph with Clubs | 0 | 0.34 | 2019 |
| Comparing incomplete sequences via longest common subsequence. | 0 | 0.34 | 2019 |
| Top K 2-Clubs In A Network: A Genetic Algorithm | 0 | 0.34 | 2019 |
| Top-k Overlapping Densest Subgraphs: Approximation and Complexity. | 0 | 0.34 | 2018 |
| Optimizing Social Interaction - A Computational Approach to Support Patient Engagement. | 0 | 0.34 | 2018 |
| Reconciling Multiple Genes Trees via Segmental Duplications and Losses. | 1 | 0.36 | 2018 |
| Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis | 0 | 0.34 | 2018 |
| Editorial of the Special Issue of the 10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC 2017. | 0 | 0.34 | 2018 |
| Patient Engagement - Theoretical and Heuristic Approaches for Supporting the Clinical Practice. | 0 | 0.34 | 2018 |
| Approximating the correction of weighted and unweighted orthology and paralogy relations. | 3 | 0.37 | 2017 |
| The Longest Filled Common Subsequence Problem. | 1 | 0.36 | 2017 |
| 10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC2017. | 0 | 0.34 | 2017 |
| Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. | 1 | 0.36 | 2016 |
| Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem. | 1 | 0.37 | 2016 |
| Correcting Gene Trees by Leaf Insertions: Complexity and Approximation | 0 | 0.34 | 2016 |
| Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results. | 7 | 0.46 | 2016 |
| On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes. | 4 | 0.39 | 2016 |
| Parameterized Complexity and Approximation Issues for the Colorful Components Problems. | 2 | 0.38 | 2016 |
| The link between orthology relations and gene trees: a correction perspective. | 10 | 0.52 | 2016 |
| Corrigendum to "Parameterized tractability of the maximum-duo preservation string mapping problem" [Theoret. Comput. Sci. 646(2016) 16-25]. | 0 | 0.34 | 2016 |
| A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas. | 0 | 0.34 | 2015 |
| Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective | 1 | 0.37 | 2015 |
| Robust Conclusions in Mass Spectrometry Analysis | 0 | 0.34 | 2015 |
| On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem | 4 | 0.44 | 2015 |
| Correcting gene tree by removal and modification: Tractability and approximability. | 0 | 0.34 | 2015 |
| Polytomy refinement for the correction of dubious duplications in gene trees. | 2 | 0.37 | 2014 |
| Finding approximate and constrained motifs in graphs. | 0 | 0.34 | 2013 |
| Covering Pairs in Directed Acyclic Graphs. | 5 | 0.41 | 2013 |
| Restricted and swap common superstring: a parameterized view | 1 | 0.35 | 2012 |
| Complexity issues in vertex-colored graph pattern matching | 14 | 0.85 | 2011 |
| Anonymizing binary and small tables is hard to approximate | 10 | 0.56 | 2011 |
| On the complexity of the l-diversity problem | 1 | 0.35 | 2011 |
| Parameterized complexity of k-anonymity: hardness and tractability | 8 | 0.50 | 2010 |
| Minimum factorization agreement of spliced ESTs | 2 | 0.40 | 2009 |
| The longest haplotype reconstruction problem revisited | 0 | 0.34 | 2009 |
| The k-anonymity problem is hard | 5 | 0.52 | 2009 |
| Anonymizing Binary Tables is APX-hard | 4 | 0.55 | 2007 |
| Experimental analysis of a new algorithm for partial haplotype completion. | 1 | 0.35 | 2005 |
| Approximating Clustering of Fingerprint Vectors with Missing Values | 0 | 0.34 | 2005 |
