default search action
Paola Bertolazzi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j33]Francesco Taglino
, Fabio Cumbo, Giulia Antognoli, Ivan Arisi, Mara D'Onofrio, Federico Perazzoni, Roger Voyat, Giulia Fiscon, Federica Conte, Marco Canevelli, Giuseppe Bruno, Patrizia Mecocci, Paola Bertolazzi:
An ontology-based approach for modelling and querying Alzheimer's disease data. BMC Medical Informatics Decis. Mak. 23(1): 153 (2023)
2010 – 2019
- 2018
- [j32]Emanuel Weitschek, Silvia Di Lauro, Eleonora Cappelli, Paola Bertolazzi, Giovanni Felici:
CamurWeb: a classification software and a large knowledge base for gene expression data of cancer. BMC Bioinform. 19-S(10): 245-256 (2018) - [j31]Giulia Fiscon
Combining EEG signal processing with supervised methods for Alzheimer's patients classification. BMC Medical Informatics Decis. Mak. 18(1): 35:1-35:10 (2018) - [c20]Ivan Arisi, Paola Bertolazzi, Eleonora Cappelli, Federica Conte, Fabio Cumbo
An ontology-based approach to improve data querying and organization of Alzheimer's Disease data. BIBM 2018: 2732-2734 - [c19]Ivan Arisi, Mara D'Onofrio, Rossella Brandi
Mining clinical and laboratory data of neurodegenerative diseases by Machine Learning: transcriptomic biomarkers. BIBM 2018: 2735-2737 - [c18]Giulia Fiscon, Emanuel Weitschek, Maria Cristina De Cola
An integrated approach based on EEG signals processing combined with supervised methods to classify Alzheimer's disease patients. BIBM 2018: 2750-2752 - [c17]Emanuel Weitschek
Classifying Big DNA Methylation Data: A Gene-Oriented Approach. DEXA Workshops 2018: 138-149 - 2017
- [j30]Fabio Previtali, Paola Bertolazzi, Giovanni Felici, Emanuel Weitschek
A novel method and software for automatically classifying Alzheimer's disease patients by magnetic resonance imaging analysis. Comput. Methods Programs Biomed. 143: 89-95 (2017) - 2016
- [j29]Giulia Fiscon
MISSEL: a method to identify a large number of small species-specific genomic subsequences and its application to viruses classification. BioData Min. 9: 38:1-38:24 (2016) - [j28]Valerio Cestarelli, Giulia Fiscon
CAMUR: Knowledge extraction from RNA-seq cancer data through equivalent classification rules. Bioinform. 32(5): 697-704 (2016) - [j27]Katie Wilkins, Mehedi Hassan, Margherita Francescatto, Jakob B. Jespersen
Highlights from the 11th ISCB Student Council Symposium 2015: Dublin, Ireland. 10 July 2015. BMC Bioinform. 17(S-3) (2016) - [j26]Alberto Calderone
Comparing Alzheimer's and Parkinson's diseases networks using graph communities structure. BMC Syst. Biol. 10: 25 (2016) - [j25]Paola Bertolazzi, Giovanni Felici, Paola Festa, Giulia Fiscon
Integer programming models for feature selection: New extensions and a randomized solution algorithm. Eur. J. Oper. Res. 250(2): 389-399 (2016) - [c16]Fabio Cumbo
IRIS-TCGA: An Information Retrieval and Integration System for Genomic Data of Cancer. CIBB 2016: 160-171 - 2015
- [c15]Emanuel Weitschek
GELA: A Software Tool for the Analysis of Gene Expression Data. DEXA Workshops 2015: 31-35 - 2014
- [c14]Giulia Fiscon
Alzheimer's disease patients classification through EEG signals processing. CIDM 2014: 105-112 - 2013
- [c13]Emanuel Weitschek
Clinical Data Mining: Problems, Pitfalls and Solutions. DEXA Workshops 2013: 90-94 - 2012
- [c12]Emanuel Weitschek
MALA: A Microarray Clustering and Classification Software. DEXA Workshops 2012: 201-205 - 2010
- [j24]Paola Bertolazzi, Concettina Guerra, Giampaolo Liuzzi
A global optimization algorithm for protein surface alignment. BMC Bioinform. 11: 488 (2010) - [j23]Paola Bertolazzi, Giovanni Felici
Logic based methods for SNPs tagging and reconstruction. Comput. Oper. Res. 37(8): 1419-1426 (2010) - [j22]Paola Bertolazzi, Jacek Blazewicz
Operations Research Models for Computational Biology, Bioinformatics and Medicine. J. Math. Model. Algorithms 9(3): 209-211 (2010) - [j21]Leonardo Tininini, Paola Bertolazzi, Alessandra Godi, Giuseppe Lancia
CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony. IEEE ACM Trans. Comput. Biol. Bioinform. 7(3): 511-523 (2010)
2000 – 2009
- 2009
- [j20]Paola Bertolazzi, Giovanni Felici
Learning to classify species with barcodes. BMC Bioinform. 10(S-14): 7 (2009) - 2008
- [j19]Paola Bertolazzi, Giovanni Felici
Logic classification and feature selection for biomedical data. Comput. Math. Appl. 55(5): 889-899 (2008) - [j18]Paola Bertolazzi, Alessandra Godi, Martine Labbé
Solving haplotyping inference parsimony problem using a new basic polynomial formulation. Comput. Math. Appl. 55(5): 900-911 (2008) - [j17]Alessandro Avenali, Carlo Batini, Paola Bertolazzi, Paolo Missier
Brokering infrastructure for minimum cost data procurement based on quality-quantity models. Decis. Support Syst. 45(1): 95-109 (2008) - 2004
- [c11]Alessandro Avenali, Paola Bertolazzi, Carlo Batini, Paolo Missier:
A formulation of the Data Quality Optimization Problem in Cooperative Information Systems. CAiSE Workshops (2) 2004: 49-63 - 2002
- [j16]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Quasi-Upward Planarity. Algorithmica 32(3): 474-506 (2002) - [j15]Luca Becchetti
On the design of efficient ATM routing schemes. Theor. Comput. Sci. 270(1-2): 341-359 (2002) - 2001
- [c10]Paola Bertolazzi, Monica Scannapieco:
Introducing Data Quality in a Cooperative Context. IQ 2001: 431-444 - [p1]Paola Bertolazzi, Maria Grazia Fugini, Barbara Pernici:
Information System Design Based on Reuse of Conceptual Components. Information Modeling in the New Millennium 2001: 219-230 - 2000
- [j14]Paola Bertolazzi, Giuseppe Di Battista
Computing Orthogonal Drawings with the Minimum Number of Bends. IEEE Trans. Computers 49(8): 826-840 (2000)
1990 – 1999
- 1998
- [j13]Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia:
Optimal Upward Planarity Testing of Single-Source Digraphs. SIAM J. Comput. 27(1): 132-169 (1998) - [c9]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Quasi-Upward Planarity. GD 1998: 15-29 - 1997
- [j12]Paola Bertolazzi, Caterina De Simone, Anna Galluccio:
A Nice Class for the Vertex Packing Problem. Discret. Appl. Math. 76(1-3): 3-19 (1997) - [c8]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Computing Orthogonal Drawings with the Minimum Number of Bends. WADS 1997: 331-344 - 1995
- [j11]Paola Bertolazzi, Giuseppe Di Battista
Parametric Graph Drawing. IEEE Trans. Software Eng. 21(8): 662-673 (1995) - 1994
- [j10]Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino:
Upward Drawings of Triconnected Digraphs. Algorithmica 12(6): 476-497 (1994) - [j9]Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph. Int. J. Comput. Geom. Appl. 4(4): 385-402 (1994) - 1993
- [c7]Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia:
Optimal Upward Planarity Testing of Single-Source Digraphs. ESA 1993: 37-48 - 1992
- [c6]Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi:
A Framework for Dynamic Graph Drawing. SCG 1992: 261-270 - [c5]Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph (Extended Abstract). SWAT 1992: 272-283 - 1991
- [c4]Paola Bertolazzi, Giuseppe Di Battista:
On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). SCG 1991: 272-280 - [c3]Massimiliano Beccaria, Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta:
A Tailorable and Extensible Automatic Layout Facility. VL 1991: 68-73 - 1990
- [j8]Paola Bertolazzi, Silvio Salza
A Parallel Algorithm for the Visibility Problem from a Point. J. Parallel Distributed Comput. 9(1): 11-14 (1990)
1980 – 1989
- 1989
- [j7]Paola Bertolazzi, Antonio Sassano
A Decomposition Strategy for the Vertex Cover Problem. Inf. Process. Lett. 31(6): 299-304 (1989) - [c2]Paola Bertolazzi, Concettina Guerra, Silvio Salza:
A parallel Algorithm for the visibility problem inside a simple polygon. Recent Issues in Pattern Analysis and Recognition 1989: 65-71 - 1988
- [j6]Paola Bertolazzi, Antonio Sassano:
A Class of Polynomially Solvable Set-Covering Problems. SIAM J. Discret. Math. 1(3): 306-316 (1988) - 1987
- [j5]Paola Bertolazzi, Antonio Sassano
An O(mn) Algorithm for Regular Set-Covering Problems. Theor. Comput. Sci. 54: 237-247 (1987) - 1985
- [j4]Paola Bertolazzi, Gian Carlo Bongiovanni:
A VLSI structure for the deadlock avoidance problem. J. Parallel Distributed Comput. 2(4): 352-361 (1985) - 1984
- [j3]Paola Bertolazzi, Claudio Leporelli, Mario Lucertini:
Alternative group relaxation of integer programming problems. Discret. Appl. Math. 8(2): 143-151 (1984) - 1983
- [c1]Paola Bertolazzi, Michele Missikoff, Mario Terranova:
CID: A VLSI Device for Lists Intersection. IWDM 1983: 188-204 - 1982
- [j2]Paola Bertolazzi, Mario Lucertini, Alberto Marchetti-Spaccamela:
Analysis of a Class of Graph Partitioning Problems. RAIRO Theor. Informatics Appl. 16(3): 255-261 (1982)
1970 – 1979
- 1977
- [j1]Paola Bertolazzi, Lucio Bianco, Salvatore Ricciardelli:
A method for determining the optimal districting in urban emergency services. Comput. Oper. Res. 4(1): 1-12 (1977)
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-10-07 22:10 CEST 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: