default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRiccardo Dondi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j57]Giorgio Lazzarinetti
, Riccardo Dondi, Sara Manzoni, Italo Zoppis:
An Attention-Based Method for the Minimum Vertex Cover Problem on Complex Networks. Algorithms 17(2): 72 (2024)- [c65]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Alexandru Popa:
Maximum Letter-Duplicated Subsequence (short paper). ICTCS 2024: 340-345 - [c64]Riccardo Dondi, Manuel Lafond:
On the Complexity of Temporal Arborescence Reconfiguration. SAND 2024: 10:1-10:15 - [c63]Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
Partial Temporal Vertex Cover with Bounded Activity Intervals. SAND 2024: 11:1-11:14 - [c62]Giorgio Lazzarinetti, Sara Manzoni, Italo Zoppis, Riccardo Dondi:
FastMinTC+: A Fast and Effective Heuristic for Minimum Timeline Cover on Temporal Networks. TIME 2024: 20:1-20:18 - 2023
- [j56]Riccardo Dondi, Manuel Lafond:
On the Tractability of Covering a Graph with 2-Clubs. Algorithmica 85(4): 992-1028 (2023) - [j55]Riccardo Dondi, Danny Hermelin:
Computing the k densest subgraphs of a graph. Inf. Process. Lett. 179: 106316 (2023) - [j54]Mohammad Mehdi Hosseinzadeh, Mario Cannataro, Pietro Hiram Guzzi, Riccardo Dondi:
Temporal networks in biology and medicine: a survey on models, algorithms, and tools. Netw. Model. Anal. Health Informatics Bioinform. 12(1): 10 (2023) - [j53]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Colorful path detection in vertex-colored temporal. Netw. Sci. 11(4): 615-631 (2023) - [j52]Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh, Marianna Milano:
Dense subgraphs in temporal social networks. Soc. Netw. Anal. Min. 13(1): 128 (2023) - [j51]Riccardo Dondi:
Untangling temporal graphs of bounded degree. Theor. Comput. Sci. 969: 114040 (2023) - [c61]Riccardo Dondi, Alexandru Popa:
Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms. IWOCA 2023: 173-184 - [c60]Riccardo Dondi, Manuel Lafond:
An FPT Algorithm for Temporal Graph Untangling. IPEC 2023: 12:1-12:16 - [i22]Riccardo Dondi, Manuel Lafond:
An FTP Algorithm for Temporal Graph Untangling. CoRR abs/2307.00786 (2023) - 2022
- [j50]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
On the complexity of approximately matching a string to a directed graph. Inf. Comput. 288: 104748 (2022) - [j49]Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk:
MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms. Theor. Comput. Sci. 937: 22-38 (2022) - [c59]Riccardo Dondi, Alexandru Popa:
Covering a Graph with Densest Subgraphs. CALDAM 2022: 152-163 - [c58]Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh:
Integrating Temporal Graphs via Dual Networks: Dense Graph Discovery. COMPLEX NETWORKS (2) 2022: 523-535 - [c57]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Italo Zoppis:
Dense Temporal Subgraphs in Protein-Protein Interaction Networks. ICCS (1) 2022: 469-480 - [c56]Riccardo Dondi:
Insights into the Complexity of Disentangling Temporal Graphs. ICTCS 2022: 1-13 - [c55]Riccardo Dondi:
Sequence Classification via LCS. KES-IDT 2022: 77-86 - 2021
- [j48]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Pietro H. Guzzi:
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks. Appl. Netw. Sci. 6(1): 40 (2021) - [j47]Ambroise Baril, Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Hardness and tractability of the γ-Complete Subgraph problem. Inf. Process. Lett. 169: 106105 (2021) - [j46]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis:
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity. J. Comb. Optim. 41(1): 80-104 (2021) - [j45]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Dense Sub-networks Discovery in Temporal Networks. SN Comput. Sci. 2(3): 158 (2021) - [c54]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Finding Colorful Paths in Temporal Graphs. COMPLEX NETWORKS 2021: 553-565 - [c53]Riccardo Dondi, Florian Sikora:
The Longest Run Subsequence Problem: Further Complexity Results. CPM 2021: 14:1-14:15 - [c52]Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk:
Complexity and Algorithms for MUL-Tree Pruning. IWOCA 2021: 324-339 - [e3]Tomás Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. H. Wong:
SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings. Lecture Notes in Computer Science 12607, Springer 2021, ISBN 978-3-030-67730-5 [contents] - [i21]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Finding Colorful Paths in Temporal Graphs. CoRR abs/2109.01392 (2021) - 2020
- [c51]Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh:
Top-k Connected Overlapping Densest Subgraphs in Dual Networks. COMPLEX NETWORKS (2) 2020: 585-596 - [c50]Mauro Castelli, Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Genetic Algorithms for Finding Episodes in Temporal Networks. KES 2020: 215-224 - [c49]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Complexity Issues of String to Graph Approximate Matching. LATA 2020: 248-259 - [e2]Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora:
SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings. Lecture Notes in Computer Science 12011, Springer 2020, ISBN 978-3-030-38918-5 [contents] - [i20]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Complexity Issues of String to Graph Approximate Matching. CoRR abs/2001.01961 (2020) - [i19]Riccardo Dondi, Danny Hermelin:
Computing the k Densest Subgraphs of a Graph. CoRR abs/2002.07695 (2020) - [i18]Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh:
Top-k Connected Overlapping Densest Subgraphs in Dual Networks. CoRR abs/2008.01573 (2020) - [i17]Riccardo Dondi, Florian Sikora:
The Longest Run Subsequence Problem: Further Complexity Results. CoRR abs/2011.08119 (2020)
2010 – 2019
- 2019
- [j44]Riccardo Dondi, Manuel Lafond, Céline Scornavacca:
Reconciling multiple genes trees via segmental duplications and losses. Algorithms Mol. Biol. 14(1): 7:1-7:19 (2019) - [j43]Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis:
Covering a Graph with Clubs. J. Graph Algorithms Appl. 23(2): 271-292 (2019) - [j42]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
On the tractability of finding disjoint clubs in a network. Theor. Comput. Sci. 777: 243-251 (2019) - [j41]Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Comparing incomplete sequences via longest common subsequence. Theor. Comput. Sci. 796: 272-285 (2019) - [c48]Italo Zoppis, Riccardo Dondi, Sara Manzoni, Giancarlo Mauri, Luca Marconi, Francesco Epifania:
Optimized Social Explanation for Educational Platforms. CSEDU (1) 2019: 85-91 - [c47]Riccardo Dondi, Manuel Lafond:
On the Tractability of Covering a Graph with 2-Clubs. FCT 2019: 243-257 - [c46]Mauro Castelli, Riccardo Dondi, Sara Manzoni, Giancarlo Mauri, Italo Zoppis:
Top k 2-Clubs in a Network: A Genetic Algorithm. ICCS (5) 2019: 656-663 - [c45]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis:
Top-k Overlapping Densest Subgraphs: Approximation and Complexity. ICTCS 2019: 110-121 - [r6]Italo Zoppis, Giancarlo Mauri, Riccardo Dondi:
Kernel Machines: Introduction. Encyclopedia of Bioinformatics and Computational Biology (1) 2019: 495-502 - [r5]Italo Zoppis, Giancarlo Mauri, Riccardo Dondi:
Kernel Methods: Support Vector Machines. Encyclopedia of Bioinformatics and Computational Biology (1) 2019: 503-510 - [r4]Italo Zoppis, Giancarlo Mauri, Riccardo Dondi:
Kernel Machines: Applications. Encyclopedia of Bioinformatics and Computational Biology (1) 2019: 511-518 - [r3]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Graph Isomorphism. Encyclopedia of Bioinformatics and Computational Biology (1) 2019: 933-939 - [r2]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Graph Algorithms. Encyclopedia of Bioinformatics and Computational Biology (1) 2019: 940-949 - 2018
- [j40]Giuseppe Agapito, Mario Cannataro, Mauro Castelli, Riccardo Dondi, Italo Zoppis:
Editorial of the Special Issue of the 10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC 2017. Comput. 7(1): 17 (2018) - [j39]Riccardo Dondi, Florian Sikora:
Finding disjoint paths on edge-colored graphs: more tractability results. J. Comb. Optim. 36(4): 1315-1332 (2018) - [j38]Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri:
Editorial. Theor. Comput. Sci. 717: 1 (2018) - [j37]Riccardo Dondi, Florian Sikora:
Parameterized complexity and approximation issues for the colorful components problems. Theor. Comput. Sci. 739: 1-12 (2018) - [c44]Italo Zoppis, Riccardo Dondi, Sara Manzoni, Giancarlo Mauri:
Patient Engagement: Theoretical and Heuristic Approaches for Supporting the Clinical Practice. AI*AAL@AI*IA 2018: 51-66 - [c43]Italo Zoppis, Riccardo Dondi, Eugenio Santoro, Gianluca Castelnuovo, Francesco Sicurello, Giancarlo Mauri:
Optimizing Social Interaction - A Computational Approach to Support Patient Engagement. HEALTHINF 2018: 651-657 - [c42]Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis:
Covering with Clubs: Complexity and Approximability. IWOCA 2018: 153-164 - [c41]Italo Zoppis, Riccardo Dondi, Davide Coppetti, Alessandro Beltramo, Giancarlo Mauri:
Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis. PDP 2018: 259-266 - [c40]Riccardo Dondi, Manuel Lafond, Céline Scornavacca:
Reconciling Multiple Genes Trees via Segmental Duplications and Losses. WABI 2018: 5:1-5:16 - [i16]Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis:
Covering with Clubs: Complexity and Approximability. CoRR abs/1806.01119 (2018) - [i15]Riccardo Dondi, Manuel Lafond, Céline Scornavacca:
Reconciling Multiple Genes Trees via Segmental Duplications and Losses. CoRR abs/1806.03988 (2018) - [i14]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis:
Top-k Overlapping Densest Subgraphs: Approximation and Complexity. CoRR abs/1809.02434 (2018) - 2017
- [j36]Riccardo Dondi, Manuel Lafond, Nadia El-Mabrouk:
Approximating the correction of weighted and unweighted orthology and paralogy relations. Algorithms Mol. Biol. 12(1): 4:1-4:15 (2017) - [c39]Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
The Longest Filled Common Subsequence Problem. CPM 2017: 14:1-14:13 - [c38]Giuseppe Agapito, Mario Cannataro, Mauro Castelli, Riccardo Dondi, Italo Zoppis:
10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC2017. ICCS 2017: 1113-1114 - [c37]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results. ICCS 2017: 1115-1124 - 2016
- [j35]Manuel Lafond, Riccardo Dondi, Nadia El-Mabrouk:
The link between orthology relations and gene trees: a correction perspective. Algorithms Mol. Biol. 11: 4 (2016) - [j34]Yuri Pirola, Simone Zaccaria, Riccardo Dondi, Gunnar W. Klau, Nadia Pisanti, Paola Bonizzoni:
HapCol: accurate and memory-efficient haplotype assembly from long reads. Bioinform. 32(11): 1610-1617 (2016) - [j33]Paola Bonizzoni, Riccardo Dondi, Gunnar W. Klau, Yuri Pirola, Nadia Pisanti, Simone Zaccaria:
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes. J. Comput. Biol. 23(9): 718-736 (2016) - [j32]Stefano Beretta, Mauro Castelli, Riccardo Dondi:
Parameterized tractability of the maximum-duo preservation string mapping problem. Theor. Comput. Sci. 646: 16-25 (2016) - [j31]Stefano Beretta, Mauro Castelli, Riccardo Dondi:
Corrigendum to "Parameterized tractability of the maximum-duo preservation string mapping problem" [Theoret. Comput. Sci. 646(2016) 16-25]. Theor. Comput. Sci. 653: 108-110 (2016) - [c36]Riccardo Dondi, Florian Sikora:
Parameterized Complexity and Approximation Issues for the Colorful Components Problems. CiE 2016: 261-270 - [c35]Riccardo Dondi, Florian Sikora:
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. COCOA 2016: 113-127 - [c34]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Clique Editing to Support Case Versus Control Discrimination. KES-IDT (1) 2016: 27-36 - [c33]Riccardo Dondi, Nadia El-Mabrouk, Manuel Lafond:
Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results. WABI 2016: 121-136 - [e1]Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri:
Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9778, Springer 2016, ISBN 978-3-319-41167-5 [contents] - [r1]Riccardo Dondi, Yuri Pirola:
Beyond Evolutionary Trees. Encyclopedia of Algorithms 2016: 183-189 - [i13]Riccardo Dondi, Florian Sikora:
Parameterized Complexity and Approximation Issues for the Colorful Components Problems. CoRR abs/1605.03071 (2016) - [i12]Riccardo Dondi, Florian Sikora:
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. CoRR abs/1609.04951 (2016) - 2015
- [j30]Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective. Algorithmica 72(4): 914-939 (2015) - [j29]Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni, Riccardo Dondi, Yuri Pirola:
Covering Pairs in Directed Acyclic Graphs. Comput. J. 58(7): 1673-1686 (2015) - [j28]Carlo Batini, Paola Bonizzoni, Marco Comerio, Riccardo Dondi, Yuri Pirola, Francesco Salandra:
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas. J. Comput. Sci. Technol. 30(1): 214-224 (2015) - [j27]Stefano Beretta, Mauro Castelli, Riccardo Dondi:
Correcting gene tree by removal and modification: Tractability and approximability. J. Discrete Algorithms 33: 115-129 (2015) - [j26]Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi:
Fixed-parameter algorithms for scaffold filling. Theor. Comput. Sci. 568: 72-83 (2015) - [c32]Paola Bonizzoni, Riccardo Dondi, Gunnar W. Klau, Yuri Pirola, Nadia Pisanti, Simone Zaccaria:
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem. CPM 2015: 100-113 - [c31]Stefano Beretta, Mario Cannataro, Riccardo Dondi:
8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science - BBC2015. ICCS 2015: 680-682 - [c30]Italo Zoppis, Riccardo Dondi, Massimiliano Borsani, Erica Gianazza, Clizia Chinello, Fulvio Magni, Giancarlo Mauri:
Robust Conclusions in Mass Spectrometry Analysis. ICCS 2015: 683-692 - [c29]Stefano Beretta, Riccardo Dondi:
Correcting Gene Trees by Leaf Insertions: Complexity and Approximation. ICTCS 2015: 35-50 - [i11]Stefano Beretta, Mauro Castelli, Riccardo Dondi:
Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem. CoRR abs/1512.03220 (2015) - 2014
- [j25]Manuel Lafond, Cédric Chauve, Riccardo Dondi, Nadia El-Mabrouk:
Polytomy refinement for the correction of dubious duplications in gene trees. Bioinform. 30(17): 519-526 (2014) - [j24]Riccardo Dondi, Nadia El-Mabrouk, Krister M. Swenson:
Gene tree correction for reconciliation and species tree inference: Complexity and algorithms. J. Discrete Algorithms 25: 51-65 (2014) - [j23]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity insights of the Minimum Duplication problem. Theor. Comput. Sci. 530: 66-79 (2014) - [c28]Stefano Beretta, Riccardo Dondi:
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability. CiE 2014: 42-52 - [c27]Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi:
Fixed-Parameter Algorithms for Scaffold Filling. ISCO 2014: 137-148 - [c26]Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni, Riccardo Dondi, Yuri Pirola:
Covering Pairs in Directed Acyclic Graphs. LATA 2014: 126-137 - [p1]Paola Bonizzoni, Anna Paola Carrieri, Gianluca Della Vedova, Riccardo Dondi, Teresa M. Przytycka:
When and How the Perfect Phylogeny Model Explains Evolution. Discrete and Topological Models in Molecular Biology 2014: 67-83 - 2013
- [j22]Paola Bonizzoni, Riccardo Dondi, Yuri Pirola:
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability. Algorithms 6(1): 1-11 (2013) - [j21]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola:
Parameterized complexity of k-anonymity: hardness and tractability. J. Comb. Optim. 26(1): 19-43 (2013) - [j20]Riccardo Dondi:
The constrained shortest common supersequence problem. J. Discrete Algorithms 21: 11-17 (2013) - [j19]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Finding approximate and constrained motifs in graphs. Theor. Comput. Sci. 483: 10-21 (2013) - [j18]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
The l-Diversity problem: Tractability and approximability. Theor. Comput. Sci. 511: 159-171 (2013) - [c25]Riccardo Dondi, Nadia El-Mabrouk:
Aligning and Labeling Genomes under the Duplication-Loss Model. CiE 2013: 97-107 - [c24]Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk:
Duplication-Loss Genome Alignment: Complexity and Algorithm. LATA 2013: 116-127 - [c23]Andrew Chester, Riccardo Dondi, Anthony Wirth:
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs. TAMC 2013: 260-271 - [i10]Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni, Riccardo Dondi, Yuri Pirola:
Covering Pairs in Directed Acyclic Graphs. CoRR abs/1310.5037 (2013) - 2012
- [j17]Riccardo Dondi:
New results for the Longest Haplotype Reconstruction problem. Discret. Appl. Math. 160(9): 1299-1310 (2012) - [j16]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora:
On the parameterized complexity of the repetition free longest common subsequence problem. Inf. Process. Lett. 112(7): 272-276 (2012) - [j15]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters. Theor. Comput. Sci. 429: 36-45 (2012) - [j14]Paola Bonizzoni, Chiara Braghin, Riccardo Dondi, Gabriella Trucco:
The binary perfect phylogeny with persistent characters. Theor. Comput. Sci. 454: 51-63 (2012) - [c22]Riccardo Dondi, Nadia El-Mabrouk:
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms. CPM 2012: 399-412 - [c21]Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Restricted and Swap Common Superstring: A Parameterized View. IPEC 2012: 49-60 - [c20]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity Insights of the Minimum Duplication Problem. SOFSEM 2012: 153-164 - [i9]Riccardo Dondi, Nadia El-Mabrouk:
On the Complexity of Minimum Labeling Alignment of Two Genomes. CoRR abs/1206.1877 (2012) - 2011
- [j13]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
Anonymizing binary and small tables is hard to approximate. J. Comb. Optim. 22(1): 97-119 (2011) - [j12]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms 9(1): 82-99 (2011) - [c19]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Finding Approximate and Constrained Motifs in Graphs. CPM 2011: 388-401 - [c18]Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
On the Complexity of the l-diversity Problem. MFCS 2011: 266-277 - [i8]Chiara Braghin, Riccardo Dondi, Gabriella Trucco, Paola Bonizzoni:
The Binary Perfect Phylogeny with Persistent characters. CoRR abs/1110.6739 (2011) - 2010
- [j11]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri:
Fingerprint Clustering with Bounded Number of Missing Values. Algorithmica 58(2): 282-303 (2010) - [j10]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola:
Variants of constrained longest common subsequence. Inf. Process. Lett. 110(20): 877-881 (2010) - [j9]Gianluca Della Vedova, Riccardo Dondi, Tao Jiang, Giulio Pavesi, Yuri Pirola, Lusheng Wang:
Beyond evolutionary trees. Nat. Comput. 9(2): 421-435 (2010) - [j8]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi:
Pure Parsimony Xor Haplotyping. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 598-610 (2010) - [c17]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola:
Parameterized Complexity of k-Anonymity: Hardness and Tractability. IWOCA 2010: 242-255 - [i7]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi:
Pure Parsimony Xor Haplotyping. CoRR abs/1001.1210 (2010)
2000 – 2009
- 2009
- [c16]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Maximum Motif Problem in Vertex-Colored Graphs. CPM 2009: 221-235 - [c15]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
The k-Anonymity Problem Is Hard. FCT 2009: 26-37 - [c14]Riccardo Dondi:
The Longest Haplotype Reconstruction Problem Revisited. FCT 2009: 109-120 - [c13]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters. ICTCS 2009: 55-58 - [c12]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi:
Pure Parsimony Xor Haplotyping. ISBRA 2009: 186-197 - [c11]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Raffaella Rizzi:
Minimum Factorization Agreement of Spliced ESTs. WABI 2009: 1-12 - [i6]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters. CoRR abs/0907.1840 (2009) - [i5]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola:
Parameterized Complexity of the k-anonymity Problem. CoRR abs/0910.3148 (2009) - [i4]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola:
Variants of Constrained Longest Common Subsequence. CoRR abs/0912.0368 (2009) - 2008
- [j7]Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag:
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. Algorithmica 51(2): 129-159 (2008) - [j6]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang:
On the Approximation of Correlation Clustering and Consensus Clustering. J. Comput. Syst. Sci. 74(5): 671-696 (2008) - [c10]Andrea Mangiatordi, Riccardo Dondi, Walter Fornasa:
Moving Assistive Technology on the Web: The Farfalla Experience. WSKS (2) 2008: 598-602 - 2007
- [j5]Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Sema Kachalo, Eduardo D. Sontag, Alexander Zelikovsky, Kelly Westbrooks:
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. J. Comput. Biol. 14(7): 927-949 (2007) - [j4]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette:
Exemplar Longest Common Subsequence. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 535-543 (2007) - [c9]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Weak pattern matching in colored graphs: Minimizing the number of connected components. ICTCS 2007: 27-38 - [c8]Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Sema Kachalo, Eduardo D. Sontag, Alexander Zelikovsky, Kelly Westbrooks:
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. WABI 2007: 407-419 - [i3]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
Anonymizing Binary Tables is APX-hard. CoRR abs/0707.0421 (2007) - 2006
- [c7]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri:
Fingerprint Clustering with Bounded Number of Missing Values. CPM 2006: 106-116 - [c6]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Exemplar Longest Common Subsequence. International Conference on Computational Science (2) 2006: 622-629 - [i2]Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag:
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [b1]Riccardo Dondi:
Computational problems in the study of genomic variations. University of Milan, Italy, 2005 - [j3]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Lorenzo Mariani:
Experimental analysis of a new algorithm for partial haplotype completion. Int. J. Bioinform. Res. Appl. 1(4): 461-473 (2005) - [j2]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
Reconciling a gene tree to a species tree under the duplication cost model. Theor. Comput. Sci. 347(1-2): 36-53 (2005) - [c5]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Lorenzo Mariani:
Experimental Analysis of a New Algorithm for Partial Haplotype Completion. International Conference on Computational Science (2) 2005: 952-959 - [c4]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang:
Correlation Clustering and Consensus Clustering. ISAAC 2005: 226-235 - [i1]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
Approximating Clustering of Fingerprint Vectors with Missing Values. CoRR abs/cs/0511082 (2005) - 2003
- [j1]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Jing Li:
The Haplotyping Problem: An Overview of Computational Models and Solutions. J. Comput. Sci. Technol. 18(6): 675-688 (2003) - [c3]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
Reconciling Gene Trees to a Species Tree. CIAC 2003: 120-131 - [c2]Alessandra Agostini, Sara Albolino, Giorgio De Michelis, Flavio De Paoli, Riccardo Dondi:
Stimulating knowledge discovery and sharing. GROUP 2003: 248-257 - [c1]Roberto Boselli, Flavio De Paoli, Riccardo Dondi:
Knowledge Organization and Retrieval in the MILK System. SEKE 2003: 372-376
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
