Riccardo Dondi

Danny Hermelin

CoRR, 2020

Complexity Issues of String to Graph Approximate Matching.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2020

Genetic Algorithms for Finding Episodes in Temporal Networks.

[BibT_eX]

[DOI]

Mohammad Mehdi Hosseinzadeh

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

Top-k Connected Overlapping Densest Subgraphs in Dual Networks.

[BibT_eX]

[DOI]

Mohammad Mehdi Hosseinzadeh

Pietro Hiram Guzzi

Proceedings of the Complex Networks & Their Applications IX, 2020

2019

Kernel Machines: Applications.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019

Kernel Methods: Support Vector Machines.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019

Kernel Machines: Introduction.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019

Graph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019

Graph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019

On the tractability of finding disjoint clubs in a network.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Comparing incomplete sequences via longest common subsequence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Covering a Graph with Clubs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Reconciling multiple genes trees via segmental duplications and losses.

[BibT_eX]

[DOI]

Céline Scornavacca

Algorithms Mol. Biol., 2019

Top-k Overlapping Densest Subgraphs: Approximation and Complexity.

[BibT_eX]

[DOI]

Mohammad Mehdi Hosseinzadeh

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Top k 2-Clubs in a Network: A Genetic Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2019, 2019

Optimized Social Explanation for Educational Platforms.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Computer Supported Education, 2019

2018

Parameterized complexity and approximation issues for the colorful components problems.

[BibT_eX]

[DOI]

Florian Sikora

Theor. Comput. Sci., 2018

Editorial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Finding disjoint paths on edge-colored graphs: more tractability results.

[BibT_eX]

[DOI]

Florian Sikora

J. Comb. Optim., 2018

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

[BibT_eX]

[DOI]

Comput., 2018

Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis.

[BibT_eX]

[DOI]

Proceedings of the 26th Euromicro International Conference on Parallel, 2018

Covering with Clubs: Complexity and Approximability.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Optimizing Social Interaction - A Computational Approach to Support Patient Engagement.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2017

Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2017

10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC2017.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2017

The Longest Filled Common Subsequence Problem.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Beyond Evolutionary Trees.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Parameterized tractability of the maximum-duo preservation string mapping problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes.

[BibT_eX]

[DOI]

J. Comput. Biol., 2016

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

[BibT_eX]

[DOI]

Bioinform., 2016

The link between orthology relations and gene trees: a correction perspective.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2016

Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Clique Editing to Support Case Versus Control Discrimination.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Decision Technologies 2016 - Proceedings of the 8th KES International Conference on Intelligent Decision Technologies (KES-IDT 2016), 2016

Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis.

[BibT_eX]

[DOI]

Florian Sikora

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Fixed-parameter algorithms for scaffold filling.

[BibT_eX]

[DOI]

Laurent Bulteau

Anna Paola Carrieri

Theor. Comput. Sci., 2015

Correcting gene tree by removal and modification: Tractability and approximability.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2015

Correcting Gene Trees by Leaf Insertions: Complexity and Approximation.

[BibT_eX]

[DOI]

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Covering Pairs in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Comput. J., 2015

Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective.

[BibT_eX]

[DOI]

Algorithmica, 2015

Robust Conclusions in Mass Spectrometry Analysis.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2015

8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC2015.

[BibT_eX]

[DOI]

Mario Cannataro

Proceedings of the International Conference on Computational Science, 2015

On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

When and How the Perfect Phylogeny Model Explains Evolution.

[BibT_eX]

[DOI]

Anna Paola Carrieri

Teresa M. Przytycka

Proceedings of the Discrete and Topological Models in Molecular Biology, 2014

Complexity insights of the Minimum Duplication problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Gene tree correction for reconciliation and species tree inference: Complexity and algorithms.

[BibT_eX]

[DOI]

Krister M. Swenson

J. Discrete Algorithms, 2014

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

[BibT_eX]

[DOI]

Bioinform., 2014

Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability.

[BibT_eX]

[DOI]

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

The l-Diversity problem: Tractability and approximability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Finding approximate and constrained motifs in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

The constrained shortest common supersequence problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Parameterized complexity of k-anonymity: hardness and tractability.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

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

[BibT_eX]

[DOI]

Algorithms, 2013

Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs.

[BibT_eX]

[DOI]

Andrew Chester

Anthony Wirth

Proceedings of the Theory and Applications of Models of Computation, 2013

Duplication-Loss Genome Alignment: Complexity and Algorithm.

[BibT_eX]

[DOI]

Billel Benzaid

Proceedings of the Language and Automata Theory and Applications, 2013

Aligning and Labeling Genomes under the Duplication-Loss Model.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

The binary perfect phylogeny with persistent characters.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On the parameterized complexity of the repetition free longest common subsequence problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

New results for the Longest Haplotype Reconstruction problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

On the Complexity of Minimum Labeling Alignment of Two Genomes

[BibT_eX]

[DOI]

CoRR, 2012

Restricted and Swap Common Superstring: A Parameterized View.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Minimum Leaf Removal for Reconciliation: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Complexity issues in vertex-colored graph pattern matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Anonymizing binary and small tables is hard to approximate.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

On the Complexity of the l-diversity Problem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

Pure Parsimony Xor Haplotyping.

[BibT_eX]

[DOI]

Romeo Rizzi

IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Beyond evolutionary trees.

[BibT_eX]

[DOI]

Nat. Comput., 2010

Variants of constrained longest common subsequence.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Fingerprint Clustering with Bounded Number of Missing Values.

[BibT_eX]

[DOI]

Algorithmica, 2010

Parameterized Complexity of k-Anonymity: Hardness and Tractability.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Parameterized Complexity of the k-anonymity Problem

[BibT_eX]

[DOI]

CoRR, 2009

Minimum Factorization Agreement of Spliced ESTs.

[BibT_eX]

[DOI]

Raffaella Rizzi

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

The Longest Haplotype Reconstruction Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

The k-Anonymity Problem Is Hard.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Maximum Motif Problem in Vertex-Colored Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

On the Approximation of Correlation Clustering and Consensus Clustering.

[BibT_eX]

[DOI]

Tao Jiang

J. Comput. Syst. Sci., 2008

Moving Assistive Technology on the Web: The Farfalla Experience.

[BibT_eX]

[DOI]

Andrea Mangiatordi

Walter Fornasa

Proceedings of the Open Knowlege Society. A Computer Science and Information Systems Manifesto, 2008

2007

Exemplar Longest Common Subsequence.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2007

A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence.

[BibT_eX]

[DOI]

J. Comput. Biol., 2007

Anonymizing Binary Tables is APX-hard

[BibT_eX]

[DOI]

CoRR, 2007

Weak pattern matching in colored graphs: Minimizing the number of connected components.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2006

Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Exemplar Longest Common Subsequence.

[BibT_eX]

[DOI]

Proceedings of the Computational Science, 2006

2005

Computational problems in the study of genomic variations.

[BibT_eX]

[DOI]

PhD thesis, 2005

Reconciling a gene tree to a species tree under the duplication cost model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Experimental analysis of a new algorithm for partial haplotype completion.

[BibT_eX]

[DOI]

Lorenzo Mariani

Int. J. Bioinform. Res. Appl., 2005

Approximating Clustering of Fingerprint Vectors with Missing Values

[BibT_eX]

[DOI]

CoRR, 2005

Correlation Clustering and Consensus Clustering.

[BibT_eX]

[DOI]

Tao Jiang

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2003

The Haplotyping Problem: An Overview of Computational Models and Solutions.

[BibT_eX]

[DOI]

Jing Li

J. Comput. Sci. Technol., 2003

Knowledge Organization and Retrieval in the MILK System.

[BibT_eX]

Roberto Boselli

Flavio De Paoli

Proceedings of the Fifteenth International Conference on Software Engineering & Knowledge Engineering (SEKE'2003), 2003

Stimulating knowledge discovery and sharing.

[BibT_eX]

[DOI]

Proceedings of the 2003 International ACM SIGGROUP Conference on Supporting Group Work, 2003

Reconciling Gene Trees to a Species Tree.

[BibT_eX]

[DOI]