Riccardo Dondi

According to our database1, Riccardo Dondi authored at least 87 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Complexity Issues of String to Graph Approximate Matching.
CoRR, 2020

2019
On the tractability of finding disjoint clubs in a network.
Theor. Comput. Sci., 2019

Comparing incomplete sequences via longest common subsequence.
Theor. Comput. Sci., 2019

Covering a Graph with Clubs.
J. Graph Algorithms Appl., 2019

Reconciling multiple genes trees via segmental duplications and losses.
Algorithms for Molecular Biology, 2019

Top-k Overlapping Densest Subgraphs: Approximation and Complexity.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Top k 2-Clubs in a Network: A Genetic Algorithm.
Proceedings of the Computational Science - ICCS 2019, 2019

On the Tractability of Covering a Graph with 2-Clubs.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Optimized Social Explanation for Educational Platforms.
Proceedings of the 11th International Conference on Computer Supported Education, 2019

2018
Parameterized complexity and approximation issues for the colorful components problems.
Theor. Comput. Sci., 2018

Editorial.
Theor. Comput. Sci., 2018

Finding disjoint paths on edge-colored graphs: more tractability results.
J. Comb. Optim., 2018

Editorial of the Special Issue of the 10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC 2017.
Computers, 2018

Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis.
Proceedings of the 26th Euromicro International Conference on Parallel, 2018

Covering with Clubs: Complexity and Approximability.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Optimizing Social Interaction - A Computational Approach to Support Patient Engagement.
Proceedings of the 11th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2018), 2018

Patient Engagement: Theoretical and Heuristic Approaches for Supporting the Clinical Practice.
Proceedings of the Fourth Italian Workshop on Artificial Intelligence for Ambient Assisted Living 2018 co-located with 17th International Conference of the Italian Association for Artificial Intelligence, 2018

2017
Approximating the correction of weighted and unweighted orthology and paralogy relations.
Algorithms for Molecular Biology, 2017

Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results.
Proceedings of the International Conference on Computational Science, 2017

10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC2017.
Proceedings of the International Conference on Computational Science, 2017

The Longest Filled Common Subsequence Problem.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Beyond Evolutionary Trees.
Encyclopedia of Algorithms, 2016

Corrigendum to "Parameterized tractability of the maximum-duo preservation string mapping problem" [Theoret. Comput. Sci. 646(2016) 16-25].
Theor. Comput. Sci., 2016

Parameterized tractability of the maximum-duo preservation string mapping problem.
Theor. Comput. Sci., 2016

On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes.
Journal of Computational Biology, 2016

Correcting Gene Trees by Leaf Insertions: Complexity and Approximation.
Electr. Notes Theor. Comput. Sci., 2016

HapCol: accurate and memory-efficient haplotype assembly from long reads.
Bioinformatics, 2016

The link between orthology relations and gene trees: a correction perspective.
Algorithms for Molecular Biology, 2016

Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Fixed-parameter algorithms for scaffold filling.
Theor. Comput. Sci., 2015

Correcting gene tree by removal and modification: Tractability and approximability.
J. Discrete Algorithms, 2015

A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas.
J. Comput. Sci. Technol., 2015

Covering Pairs in Directed Acyclic Graphs.
Comput. J., 2015

Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective.
Algorithmica, 2015

Robust Conclusions in Mass Spectrometry Analysis.
Proceedings of the International Conference on Computational Science, 2015

8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC2015.
Proceedings of the International Conference on Computational Science, 2015

On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
Complexity insights of the Minimum Duplication problem.
Theor. Comput. Sci., 2014

Gene tree correction for reconciliation and species tree inference: Complexity and algorithms.
J. Discrete Algorithms, 2014

Polytomy refinement for the correction of dubious duplications in gene trees.
Bioinformatics, 2014

Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
The l-Diversity problem: Tractability and approximability.
Theor. Comput. Sci., 2013

Finding approximate and constrained motifs in graphs.
Theor. Comput. Sci., 2013

The constrained shortest common supersequence problem.
J. Discrete Algorithms, 2013

Parameterized complexity of k-anonymity: hardness and tractability.
J. Comb. Optim., 2013

Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability.
Algorithms, 2013

Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs.
Proceedings of the Theory and Applications of Models of Computation, 2013

Duplication-Loss Genome Alignment: Complexity and Algorithm.
Proceedings of the Language and Automata Theory and Applications, 2013

Aligning and Labeling Genomes under the Duplication-Loss Model.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters.
Theor. Comput. Sci., 2012

The binary perfect phylogeny with persistent characters.
Theor. Comput. Sci., 2012

On the parameterized complexity of the repetition free longest common subsequence problem.
Inf. Process. Lett., 2012

New results for the Longest Haplotype Reconstruction problem.
Discrete Applied Mathematics, 2012

On the Complexity of Minimum Labeling Alignment of Two Genomes
CoRR, 2012

Restricted and Swap Common Superstring: A Parameterized View.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Minimum Leaf Removal for Reconciliation: Complexity and Algorithms.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Complexity issues in vertex-colored graph pattern matching.
J. Discrete Algorithms, 2011

Anonymizing binary and small tables is hard to approximate.
J. Comb. Optim., 2011

On the Complexity of the l-diversity Problem.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010
Pure Parsimony Xor Haplotyping.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

Beyond evolutionary trees.
Natural Computing, 2010

Variants of constrained longest common subsequence.
Inf. Process. Lett., 2010

Fingerprint Clustering with Bounded Number of Missing Values.
Algorithmica, 2010

Parameterized Complexity of k-Anonymity: Hardness and Tractability.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
Parameterized Complexity of the k-anonymity Problem
CoRR, 2009

Minimum Factorization Agreement of Spliced ESTs.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

The Longest Haplotype Reconstruction Problem Revisited.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

The k-Anonymity Problem Is Hard.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Maximum Motif Problem in Vertex-Colored Graphs.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
On the Approximation of Correlation Clustering and Consensus Clustering.
J. Comput. Syst. Sci., 2008

Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs.
Algorithmica, 2008

Moving Assistive Technology on the Web: The Farfalla Experience.
Proceedings of the Open Knowlege Society. A Computer Science and Information Systems Manifesto, 2008

2007
Exemplar Longest Common Subsequence.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence.
Journal of Computational Biology, 2007

Anonymizing Binary Tables is APX-hard
CoRR, 2007

Weak pattern matching in colored graphs: Minimizing the number of connected components.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2006
Exemplar Longest Common Subsequence.
Proceedings of the Computational Science, 2006

2005
Reconciling a gene tree to a species tree under the duplication cost model.
Theor. Comput. Sci., 2005

Experimental analysis of a new algorithm for partial haplotype completion.
IJBRA, 2005

Approximating Clustering of Fingerprint Vectors with Missing Values
CoRR, 2005

Correlation Clustering and Consensus Clustering.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2003
The Haplotyping Problem: An Overview of Computational Models and Solutions.
J. Comput. Sci. Technol., 2003

Knowledge Organization and Retrieval in the MILK System.
Proceedings of the Fifteenth International Conference on Software Engineering & Knowledge Engineering (SEKE'2003), 2003

Stimulating knowledge discovery and sharing.
Proceedings of the 2003 International ACM SIGGROUP Conference on Supporting Group Work, 2003

Reconciling Gene Trees to a Species Tree.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003


  Loading...